Goodstein, R L
2007-01-01
This elementary treatment by a distinguished mathematician employs Boolean algebra as a simple medium for introducing important concepts of modern algebra. Numerous examples appear throughout the text, plus full solutions.
Boolean reasoning the logic of boolean equations
Brown, Frank Markham
2012-01-01
A systematic treatment of Boolean reasoning, this concise, newly revised edition combines the works of early logicians with recent investigations, including previously unpublished research results. Brown begins with an overview of elementary mathematical concepts and outlines the theory of Boolean algebras. Two concluding chapters deal with applications. 1990 edition.
Free Boolean Topological Groups
Ol’ga Sipacheva
2015-11-01
Full Text Available Known and new results on free Boolean topological groups are collected. An account of the properties that these groups share with free or free Abelian topological groups and properties specific to free Boolean groups is given. Special emphasis is placed on the application of set-theoretic methods to the study of Boolean topological groups.
Solomon, Alan D
2012-01-01
REA's Essentials provide quick and easy access to critical information in a variety of different fields, ranging from the most basic to the most advanced. As its name implies, these concise, comprehensive study guides summarize the essentials of the field covered. Essentials are helpful when preparing for exams, doing homework and will remain a lasting reference source for students, teachers, and professionals. Boolean Algebra includes set theory, sentential calculus, fundamental ideas of Boolean algebras, lattices, rings and Boolean algebras, the structure of a Boolean algebra, and Boolean
Korshunov, A D
2003-01-01
Monotone Boolean functions are an important object in discrete mathematics and mathematical cybernetics. Topics related to these functions have been actively studied for several decades. Many results have been obtained, and many papers published. However, until now there has been no sufficiently complete monograph or survey of results of investigations concerning monotone Boolean functions. The object of this survey is to present the main results on monotone Boolean functions obtained during the last 50 years
Tucker, Jerry H.; Tapia, Moiez A.; Bennett, A. Wayne
1988-01-01
The concept of Boolean integration is developed, and different Boolean integral operators are introduced. Given the changes in a desired function in terms of the changes in its arguments, the ways of 'integrating' (i.e. realizing) such a function, if it exists, are presented. The necessary and sufficient conditions for integrating, in different senses, the expression specifying the changes are obtained. Boolean calculus has applications in the design of logic circuits and in fault analysis.
Interpolative Boolean Networks
Vladimir Dobrić
2017-01-01
Full Text Available Boolean networks are used for modeling and analysis of complex systems of interacting entities. Classical Boolean networks are binary and they are relevant for modeling systems with complex switch-like causal interactions. More descriptive power can be provided by the introduction of gradation in this model. If this is accomplished by using conventional fuzzy logics, the generalized model cannot secure the Boolean frame. Consequently, the validity of the model’s dynamics is not secured. The aim of this paper is to present the Boolean consistent generalization of Boolean networks, interpolative Boolean networks. The generalization is based on interpolative Boolean algebra, the [0,1]-valued realization of Boolean algebra. The proposed model is adaptive with respect to the nature of input variables and it offers greater descriptive power as compared with traditional models. For illustrative purposes, IBN is compared to the models based on existing real-valued approaches. Due to the complexity of the most systems to be analyzed and the characteristics of interpolative Boolean algebra, the software support is developed to provide graphical and numerical tools for complex system modeling and analysis.
Properties of Boolean orthoposets
Tkadlec, Josef
1993-10-01
A Boolean orthoposet is the orthoposet P fulfilling the following condition: If a, b ∈ P and a ∧ b = 0, then a ⊥ b. This condition seems to be a sound generalization of distributivity in orthoposets. Also, the class of (orthomodular) Boolean orthoposets may play an interesting role in quantum logic theory. This class is wide enough and, on the other hand, enjoys some properties of Boolean algebras. In this paper we summarize results on Boolean orthoposets involving distributivity, set representation, properties of the state space, existence of Jauch-Piron states, and results concerning orthocompleteness and completion.
Hildreth, Charles R.
1983-01-01
This editorial addresses the issue of whether or not to provide free-text, keyword/boolean search capabilities in the information retrieval mechanisms of online public access catalogs and discusses online catalogs developed prior to 1980--keyword searching, phrase searching, and precoordination and postcoordination. (EJS)
Algebraic partial Boolean algebras
Smith, Derek
2003-01-01
Partial Boolean algebras, first studied by Kochen and Specker in the 1960s, provide the structure for Bell-Kochen-Specker theorems which deny the existence of non-contextual hidden variable theories. In this paper, we study partial Boolean algebras which are 'algebraic' in the sense that their elements have coordinates in an algebraic number field. Several of these algebras have been discussed recently in a debate on the validity of Bell-Kochen-Specker theorems in the context of finite precision measurements. The main result of this paper is that every algebraic finitely-generated partial Boolean algebra B(T) is finite when the underlying space H is three-dimensional, answering a question of Kochen and showing that Conway and Kochen's infinite algebraic partial Boolean algebra has minimum dimension. This result contrasts the existence of an infinite (non-algebraic) B(T) generated by eight elements in an abstract orthomodular lattice of height 3. We then initiate a study of higher-dimensional algebraic partial Boolean algebras. First, we describe a restriction on the determinants of the elements of B(T) that are generated by a given set T. We then show that when the generating set T consists of the rays spanning the minimal vectors in a real irreducible root lattice, B(T) is infinite just if that root lattice has an A 5 sublattice. Finally, we characterize the rays of B(T) when T consists of the rays spanning the minimal vectors of the root lattice E 8
Antonio AIZPURU; Antonio GUTI(E)RREZ-D(A)VILA
2004-01-01
In this paper we will study some families and subalgebras ( ) of ( )(N) that let us characterize the unconditional convergence of series through the weak convergence of subseries ∑i∈A xi, A ∈ ( ).As a consequence, we obtain a new version of the Orlicz-Pettis theorem, for Banach spaces. We also study some relationships between algebraic properties of Boolean algebras and topological properties of the corresponding Stone spaces.
Computational complexity of Boolean functions
Korshunov, Aleksei D [Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk (Russian Federation)
2012-02-28
Boolean functions are among the fundamental objects of discrete mathematics, especially in those of its subdisciplines which fall under mathematical logic and mathematical cybernetics. The language of Boolean functions is convenient for describing the operation of many discrete systems such as contact networks, Boolean circuits, branching programs, and some others. An important parameter of discrete systems of this kind is their complexity. This characteristic has been actively investigated starting from Shannon's works. There is a large body of scientific literature presenting many fundamental results. The purpose of this survey is to give an account of the main results over the last sixty years related to the complexity of computation (realization) of Boolean functions by contact networks, Boolean circuits, and Boolean circuits without branching. Bibliography: 165 titles.
Cryptographic Boolean functions and applications
Cusick, Thomas W
2009-01-01
Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce).Cryptographic Boolean Functions and Applications is a concise reference that shows how Boolean functions are used in cryptography. Currently, practitioners who need to apply Boolean functions in the design of cryptographic algorithms and protocols need to patch together needed information from a variety of resources (books, journal articles and other sources). This book compiles the key essential information in one easy to use, step-by-step reference. Beginning with the basics of the necessary theory the book goes on to examine more technical topics, some of which are at the frontier of current research.-Serves as a complete resource for the successful design or implementation of cryptographic algorithms or protocols using Boolean functions -Provides engineers and scient...
Geometric Operators on Boolean Functions
Frisvad, Jeppe Revall; Falster, Peter
In truth-functional propositional logic, any propositional formula represents a Boolean function (according to some valuation of the formula). We describe operators based on Decartes' concept of constructing coordinate systems, for translation of a propositional formula to the image of a Boolean...... function. With this image of a Boolean function corresponding to a propositional formula, we prove that the orthogonal projection operator leads to a theorem describing all rules of inference in propositional reasoning. In other words, we can capture all kinds of inference in propositional logic by means...... of a few geometric operators working on the images of Boolean functions. The operators we describe, arise from the niche area of array-based logic and have previously been tightly bound to an array-based representation of Boolean functions. We redefine the operators in an abstract form to make them...
On the existence of cycles of every even length on generalized Fibonacci cubes
Norma Zagaglia Salvi
1996-12-01
Full Text Available A new topology for the interconnection of computing nodes in multiprocessors systems is the generalized Fibonacci cube.It can be embedded as a subgraph in the Boolean cube and it is also a supergraph of other structures. We prove that every edge of such a graph, but few initial cases, belongs to cycles of every even length.
Computing preimages of Boolean networks.
Klotz, Johannes; Bossert, Martin; Schober, Steffen
2013-01-01
In this paper we present an algorithm based on the sum-product algorithm that finds elements in the preimage of a feed-forward Boolean networks given an output of the network. Our probabilistic method runs in linear time with respect to the number of nodes in the network. We evaluate our algorithm for randomly constructed Boolean networks and a regulatory network of Escherichia coli and found that it gives a valid solution in most cases.
Boolean-Valued Belief Functions
Kramosil, Ivan
2002-01-01
Roč. 31, č. 2 (2002), s. 153-181 ISSN 0308-1079 R&D Projects: GA AV ČR IAA1030803 Institutional research plan: AV0Z1030915 Keywords : Dempster-Schafer theory * Boolean algebra Subject RIV: BA - General Mathematics Impact factor: 0.241, year: 2002
Optical programmable Boolean logic unit.
Chattopadhyay, Tanay
2011-11-10
Logic units are the building blocks of many important computational operations likes arithmetic, multiplexer-demultiplexer, radix conversion, parity checker cum generator, etc. Multifunctional logic operation is very much essential in this respect. Here a programmable Boolean logic unit is proposed that can perform 16 Boolean logical operations from a single optical input according to the programming input without changing the circuit design. This circuit has two outputs. One output is complementary to the other. Hence no loss of data can occur. The circuit is basically designed by a 2×2 polarization independent optical cross bar switch. Performance of the proposed circuit has been achieved by doing numerical simulations. The binary logical states (0,1) are represented by the absence of light (null) and presence of light, respectively.
Boolean gates on actin filaments
Siccardi, Stefano; Tuszynski, Jack A.; Adamatzky, Andrew
2016-01-01
Actin is a globular protein which forms long polar filaments in the eukaryotic cytoskeleton. Actin networks play a key role in cell mechanics and cell motility. They have also been implicated in information transmission and processing, memory and learning in neuronal cells. The actin filaments have been shown to support propagation of voltage pulses. Here we apply a coupled nonlinear transmission line model of actin filaments to study interactions between voltage pulses. To represent digital information we assign a logical TRUTH value to the presence of a voltage pulse in a given location of the actin filament, and FALSE to the pulse's absence, so that information flows along the filament with pulse transmission. When two pulses, representing Boolean values of input variables, interact, then they can facilitate or inhibit further propagation of each other. We explore this phenomenon to construct Boolean logical gates and a one-bit half-adder with interacting voltage pulses. We discuss implications of these findings on cellular process and technological applications. - Highlights: • We simulate interaction between voltage pulses using on actin filaments. • We use a coupled nonlinear transmission line model. • We design Boolean logical gates via interactions between the voltage pulses. • We construct one-bit half-adder with interacting voltage pulses.
Boolean gates on actin filaments
Siccardi, Stefano, E-mail: ssiccardi@2ssas.it [The Unconventional Computing Centre, University of the West of England, Bristol (United Kingdom); Tuszynski, Jack A., E-mail: jackt@ualberta.ca [Department of Oncology, University of Alberta, Edmonton, Alberta (Canada); Adamatzky, Andrew, E-mail: andrew.adamatzky@uwe.ac.uk [The Unconventional Computing Centre, University of the West of England, Bristol (United Kingdom)
2016-01-08
Actin is a globular protein which forms long polar filaments in the eukaryotic cytoskeleton. Actin networks play a key role in cell mechanics and cell motility. They have also been implicated in information transmission and processing, memory and learning in neuronal cells. The actin filaments have been shown to support propagation of voltage pulses. Here we apply a coupled nonlinear transmission line model of actin filaments to study interactions between voltage pulses. To represent digital information we assign a logical TRUTH value to the presence of a voltage pulse in a given location of the actin filament, and FALSE to the pulse's absence, so that information flows along the filament with pulse transmission. When two pulses, representing Boolean values of input variables, interact, then they can facilitate or inhibit further propagation of each other. We explore this phenomenon to construct Boolean logical gates and a one-bit half-adder with interacting voltage pulses. We discuss implications of these findings on cellular process and technological applications. - Highlights: • We simulate interaction between voltage pulses using on actin filaments. • We use a coupled nonlinear transmission line model. • We design Boolean logical gates via interactions between the voltage pulses. • We construct one-bit half-adder with interacting voltage pulses.
Reliable dynamics in Boolean and continuous networks
Ackermann, Eva; Drossel, Barbara; Peixoto, Tiago P
2012-01-01
We investigate the dynamical behavior of a model of robust gene regulatory networks which possess ‘entirely reliable’ trajectories. In a Boolean representation, these trajectories are characterized by being insensitive to the order in which the nodes are updated, i.e. they always go through the same sequence of states. The Boolean model for gene activity is compared with a continuous description in terms of differential equations for the concentrations of mRNA and proteins. We found that entirely reliable Boolean trajectories can be reproduced perfectly in the continuous model when realistic Hill coefficients are used. We investigate to what extent this high correspondence between Boolean and continuous trajectories depends on the extent of reliability of the Boolean trajectories, and we identify simple criteria that enable the faithful reproduction of the Boolean dynamics in the continuous description. (paper)
Quantum algorithms for testing Boolean functions
Erika Andersson
2010-06-01
Full Text Available We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2^n possible linear Boolean functions of n variables; given a linear Boolean function, the Bernstein-Vazirani quantum algorithm can deterministically identify which one of these Boolean functions we are given using just one single function query. The same quantum algorithm can also be used to learn which input variables other types of Boolean functions depend on, with a success probability that depends on the form of the Boolean function that is tested, but does not depend on the total number of input variables. We also outline a procedure to futher amplify the success probability, based on another quantum algorithm, the Grover search.
GLOBAL CONVERGENCE FOR THE XOR BOOLEAN NETWORKS
Ho, Juei-Ling
2009-01-01
Shih and Ho have proved a global convergent theorem for boolean network: if a map from $\\{0,1\\}^{n}$ to itself defines a boolean network has the conditions: (1) each column of the discrete Jacobian matrix of each element of $\\{0,1\\}^{n}$ is either a unit vector or a zero vector; (2) all the boolean eigenvalues of the discrete Jacobian matrix of this map evaluated at each element of $\\{0,1\\}^{n}$ are zero, then it has a unique fixed point and this boolean network is global convergent to the fi...
Rational Verification in Iterated Electric Boolean Games
Youssouf Oualhadj
2016-07-01
Full Text Available Electric boolean games are compact representations of games where the players have qualitative objectives described by LTL formulae and have limited resources. We study the complexity of several decision problems related to the analysis of rationality in electric boolean games with LTL objectives. In particular, we report that the problem of deciding whether a profile is a Nash equilibrium in an iterated electric boolean game is no harder than in iterated boolean games without resource bounds. We show that it is a PSPACE-complete problem. As a corollary, we obtain that both rational elimination and rational construction of Nash equilibria by a supervising authority are PSPACE-complete problems.
2015-01-01
Mesh generation and visualization software based on the CGAL library. Folder content: drawmesh Visualize slices of the mesh (surface/volumetric) as wireframe on top of an image (3D). drawsurf Visualize surfaces of the mesh (surface/volumetric). img2mesh Convert isosurface in image to volumetric m...... mesh (medit format). img2off Convert isosurface in image to surface mesh (off format). off2mesh Convert surface mesh (off format) to volumetric mesh (medit format). reduce Crop and resize 3D and stacks of images. data Example data to test the library on...
Boolean integral calculus for digital systems
Tucker, J. H.; Tapia, M. A.; Bennett, A. W.
1985-01-01
The concept of Boolean integration is introduced and developed. When the changes in a desired function are specified in terms of changes in its arguments, then ways of 'integrating' (i.e., realizing) the function, if it exists, are presented. Boolean integral calculus has applications in design of logic circuits.
On Boolean functions with generalized cryptographic properties
Braeken, A.; Nikov, V.S.; Nikova, S.I.; Preneel, B.; Canteaut, A.; Viswanathan, K.
2004-01-01
By considering a new metric, we generalize cryptographic properties of Boolean functions such as resiliency and propagation characteristics. These new definitions result in a better understanding of the properties of Boolean functions and provide a better insight in the space defined by this metric.
Mining TCGA data using Boolean implications.
Subarna Sinha
Full Text Available Boolean implications (if-then rules provide a conceptually simple, uniform and highly scalable way to find associations between pairs of random variables. In this paper, we propose to use Boolean implications to find relationships between variables of different data types (mutation, copy number alteration, DNA methylation and gene expression from the glioblastoma (GBM and ovarian serous cystadenoma (OV data sets from The Cancer Genome Atlas (TCGA. We find hundreds of thousands of Boolean implications from these data sets. A direct comparison of the relationships found by Boolean implications and those found by commonly used methods for mining associations show that existing methods would miss relationships found by Boolean implications. Furthermore, many relationships exposed by Boolean implications reflect important aspects of cancer biology. Examples of our findings include cis relationships between copy number alteration, DNA methylation and expression of genes, a new hierarchy of mutations and recurrent copy number alterations, loss-of-heterozygosity of well-known tumor suppressors, and the hypermethylation phenotype associated with IDH1 mutations in GBM. The Boolean implication results used in the paper can be accessed at http://crookneck.stanford.edu/microarray/TCGANetworks/.
Stability of Boolean multilevel networks.
Cozzo, Emanuele; Arenas, Alex; Moreno, Yamir
2012-09-01
The study of the interplay between the structure and dynamics of complex multilevel systems is a pressing challenge nowadays. In this paper, we use a semiannealed approximation to study the stability properties of random Boolean networks in multiplex (multilayered) graphs. Our main finding is that the multilevel structure provides a mechanism for the stabilization of the dynamics of the whole system even when individual layers work on the chaotic regime, therefore identifying new ways of feedback between the structure and the dynamics of these systems. Our results point out the need for a conceptual transition from the physics of single-layered networks to the physics of multiplex networks. Finally, the fact that the coupling modifies the phase diagram and the critical conditions of the isolated layers suggests that interdependency can be used as a control mechanism.
Out of the Cube: Augmented Rubik's Cube
Oriel Bergig
2011-01-01
Full Text Available Computer gaming habits have a tendency to evolve with technology, the best being ones that immerse both our imagination and intellect. Here, we describe a new game platform, an Augmented Reality Rubik's cube. The cube acts simultaneously as both the controller and the game board. Gameplay is controlled by the cube, and game assets are rendered on top of it. Shuffling and tilting operations on the cube are mapped to game interaction. We discuss the game design decisions involved in developing a game for this platform, as well as the technological challenges in implementing it. Ultimately, we describe two games and discuss the conclusions of an informal user study based on those games.
Totally optimal decision trees for Boolean functions
Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail
2016-01-01
We study decision trees which are totally optimal relative to different sets of complexity parameters for Boolean functions. A totally optimal tree is an optimal tree relative to each parameter from the set simultaneously. We consider the parameters
Random networks of Boolean cellular automata
Miranda, Enrique [Comision Nacional de Energia Atomica, San Carlos de Bariloche (Argentina). Centro Atomico Bariloche
1990-01-01
Some recent results about random networks of Boolean automata -the Kauffman model- are reviewed. The structure of configuration space is explored. Ultrametricity between cycles is analyzed and the effects of noise in the dynamics are studied. (Author).
Random networks of Boolean cellular automata
Miranda, Enrique
1990-01-01
Some recent results about random networks of Boolean automata -the Kauffman model- are reviewed. The structure of configuration space is explored. Ultrametricity between cycles is analyzed and the effects of noise in the dynamics are studied. (Author)
Representing Boolean Functions by Decision Trees
Chikalov, Igor
2011-01-01
A Boolean or discrete function can be represented by a decision tree. A compact form of decision tree named binary decision diagram or branching program is widely known in logic design [2, 40]. This representation is equivalent to other forms
C. Dalfo
2015-10-01
Full Text Available We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The middle cube graphs can be obtained from the well-known odd graphs by doubling their vertex set. Here we study some of the properties of the middle cube graphs in the light of the theory of distance-regular graphs. In particular, we completely determine their spectra (eigenvalues and their multiplicities, and associated eigenvectors.
Zhang, Xuetao; Huang, Jie; Yigit-Elliott, Serap; Rosenholtz, Ruth
2015-01-01
Observers can quickly search among shaded cubes for one lit from a unique direction. However, replace the cubes with similar 2-D patterns that do not appear to have a 3-D shape, and search difficulty increases. These results have challenged models of visual search and attention. We demonstrate that cube search displays differ from those with “equivalent” 2-D search items in terms of the informativeness of fairly low-level image statistics. This informativeness predicts peripheral discriminability of target-present from target-absent patches, which in turn predicts visual search performance, across a wide range of conditions. Comparing model performance on a number of classic search tasks, cube search does not appear unexpectedly easy. Easy cube search, per se, does not provide evidence for preattentive computation of 3-D scene properties. However, search asymmetries derived from rotating and/or flipping the cube search displays cannot be explained by the information in our current set of image statistics. This may merely suggest a need to modify the model's set of 2-D image statistics. Alternatively, it may be difficult cube search that provides evidence for preattentive computation of 3-D scene properties. By attributing 2-D luminance variations to a shaded 3-D shape, 3-D scene understanding may slow search for 2-D features of the target. PMID:25780063
Slettebo, Christian; Jonsson, Lars Jonas
2016-01-01
This presentation introduces and discusses the development of the CubeSub submersible concept, an Autonomous Underwater Vehicle (AUV) designed around the CubeSat satellite form factor. The presented work is part of the author's MSc thesis in Aerospace Engineering at the Royal Institute of Technology, Stockholm, Sweden, and was performed during an internship at the Mission Design Division of the NASA Ames Research Center, Moffett Field, CA. Still in the early stages of its development, the CubeSub is to become a submersible test-bed for technology qualified for underwater and space environments. With the long-term goal of exploring the underwater environments in outer space, such as the alleged subsurface ocean of Jupiter's moon Europa, a number of technology and operational procedures must be developed and matured. To assist in this, the CubeSub platform is introduced as a tool to allow engineers and scientists to easily test qualified technology underwater. A CubeSat is a class of miniaturized satellite built to a standardized size. The base size is 1U (U for unit), corresponding to a 100 x 100 x 113.5 cu mm cube. A 1U CubeSat can in other words easily be held in one hand. Stacking units give larger satellite sizes such as the also commonly used 1.5U, 2U and 3U. The CubeSat standard is in itself already well established and hundreds of CubeSats have to date been launched into space. Compatible technology is readily available and the know-how exists in the space industry, all of which makes it a firm ground to stand on for the CubeSub. The rationale behind using the CubeSat form factor is to make use of this pre-existing foundation, making the CubeSub easy to develop, modular and readily available. It will thereby aid in the process of maturing the concept of a fully space qualified submersible headed for outer space. As a further clarification, the CubeSub is itself not meant for outer space, but to facilitate development of such a vessel. Along with its uses as a
Apparatus for drying sugar cubes
Derckx, H.A.J.; Torringa, H.M.
1999-01-01
Device for drying sugar cubes containing a heating apparatus for heating and dehumidifying the sugar cubes, a conditioning apparatus for cooling off and possibly further dehumidifying the sugar cubes and a conveying apparatus for conveying the sugar cubes through the heating apparatus and the
Information encryption systems based on Boolean functions
Aureliu Zgureanu
2011-02-01
Full Text Available An information encryption system based on Boolean functions is proposed. Information processing is done using multidimensional matrices, performing logical operations with these matrices. At the basis of ensuring high level security of the system the complexity of solving the problem of building systems of Boolean functions that depend on many variables (tens and hundreds is set. Such systems represent the private key. It varies both during the encryption and decryption of information, and during the transition from one message to another.
Beyond-CMOS Device Benchmarking for Boolean and Non-Boolean Logic Applications
Pan, Chenyun; Naeemi, Azad
2017-01-01
The latest results of benchmarking research are presented for a variety of beyond-CMOS charge- and spin-based devices. In addition to improving the device-level models, several new device proposals and a few majorly modified devices are investigated. Deep pipelining circuits are employed to boost the throughput of low-power devices. Furthermore, the benchmarking methodology is extended to interconnect-centric analyses and non-Boolean logic applications. In contrast to Boolean circuits, non-Bo...
A complexity theory based on Boolean algebra
Skyum, Sven; Valiant, Leslie
1985-01-01
A projection of a Boolean function is a function obtained by substituting for each of its variables a variable, the negation of a variable, or a constant. Reducibilities among computational problems under this relation of projection are considered. It is shown that much of what is of everyday rel...
Evolutionary Algorithms for Boolean Queries Optimization
Húsek, Dušan; Snášel, Václav; Neruda, Roman; Owais, S.S.J.; Krömer, P.
2006-01-01
Roč. 3, č. 1 (2006), s. 15-20 ISSN 1790-0832 R&D Projects: GA AV ČR 1ET100300414 Institutional research plan: CEZ:AV0Z10300504 Keywords : evolutionary algorithms * genetic algorithms * information retrieval * Boolean query Subject RIV: BA - General Mathematics
Boolean Queries Optimization by Genetic Algorithms
Húsek, Dušan; Owais, S.S.J.; Krömer, P.; Snášel, Václav
2005-01-01
Roč. 15, - (2005), s. 395-409 ISSN 1210-0552 R&D Projects: GA AV ČR 1ET100300414 Institutional research plan: CEZ:AV0Z10300504 Keywords : evolutionary algorithms * genetic algorithms * genetic programming * information retrieval * Boolean query Subject RIV: BB - Applied Statistics, Operational Research
Practical algorithms for linear boolean-width
ten Brinke, C.B.; van Houten, F.J.P.; Bodlaender, H.L.
2015-01-01
In this paper, we give a number of new exact algorithms and heuristics to compute linear boolean decompositions, and experimentally evaluate these algorithms. The experimental evaluation shows that significant improvements can be made with respect to running time without increasing the width of the
Practical algorithms for linear Boolean-width
ten Brinke, C.B.; van Houten, F.J.P.; Bodlaender, H.L.
2015-01-01
In this paper, we give a number of new exact algorithms and heuristics to compute linear boolean decompositions, and experimentally evaluate these algorithms. The experimental evaluation shows that significant improvements can be made with respect to running time without increasing the width of the
Imaginary Cubes and Their Puzzles
Hideki Tsuiki
2012-05-01
Full Text Available Imaginary cubes are three dimensional objects which have square silhouette projections in three orthogonal ways just as a cube has. In this paper, we study imaginary cubes and present assembly puzzles based on them. We show that there are 16 equivalence classes of minimal convex imaginary cubes, among whose representatives are a hexagonal bipyramid imaginary cube and a triangular antiprism imaginary cube. Our main puzzle is to put three of the former and six of the latter pieces into a cube-box with an edge length of twice the size of the original cube. Solutions of this puzzle are based on remarkable properties of these two imaginary cubes, in particular, the possibility of tiling 3D Euclidean space.
2008-01-01
We can determine distances between objects and points of interest in 3-D space to a useful degree of accuracy from a set of camera images by using multiple camera views and reference targets in the camera s field of view (FOV). The core of the software processing is based on the previously developed foreign-object debris vision trajectory software (see KSC Research and Technology 2004 Annual Report, pp. 2 5). The current version of this photogrammetry software includes the ability to calculate distances between any specified point pairs, the ability to process any number of reference targets and any number of camera images, user-friendly editing features, including zoom in/out, translate, and load/unload, routines to help mark reference points with a Find function, while comparing them with the reference point database file, and a comprehensive output report in HTML format. In this system, scene reference targets are replaced by a photogrammetry cube whose exterior surface contains multiple predetermined precision 2-D targets. Precise measurement of the cube s 2-D targets during the fabrication phase eliminates the need for measuring 3-D coordinates of reference target positions in the camera's FOV, using for example a survey theodolite or a Faroarm. Placing the 2-D targets on the cube s surface required the development of precise machining methods. In response, 2-D targets were embedded into the surface of the cube and then painted black for high contrast. A 12-inch collapsible cube was developed for room-size scenes. A 3-inch, solid, stainless-steel photogrammetry cube was also fabricated for photogrammetry analysis of small objects.
National Aeronautics and Space Administration — Develop a flexible, modular and user friendly SpaceCube Core Software system that will dramatically simplify SpaceCube application development and enable any...
Random sequential adsorption of cubes
Cieśla, Michał; Kubala, Piotr
2018-01-01
Random packings built of cubes are studied numerically using a random sequential adsorption algorithm. To compare the obtained results with previous reports, three different models of cube orientation sampling were used. Also, three different cube-cube intersection algorithms were tested to find the most efficient one. The study focuses on the mean saturated packing fraction as well as kinetics of packing growth. Microstructural properties of packings were analyzed using density autocorrelation function.
Classical Boolean logic gates with quantum systems
Renaud, N; Joachim, C
2011-01-01
An analytical method is proposed to implement any classical Boolean function in a small quantum system by taking the advantage of its electronic transport properties. The logical input, α = {α 1 , ..., α N }, is used to control well-identified parameters of the Hamiltonian of the system noted H 0 (α). The logical output is encoded in the tunneling current intensity passing through the quantum system when connected to conducting electrodes. It is demonstrated how to implement the six symmetric two-input/one-output Boolean functions in a quantum system. This system can be switched from one logic function to another by changing its structural parameters. The stability of the logic gates is discussed, perturbing the Hamiltonian with noise sources and studying the effect of decoherence.
Totally optimal decision trees for Boolean functions
Chikalov, Igor
2016-07-28
We study decision trees which are totally optimal relative to different sets of complexity parameters for Boolean functions. A totally optimal tree is an optimal tree relative to each parameter from the set simultaneously. We consider the parameters characterizing both time (in the worst- and average-case) and space complexity of decision trees, i.e., depth, total path length (average depth), and number of nodes. We have created tools based on extensions of dynamic programming to study totally optimal trees. These tools are applicable to both exact and approximate decision trees, and allow us to make multi-stage optimization of decision trees relative to different parameters and to count the number of optimal trees. Based on the experimental results we have formulated the following hypotheses (and subsequently proved): for almost all Boolean functions there exist totally optimal decision trees (i) relative to the depth and number of nodes, and (ii) relative to the depth and average depth.
Boolean representations of simplicial complexes and matroids
Rhodes, John
2015-01-01
This self-contained monograph explores a new theory centered around boolean representations of simplicial complexes leading to a new class of complexes featuring matroids as central to the theory. The book illustrates these new tools to study the classical theory of matroids as well as their important geometric connections. Moreover, many geometric and topological features of the theory of matroids find their counterparts in this extended context. Graduate students and researchers working in the areas of combinatorics, geometry, topology, algebra and lattice theory will find this monograph appealing due to the wide range of new problems raised by the theory. Combinatorialists will find this extension of the theory of matroids useful as it opens new lines of research within and beyond matroids. The geometric features and geometric/topological applications will appeal to geometers. Topologists who desire to perform algebraic topology computations will appreciate the algorithmic potential of boolean represent...
Optimal stabilization of Boolean networks through collective influence
Wang, Jiannan; Pei, Sen; Wei, Wei; Feng, Xiangnan; Zheng, Zhiming
2018-03-01
Boolean networks have attracted much attention due to their wide applications in describing dynamics of biological systems. During past decades, much effort has been invested in unveiling how network structure and update rules affect the stability of Boolean networks. In this paper, we aim to identify and control a minimal set of influential nodes that is capable of stabilizing an unstable Boolean network. For locally treelike Boolean networks with biased truth tables, we propose a greedy algorithm to identify influential nodes in Boolean networks by minimizing the largest eigenvalue of a modified nonbacktracking matrix. We test the performance of the proposed collective influence algorithm on four different networks. Results show that the collective influence algorithm can stabilize each network with a smaller set of nodes compared with other heuristic algorithms. Our work provides a new insight into the mechanism that determines the stability of Boolean networks, which may find applications in identifying virulence genes that lead to serious diseases.
Large Sets in Boolean and Non-Boolean Groups and Topology
Ol’ga V. Sipacheva
2017-10-01
Full Text Available Various notions of large sets in groups, including the classical notions of thick, syndetic, and piecewise syndetic sets and the new notion of vast sets in groups, are studied with emphasis on the interplay between such sets in Boolean groups. Natural topologies closely related to vast sets are considered; as a byproduct, interesting relations between vast sets and ultrafilters are revealed.
Vector Boolean Functions: applications in symmetric cryptography
Álvarez Cubero, José Antonio
2015-01-01
Esta tesis establece los fundamentos teóricos y diseña una colección abierta de clases C++ denominada VBF (Vector Boolean Functions) para analizar funciones booleanas vectoriales (funciones que asocian un vector booleano a otro vector booleano) desde una perspectiva criptográfica. Esta nueva implementación emplea la librería NTL de Victor Shoup, incorporando nuevos módulos que complementan a las funciones de NTL, adecuándolas para el análisis criptográfico. La clase fundamental que representa...
Boolean Factor Analysis by Attractor Neural Network
Frolov, A. A.; Húsek, Dušan; Muraviev, I. P.; Polyakov, P.Y.
2007-01-01
Roč. 18, č. 3 (2007), s. 698-707 ISSN 1045-9227 R&D Projects: GA AV ČR 1ET100300419; GA ČR GA201/05/0079 Institutional research plan: CEZ:AV0Z10300504 Keywords : recurrent neural network * Hopfield-like neural network * associative memory * unsupervised learning * neural network architecture * neural network application * statistics * Boolean factor analysis * dimensionality reduction * features clustering * concepts search * information retrieval Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.769, year: 2007
The Boolean algebra and central Galois algebras
George Szeto
2001-01-01
Full Text Available Let B be a Galois algebra with Galois group G, Jg={b∈B∣bx=g(xb for all x∈B} for g∈G, and BJg=Beg for a central idempotent eg. Then a relation is given between the set of elements in the Boolean algebra (Ba,≤ generated by {0,eg∣g∈G} and a set of subgroups of G, and a central Galois algebra Be with a Galois subgroup of G is characterized for an e∈Ba.
Urogynecologic Surgical Mesh Implants
... procedures performed to treat pelvic floor disorders with surgical mesh: Transvaginal mesh to treat POP Transabdominal mesh to treat ... address safety risks Final Order for Reclassification of Surgical Mesh for Transvaginal Pelvic Organ Prolapse Repair Final Order for Effective ...
Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games
Kant, Gijs; van de Pol, Jan Cornelis; Wijs, A.J.; Bošnački, D.; Edelkamp, S.
Parameterised Boolean Equation Systems (PBESs) are sequences of Boolean fixed point equations with data variables, used for, e.g., verification of modal μ-calculus formulae for process algebraic specifications with data. Solving a PBES is usually done by instantiation to a Parity Game and then
Higginbotham, Scott
2016-01-01
The National Aeronautics and Space Administration (NASA) recognizes the tremendous potential that CubeSats (very small satellites) have to inexpensively demonstrate advanced technologies, collect scientific data, and enhance student engagement in Science, Technology, Engineering, and Mathematics (STEM). The CubeSat Launch Initiative (CSLI) was created to provide launch opportunities for CubeSats developed by academic institutions, non-profit entities, and NASA centers. This presentation will provide an overview of the CSLI, its benefits, and its results.
Boolean orthoposets and two-valued states on them
Tkadlec, Josef
1992-06-01
A Boolean orthoposet (see e.g. [2]) is the orthoposet P fulfilling the following condition: If a, b ∈ P and a ∧ b = 0 then a⊥ b. This condition seems to be a sound generalization of distributivity in orthoposets (see e.g. [8]). Also, the class of (orthomodular) Boolean orthoposets may play an interesting role in quantum logic theory. This class is wide enough (see [4,3]) and on the other hand, enjoys some properties of Boolean algebras [4,8,5]. In quantum logic theory an important role is played by so-called Jauch-Piron states [1,6,7]. In this paper we clarify the connection between Boolean orthoposets and orthoposets with "enough" two-valued Jauch-Piron states. Further, we obtain a characterization of Boolean orthoposets in terms of two-valued states.
An adaptable Boolean net trainable to control a computing robot
Lauria, F. E.; Prevete, R.; Milo, M.; Visco, S.
1999-01-01
We discuss a method to implement in a Boolean neural network a Hebbian rule so to obtain an adaptable universal control system. We start by presenting both the Boolean neural net and the Hebbian rule we have considered. Then we discuss, first, the problems arising when the latter is naively implemented in a Boolean neural net, second, the method consenting us to overcome them and the ensuing adaptable Boolean neural net paradigm. Next, we present the adaptable Boolean neural net as an intelligent control system, actually controlling a writing robot, and discuss how to train it in the execution of the elementary arithmetic operations on operands represented by numerals with an arbitrary number of digits
Evolutionary Algorithms for Boolean Functions in Diverse Domains of Cryptography.
Picek, Stjepan; Carlet, Claude; Guilley, Sylvain; Miller, Julian F; Jakobovic, Domagoj
2016-01-01
The role of Boolean functions is prominent in several areas including cryptography, sequences, and coding theory. Therefore, various methods for the construction of Boolean functions with desired properties are of direct interest. New motivations on the role of Boolean functions in cryptography with attendant new properties have emerged over the years. There are still many combinations of design criteria left unexplored and in this matter evolutionary computation can play a distinct role. This article concentrates on two scenarios for the use of Boolean functions in cryptography. The first uses Boolean functions as the source of the nonlinearity in filter and combiner generators. Although relatively well explored using evolutionary algorithms, it still presents an interesting goal in terms of the practical sizes of Boolean functions. The second scenario appeared rather recently where the objective is to find Boolean functions that have various orders of the correlation immunity and minimal Hamming weight. In both these scenarios we see that evolutionary algorithms are able to find high-quality solutions where genetic programming performs the best.
Representing Boolean Functions by Decision Trees
Chikalov, Igor
2011-01-01
A Boolean or discrete function can be represented by a decision tree. A compact form of decision tree named binary decision diagram or branching program is widely known in logic design [2, 40]. This representation is equivalent to other forms, and in some cases it is more compact than values table or even the formula [44]. Representing a function in the form of decision tree allows applying graph algorithms for various transformations [10]. Decision trees and branching programs are used for effective hardware [15] and software [5] implementation of functions. For the implementation to be effective, the function representation should have minimal time and space complexity. The average depth of decision tree characterizes the expected computing time, and the number of nodes in branching program characterizes the number of functional elements required for implementation. Often these two criteria are incompatible, i.e. there is no solution that is optimal on both time and space complexity. © Springer-Verlag Berlin Heidelberg 2011.
Message passing for quantified Boolean formulas
Zhang, Pan; Ramezanpour, Abolfazl; Zecchina, Riccardo; Zdeborová, Lenka
2012-01-01
We introduce two types of message passing algorithms for quantified Boolean formulas (QBF). The first type is a message passing based heuristics that can prove unsatisfiability of the QBF by assigning the universal variables in such a way that the remaining formula is unsatisfiable. In the second type, we use message passing to guide branching heuristics of a Davis–Putnam–Logemann–Loveland (DPLL) complete solver. Numerical experiments show that on random QBFs our branching heuristics give robust exponential efficiency gain with respect to state-of-the-art solvers. We also manage to solve some previously unsolved benchmarks from the QBFLIB library. Apart from this, our study sheds light on using message passing in small systems and as subroutines in complete solvers
Synthesizing biomolecule-based Boolean logic gates.
Miyamoto, Takafumi; Razavi, Shiva; DeRose, Robert; Inoue, Takanari
2013-02-15
One fascinating recent avenue of study in the field of synthetic biology is the creation of biomolecule-based computers. The main components of a computing device consist of an arithmetic logic unit, the control unit, memory, and the input and output devices. Boolean logic gates are at the core of the operational machinery of these parts, and hence to make biocomputers a reality, biomolecular logic gates become a necessity. Indeed, with the advent of more sophisticated biological tools, both nucleic acid- and protein-based logic systems have been generated. These devices function in the context of either test tubes or living cells and yield highly specific outputs given a set of inputs. In this review, we discuss various types of biomolecular logic gates that have been synthesized, with particular emphasis on recent developments that promise increased complexity of logic gate circuitry, improved computational speed, and potential clinical applications.
Multipath Detection Using Boolean Satisfiability Techniques
Fadi A. Aloul
2011-01-01
Full Text Available A new technique for multipath detection in wideband mobile radio systems is presented. The proposed scheme is based on an intelligent search algorithm using Boolean Satisfiability (SAT techniques to search through the uncertainty region of the multipath delays. The SAT-based scheme utilizes the known structure of the transmitted wideband signal, for example, pseudo-random (PN code, to effectively search through the entire space by eliminating subspaces that do not contain a possible solution. The paper presents a framework for modeling the multipath detection problem as a SAT application. It also provides simulation results that demonstrate the effectiveness of the proposed scheme in detecting the multipath components in frequency-selective Rayleigh fading channels.
Synthesizing Biomolecule-based Boolean Logic Gates
Miyamoto, Takafumi; Razavi, Shiva; DeRose, Robert; Inoue, Takanari
2012-01-01
One fascinating recent avenue of study in the field of synthetic biology is the creation of biomolecule-based computers. The main components of a computing device consist of an arithmetic logic unit, the control unit, memory, and the input and output devices. Boolean logic gates are at the core of the operational machinery of these parts, hence to make biocomputers a reality, biomolecular logic gates become a necessity. Indeed, with the advent of more sophisticated biological tools, both nucleic acid- and protein-based logic systems have been generated. These devices function in the context of either test tubes or living cells and yield highly specific outputs given a set of inputs. In this review, we discuss various types of biomolecular logic gates that have been synthesized, with particular emphasis on recent developments that promise increased complexity of logic gate circuitry, improved computational speed, and potential clinical applications. PMID:23526588
The Boolean algebra of Galois algebras
Lianyong Xue
2003-02-01
Full Text Available Let B be a Galois algebra with Galois group G, Jg={bÃ¢ÂˆÂˆB|bx=g(xbÃ¢Â€Â‰for allÃ¢Â€Â‰xÃ¢ÂˆÂˆB} for each gÃ¢ÂˆÂˆG, and BJg=Beg for a central idempotent eg, Ba the Boolean algebra generated by {0,eg|gÃ¢ÂˆÂˆG}, e a nonzero element in Ba, and He={gÃ¢ÂˆÂˆG|eeg=e}. Then, a monomial e is characterized, and the Galois extension Be, generated by e with Galois group He, is investigated.
Optical reversible programmable Boolean logic unit.
Chattopadhyay, Tanay
2012-07-20
Computing with reversibility is the only way to avoid dissipation of energy associated with bit erase. So, a reversible microprocessor is required for future computing. In this paper, a design of a simple all-optical reversible programmable processor is proposed using a polarizing beam splitter, liquid crystal-phase spatial light modulators, a half-wave plate, and plane mirrors. This circuit can perform 16 logical operations according to three programming inputs. Also, inputs can be easily recovered from the outputs. It is named the "reversible programmable Boolean logic unit (RPBLU)." The logic unit is the basic building block of many complex computational operations. Hence the design is important in sense. Two orthogonally polarized lights are defined here as two logical states, respectively.
Boolean Operations with Prism Algebraic Patches
Bajaj, Chandrajit; Paoluzzi, Alberto; Portuesi, Simone; Lei, Na; Zhao, Wenqi
2009-01-01
In this paper we discuss a symbolic-numeric algorithm for Boolean operations, closed in the algebra of curved polyhedra whose boundary is triangulated with algebraic patches (A-patches). This approach uses a linear polyhedron as a first approximation of both the arguments and the result. On each triangle of a boundary representation of such linear approximation, a piecewise cubic algebraic interpolant is built, using a C1-continuous prism algebraic patch (prism A-patch) that interpolates the three triangle vertices, with given normal vectors. The boundary representation only stores the vertices of the initial triangulation and their external vertex normals. In order to represent also flat and/or sharp local features, the corresponding normal-per-face and/or normal-per-edge may be also given, respectively. The topology is described by storing, for each curved triangle, the two triples of pointers to incident vertices and to adjacent triangles. For each triangle, a scaffolding prism is built, produced by its extreme vertices and normals, which provides a containment volume for the curved interpolating A-patch. When looking for the result of a regularized Boolean operation, the 0-set of a tri-variate polynomial within each such prism is generated, and intersected with the analogous 0-sets of the other curved polyhedron, when two prisms have non-empty intersection. The intersection curves of the boundaries are traced and used to decompose each boundary into the 3 standard classes of subpatches, denoted in, out and on. While tracing the intersection curves, the locally refined triangulation of intersecting patches is produced, and added to the boundary representation. PMID:21516262
A transition calculus for Boolean functions. [logic circuit analysis
Tucker, J. H.; Bennett, A. W.
1974-01-01
A transition calculus is presented for analyzing the effect of input changes on the output of logic circuits. The method is closely related to the Boolean difference, but it is more powerful. Both differentiation and integration are considered.
Algebraic model checking for Boolean gene regulatory networks.
Tran, Quoc-Nam
2011-01-01
We present a computational method in which modular and Groebner bases (GB) computation in Boolean rings are used for solving problems in Boolean gene regulatory networks (BN). In contrast to other known algebraic approaches, the degree of intermediate polynomials during the calculation of Groebner bases using our method will never grow resulting in a significant improvement in running time and memory space consumption. We also show how calculation in temporal logic for model checking can be done by means of our direct and efficient Groebner basis computation in Boolean rings. We present our experimental results in finding attractors and control strategies of Boolean networks to illustrate our theoretical arguments. The results are promising. Our algebraic approach is more efficient than the state-of-the-art model checker NuSMV on BNs. More importantly, our approach finds all solutions for the BN problems.
Nonlinear threshold Boolean automata networks and phase transitions
Demongeot, Jacques; Sené, Sylvain
2010-01-01
In this report, we present a formal approach that addresses the problem of emergence of phase transitions in stochastic and attractive nonlinear threshold Boolean automata networks. Nonlinear networks considered are informally defined on the basis of classical stochastic threshold Boolean automata networks in which specific interaction potentials of neighbourhood coalition are taken into account. More precisely, specific nonlinear terms compose local transition functions that define locally t...
Synchronization in an array of coupled Boolean networks
Li, Rui; Chu, Tianguang
2012-01-01
This Letter presents an analytical study of synchronization in an array of coupled deterministic Boolean networks. A necessary and sufficient criterion for synchronization is established based on algebraic representations of logical dynamics in terms of the semi-tensor product of matrices. Some basic properties of a synchronized array of Boolean networks are then derived for the existence of transient states and the upper bound of the number of fixed points. Particularly, an interesting consequence indicates that a “large” mismatch between two coupled Boolean networks in the array may result in loss of synchrony in the entire system. Examples, including the Boolean model of coupled oscillations in the cell cycle, are given to illustrate the present results. -- Highlights: ► We analytically study synchronization in an array of coupled Boolean networks. ► The study is based on the algebraic representations of logical dynamics. ► A necessary and sufficient algebraic criterion for synchronization is established. ► It reveals some basic properties of a synchronized array of Boolean networks. ► A large mismatch between two coupled networks may result in the loss of synchrony.
Andrade, Pedro
2008-01-01
gCube is a service-based framework for eScience applications requiring collaboratory, on-demand, and intensive information processing. It provides to these communities Virtual Research Environments (VREs) to support their activities. gCube is build on top of standard technologies for computational Grids, namely the gLite middleware. The software was produced by the DILIGENT project and will continue to be supported and further developed by the D4Science project. gCube reflects within its name a three-sided interpretation of the Grid vision of resource sharing: sharing of computational resources, sharing of structured data, and sharing of application services. As such, gCube embodies the defining characteristics of computational Grids, data Grids, and virtual data Grids. Precisely, it builds on gLite middleware for managing distributed computations and unstructured data, includes dedicated services for managing data and metadata, provides services for distributed information retrieval, allows the orchestration...
PowerCube: Integrated Power, Propulsion, and Pointing for CubeSats, Phase I
National Aeronautics and Space Administration — Tethers Unlimited, Inc. proposes to develop the PowerCube, an integrated power, propulsion, and pointing solution for CubeSats. The PowerCube combines three...
Lemmer, Kristina
2017-05-01
At present, very few CubeSats have flown in space featuring propulsion systems. Of those that have, the literature is scattered, published in a variety of formats (conference proceedings, contractor websites, technical notes, and journal articles), and often not available for public release. This paper seeks to collect the relevant publically releasable information in one location. To date, only two missions have featured propulsion systems as part of the technology demonstration. The IMPACT mission from the Aerospace Corporation launched several electrospray thrusters from Massachusetts Institute of Technology, and BricSAT-P from the United States Naval Academy had four micro-Cathode Arc Thrusters from George Washington University. Other than these two missions, propulsion on CubeSats has been used only for attitude control and reaction wheel desaturation via cold gas propulsion systems. As the desired capability of CubeSats increases, and more complex missions are planned, propulsion is required to accomplish the science and engineering objectives. This survey includes propulsion systems that have been designed specifically for the CubeSat platform and systems that fit within CubeSat constraints but were developed for other platforms. Throughout the survey, discussion of flight heritage and results of the mission are included where publicly released information and data have been made available. Major categories of propulsion systems that are in this survey are solar sails, cold gas propulsion, electric propulsion, and chemical propulsion systems. Only systems that have been tested in a laboratory or with some flight history are included.
Equivalence Checking of Combinational Circuits using Boolean Expression Diagrams
Hulgaard, Henrik; Williams, Poul Frederick; Andersen, Henrik Reif
1999-01-01
The combinational logic-level equivalence problem is to determine whether two given combinational circuits implement the same Boolean function. This problem arises in a number of CAD applications, for example when checking the correctness of incremental design changes (performed either manually...... or by a design automation tool).This paper introduces a data structure called Boolean Expression Diagrams (BEDs) and two algorithms for transforming a BED into a Reduced Ordered Binary Decision Diagram (OBDD). BEDs are capable of representing any Boolean circuit in linear space and can exploit structural...... similarities between the two circuits that are compared. These properties make BEDs suitable for verifying the equivalence of combinational circuits. BEDs can be seen as an intermediate representation between circuits (which are compact) and OBDDs (which are canonical).Based on a large number of combinational...
Exploiting Surroundedness for Saliency Detection: A Boolean Map Approach.
Zhang, Jianming; Sclaroff, Stan
2016-05-01
We demonstrate the usefulness of surroundedness for eye fixation prediction by proposing a Boolean Map based Saliency model (BMS). In our formulation, an image is characterized by a set of binary images, which are generated by randomly thresholding the image's feature maps in a whitened feature space. Based on a Gestalt principle of figure-ground segregation, BMS computes a saliency map by discovering surrounded regions via topological analysis of Boolean maps. Furthermore, we draw a connection between BMS and the Minimum Barrier Distance to provide insight into why and how BMS can properly captures the surroundedness cue via Boolean maps. The strength of BMS is verified by its simplicity, efficiency and superior performance compared with 10 state-of-the-art methods on seven eye tracking benchmark datasets.
Data Cube Visualization with Blender
Kent, Brian R.; Gárate, Matías
2017-06-01
With the increasing data acquisition rates from observational and computational astrophysics, new tools are needed to study and visualize data. We present a methodology for rendering 3D data cubes using the open-source 3D software Blender. By importing processed observations and numerical simulations through the Voxel Data format, we are able use the Blender interface and Python API to create high-resolution animated visualizations. We review the methods for data import, animation, and camera movement, and present examples of this methodology. The 3D rendering of data cubes gives scientists the ability to create appealing displays that can be used for both scientific presentations as well as public outreach.
A Boolean Approach to Airline Business Model Innovation
Hvass, Kristian Anders
Research in business model innovation has identified its significance in creating a sustainable competitive advantage for a firm, yet there are few empirical studies identifying which combination of business model activities lead to success and therefore deserve innovative attention. This study...... analyzes the business models of North America low-cost carriers from 2001 to 2010 using a Boolean minimization algorithm to identify which combinations of business model activities lead to operational profitability. The research aim is threefold: complement airline literature in the realm of business model...... innovation, introduce Boolean minimization methods to the field, and propose alternative business model activities to North American carriers striving for positive operating results....
Refinement monoids, equidecomposability types, and boolean inverse semigroups
Wehrung, Friedrich
2017-01-01
Adopting a new universal algebraic approach, this book explores and consolidates the link between Tarski's classical theory of equidecomposability types monoids, abstract measure theory (in the spirit of Hans Dobbertin's work on monoid-valued measures on Boolean algebras) and the nonstable K-theory of rings. This is done via the study of a monoid invariant, defined on Boolean inverse semigroups, called the type monoid. The new techniques contrast with the currently available topological approaches. Many positive results, but also many counterexamples, are provided.
On Kolmogorov's superpositions and Boolean functions
Beiu, V.
1998-12-31
The paper overviews results dealing with the approximation capabilities of neural networks, as well as bounds on the size of threshold gate circuits. Based on an explicit numerical (i.e., constructive) algorithm for Kolmogorov's superpositions they will show that for obtaining minimum size neutral networks for implementing any Boolean function, the activation function of the neurons is the identity function. Because classical AND-OR implementations, as well as threshold gate implementations require exponential size (in the worst case), it will follow that size-optimal solutions for implementing arbitrary Boolean functions require analog circuitry. Conclusions and several comments on the required precision are ending the paper.
Optimization-Based Approaches to Control of Probabilistic Boolean Networks
Koichi Kobayashi
2017-02-01
Full Text Available Control of gene regulatory networks is one of the fundamental topics in systems biology. In the last decade, control theory of Boolean networks (BNs, which is well known as a model of gene regulatory networks, has been widely studied. In this review paper, our previously proposed methods on optimal control of probabilistic Boolean networks (PBNs are introduced. First, the outline of PBNs is explained. Next, an optimal control method using polynomial optimization is explained. The finite-time optimal control problem is reduced to a polynomial optimization problem. Furthermore, another finite-time optimal control problem, which can be reduced to an integer programming problem, is also explained.
High-fidelity meshes from tissue samples for diffusion MRI simulations.
Panagiotaki, Eleftheria; Hall, Matt G; Zhang, Hui; Siow, Bernard; Lythgoe, Mark F; Alexander, Daniel C
2010-01-01
This paper presents a method for constructing detailed geometric models of tissue microstructure for synthesizing realistic diffusion MRI data. We construct three-dimensional mesh models from confocal microscopy image stacks using the marching cubes algorithm. Random-walk simulations within the resulting meshes provide synthetic diffusion MRI measurements. Experiments optimise simulation parameters and complexity of the meshes to achieve accuracy and reproducibility while minimizing computation time. Finally we assess the quality of the synthesized data from the mesh models by comparison with scanner data as well as synthetic data from simple geometric models and simplified meshes that vary only in two dimensions. The results support the extra complexity of the three-dimensional mesh compared to simpler models although sensitivity to the mesh resolution is quite robust.
Mesh Excision: Is Total Mesh Excision Necessary?
Wolff, Gillian F; Winters, J Christian; Krlin, Ryan M
2016-04-01
Nearly 29% of women will undergo a secondary, repeat operation for pelvic organ prolapse (POP) symptom recurrence following a primary repair, as reported by Abbott et al. (Am J Obstet Gynecol 210:163.e1-163.e1, 2014). In efforts to decrease the rates of failure, graft materials have been utilized to augment transvaginal repairs. Following the success of using polypropylene mesh (PPM) for stress urinary incontinence (SUI), the use of PPM in the transvaginal repair of POP increased. However, in recent years, significant concerns have been raised about the safety of PPM mesh. Complications, some specific to mesh, such as exposures, erosion, dyspareunia, and pelvic pain, have been reported with increased frequency. In the current literature, there is not substantive evidence to suggest that PPM has intrinsic properties that warrant total mesh removal in the absence of complications. There are a number of complications that can occur after transvaginal mesh placement that do warrant surgical intervention after failure of conservative therapy. In aggregate, there are no high-quality controlled studies that clearly demonstrate that total mesh removal is consistently more likely to achieve pain reduction. In the cases of obstruction and erosion, it seems clear that definitive removal of the offending mesh is associated with resolution of symptoms in the majority of cases and reasonable practice. There are a number of complications that can occur with removal of mesh, and patients should be informed of this as they formulate a choice of treatment. We will review these considerations as we examine the clinical question of whether total versus partial removal of mesh is necessary for the resolution of complications following transvaginal mesh placement.
Confluence of an extension of combinatory logic by Boolean constants
Czajka, Łukasz
2017-01-01
We show confluence of a conditional term rewriting system CL-pc1, which is an extension of Combinatory Logic by Boolean constants. This solves problem 15 from the RTA list of open problems. The proof has been fully formalized in the Coq proof assistant....
On the Road to Genetic Boolean Matrix Factorization
Snášel, V.; Platoš, J.; Krömer, P.; Húsek, Dušan; Frolov, A.
2007-01-01
Roč. 17, č. 6 (2007), s. 675-688 ISSN 1210-0552 Institutional research plan: CEZ:AV0Z10300504 Keywords : data mining * genetic algorithms * Boolean factorization * binary data * machine learning * feature extraction Subject RIV: IN - Informatics, Computer Science Impact factor: 0.280, year: 2007
Document Ranking in E-Extended Boolean Logic
Holub, M.; Húsek, Dušan; Pokorný, J.
1996-01-01
Roč. 4, č. 7 (1996), s. 3-17 ISSN 1310-0513. [Annual Colloquium on IR Research /19./. Aberdeen, 08.04.1997-09.04.1997] R&D Projects: GA ČR GA102/94/0728 Keywords : information retrieval * document ranking * extended Boolean logic
Free Boolean algebras over unions of two well orderings
Bonnet, R.; Faouzi, L.; Kubiś, Wieslaw
2009-01-01
Roč. 156, č. 7 (2009), s. 1177-1185 ISSN 0166-8641 Institutional research plan: CEZ:AV0Z10190503 Keywords : Well quasi orderings * Poset algebras * Superatomic Boolean algebras * Compact distributive lattices Subject RIV: BA - General Mathematics Impact factor: 0.441, year: 2009
Boolean comparative analysis of qualitative data : a methodological note
Romme, A.G.L.
1995-01-01
This paper explores the use of Boolean logic in the analysis of qualitative data, especially on the basis of so-called process theories. Process theories treat independent variables as necessary conditions which are binary rather than variable in nature, while the dependent variable is a final
Parallel object-oriented term rewriting : the booleans
Rodenburg, P.H.; Vrancken, J.L.M.
As a first case study in parallel object-oriented term rewriting, we give two implementations of term rewriting algorithms for boolean terms, using the parallel object-oriented features of the language Pool-T. The term rewriting systems are specified in the specification formalism
A Construction of Boolean Functions with Good Cryptographic Properties
2014-01-01
be subject to a penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number. 1. REPORT...2008, LNCS 5350, Springer–Verlag, 2008, pp. 425–440. [10] C. Carlet and K. Feng, “An Infinite Class of Balanced Vectorial Boolean Functions with Optimum
Properties of Inconel 625 mesh structures grown by electron beam additive manufacturing
List, F.A.; Dehoff, R.R.; Lowe, L.E.; Sames, W.J.
2014-01-01
Relationships between electron beam parameters (beam current, beam speed, and beam focus) and physical properties (mass, diameter, elastic modulus, and yield strength) have been investigated for Inconel 625 mesh cubes fabricated using an additive manufacturing technology based on electron beam melting. The elastic modulus and yield strength of the mesh cubes have been systematically varied by approximately a factor of ten by changing the electron beam parameters. Simple models have been used to understand these relationships. Structural anisotropies of the mesh associated with the layered build architecture have been observed and may contribute, along with microstructural anisotropies, to the anisotropic mechanical properties of the mesh. Knowledge of this kind is likely applicable to other metal and alloy systems and is essential to rapidly realize the full potential of this burgeoning technology
Properties of Inconel 625 mesh structures grown by electron beam additive manufacturing
List, F.A., E-mail: listfaiii@ornl.gov [Oak Ridge National Laboratory, 1 Bethel Valley Rd., Oak Ridge, TN (United States); Dehoff, R.R.; Lowe, L.E. [Oak Ridge National Laboratory, 1 Bethel Valley Rd., Oak Ridge, TN (United States); Sames, W.J. [Texas A and M University, College Station, TX (United States)
2014-10-06
Relationships between electron beam parameters (beam current, beam speed, and beam focus) and physical properties (mass, diameter, elastic modulus, and yield strength) have been investigated for Inconel 625 mesh cubes fabricated using an additive manufacturing technology based on electron beam melting. The elastic modulus and yield strength of the mesh cubes have been systematically varied by approximately a factor of ten by changing the electron beam parameters. Simple models have been used to understand these relationships. Structural anisotropies of the mesh associated with the layered build architecture have been observed and may contribute, along with microstructural anisotropies, to the anisotropic mechanical properties of the mesh. Knowledge of this kind is likely applicable to other metal and alloy systems and is essential to rapidly realize the full potential of this burgeoning technology.
Boolean network representation of contagion dynamics during a financial crisis
Caetano, Marco Antonio Leonel; Yoneyama, Takashi
2015-01-01
This work presents a network model for representation of the evolution of certain patterns of economic behavior. More specifically, after representing the agents as points in a space in which each dimension associated to a relevant economic variable, their relative "motions" that can be either stationary or discordant, are coded into a boolean network. Patterns with stationary averages indicate the maintenance of status quo, whereas discordant patterns represent aggregation of new agent into the cluster or departure from the former policies. The changing patterns can be embedded into a network representation, particularly using the concept of autocatalytic boolean networks. As a case study, the economic tendencies of the BRIC countries + Argentina were studied. Although Argentina is not included in the cluster formed by BRIC countries, it tends to follow the BRIC members because of strong commercial ties.
Boolean Functions with a Simple Certificate for CNF Complexity
Čepek, O.; Kučera, P.; Savický, Petr
2012-01-01
Roč. 160, 4-5 (2012), s. 365-382 ISSN 0166-218X R&D Projects: GA MŠk(CZ) 1M0545 Grant - others:GA ČR(CZ) GP201/07/P168; GA ČR(CZ) GAP202/10/1188 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean functions * CNF representations Subject RIV: BA - General Mathematics Impact factor: 0.718, year: 2012
Elements of Boolean-Valued Dempster-Shafer Theory
Kramosil, Ivan
2000-01-01
Roč. 10, č. 5 (2000), s. 825-835 ISSN 1210-0552. [SOFSEM 2000 Workshop on Soft Computing. Milovy, 27.11.2000-28.11.2000] R&D Projects: GA ČR GA201/00/1489 Institutional research plan: AV0Z1030915 Keywords : Boolean algebra * belief function * Dempster-Shafer theory * Dempster combination rule * nonspecifity degree Subject RIV: BA - General Mathematics
Boolean Models of Biological Processes Explain Cascade-Like Behavior.
Chen, Hao; Wang, Guanyu; Simha, Rahul; Du, Chenghang; Zeng, Chen
2016-01-29
Biological networks play a key role in determining biological function and therefore, an understanding of their structure and dynamics is of central interest in systems biology. In Boolean models of such networks, the status of each molecule is either "on" or "off" and along with the molecules interact with each other, their individual status changes from "on" to "off" or vice-versa and the system of molecules in the network collectively go through a sequence of changes in state. This sequence of changes is termed a biological process. In this paper, we examine the common perception that events in biomolecular networks occur sequentially, in a cascade-like manner, and ask whether this is likely to be an inherent property. In further investigations of the budding and fission yeast cell-cycle, we identify two generic dynamical rules. A Boolean system that complies with these rules will automatically have a certain robustness. By considering the biological requirements in robustness and designability, we show that those Boolean dynamical systems, compared to an arbitrary dynamical system, statistically present the characteristics of cascadeness and sequentiality, as observed in the budding and fission yeast cell- cycle. These results suggest that cascade-like behavior might be an intrinsic property of biological processes.
SETS, Boolean Manipulation for Network Analysis and Fault Tree Analysis
Worrell, R.B.
1985-01-01
Description of problem or function - SETS is used for symbolic manipulation of set (or Boolean) equations, particularly the reduction of set equations by the application of set identities. It is a flexible and efficient tool for performing probabilistic risk analysis (PRA), vital area analysis, and common cause analysis. The equation manipulation capabilities of SETS can also be used to analyze non-coherent fault trees and determine prime implicants of Boolean functions, to verify circuit design implementation, to determine minimum cost fire protection requirements for nuclear reactor plants, to obtain solutions to combinatorial optimization problems with Boolean constraints, and to determine the susceptibility of a facility to unauthorized access through nullification of sensors in its protection system. 4. Method of solution - The SETS program is used to read, interpret, and execute the statements of a SETS user program which is an algorithm that specifies the particular manipulations to be performed and the order in which they are to occur. 5. Restrictions on the complexity of the problem - Any properly formed set equation involving the set operations of union, intersection, and complement is acceptable for processing by the SETS program. Restrictions on the size of a set equation that can be processed are not absolute but rather are related to the number of terms in the disjunctive normal form of the equation, the number of literals in the equation, etc. Nevertheless, set equations involving thousands and even hundreds of thousands of terms can be processed successfully
Controllability and observability of Boolean networks arising from biology
Li, Rui; Yang, Meng; Chu, Tianguang
2015-02-01
Boolean networks are currently receiving considerable attention as a computational scheme for system level analysis and modeling of biological systems. Studying control-related problems in Boolean networks may reveal new insights into the intrinsic control in complex biological systems and enable us to develop strategies for manipulating biological systems using exogenous inputs. This paper considers controllability and observability of Boolean biological networks. We propose a new approach, which draws from the rich theory of symbolic computation, to solve the problems. Consequently, simple necessary and sufficient conditions for reachability, controllability, and observability are obtained, and algorithmic tests for controllability and observability which are based on the Gröbner basis method are presented. As practical applications, we apply the proposed approach to several different biological systems, namely, the mammalian cell-cycle network, the T-cell activation network, the large granular lymphocyte survival signaling network, and the Drosophila segment polarity network, gaining novel insights into the control and/or monitoring of the specific biological systems.
3D Boolean operations in virtual surgical planning.
Charton, Jerome; Laurentjoye, Mathieu; Kim, Youngjun
2017-10-01
Boolean operations in computer-aided design or computer graphics are a set of operations (e.g. intersection, union, subtraction) between two objects (e.g. a patient model and an implant model) that are important in performing accurate and reproducible virtual surgical planning. This requires accurate and robust techniques that can handle various types of data, such as a surface extracted from volumetric data, synthetic models, and 3D scan data. This article compares the performance of the proposed method (Boolean operations by a robust, exact, and simple method between two colliding shells (BORES)) and an existing method based on the Visualization Toolkit (VTK). In all tests presented in this article, BORES could handle complex configurations as well as report impossible configurations of the input. In contrast, the VTK implementations were unstable, do not deal with singular edges and coplanar collisions, and have created several defects. The proposed method of Boolean operations, BORES, is efficient and appropriate for virtual surgical planning. Moreover, it is simple and easy to implement. In future work, we will extend the proposed method to handle non-colliding components.
CubeIndexer: Indexer for regions of interest in data cubes
Chilean Virtual Observatory; Araya, Mauricio; Candia, Gabriel; Gregorio, Rodrigo; Mendoza, Marcelo; Solar, Mauricio
2015-12-01
CubeIndexer indexes regions of interest (ROIs) in data cubes reducing the necessary storage space. The software can process data cubes containing megabytes of data in fractions of a second without human supervision, thus allowing it to be incorporated into a production line for displaying objects in a virtual observatory. The software forms part of the Chilean Virtual Observatory (ChiVO) and provides the capability of content-based searches on data cubes to the astronomical community.
The IceCube Computing Infrastructure Model
CERN. Geneva
2012-01-01
Besides the big LHC experiments a number of mid-size experiments is coming online which need to define new computing models to meet the demands on processing and storage requirements of those experiments. We present the hybrid computing model of IceCube which leverages GRID models with a more flexible direct user model as an example of a possible solution. In IceCube a central datacenter at UW-Madison servers as Tier-0 with a single Tier-1 datacenter at DESY Zeuthen. We describe the setup of the IceCube computing infrastructure and report on our experience in successfully provisioning the IceCube computing needs.
PowerCube: Integrated Power, Propulsion, and Pointing for CubeSats, Phase II
National Aeronautics and Space Administration — The PowerCube is a 1U CubeSat module that provides integrated propulsion, power, and precision pointing to enable the low-cost CubeSat platform to be used to conduct...
On the Computation of Comprehensive Boolean Gröbner Bases
Inoue, Shutaro
We show that a comprehensive Boolean Gröbner basis of an ideal I in a Boolean polynomial ring B (bar A,bar X) with main variables bar X and parameters bar A can be obtained by simply computing a usual Boolean Gröbner basis of I regarding both bar X and bar A as variables with a certain block term order such that bar X ≫ bar A. The result together with a fact that a finite Boolean ring is isomorphic to a direct product of the Galois field mathbb{GF}_2 enables us to compute a comprehensive Boolean Gröbner basis by only computing corresponding Gröbner bases in a polynomial ring over mathbb{GF}_2. Our implementation in a computer algebra system Risa/Asir shows that our method is extremely efficient comparing with existing computation algorithms of comprehensive Boolean Gröbner bases.
Tangible cubes as programming objects
Smith, Andrew C
2006-11-01
Full Text Available by the relative placement of physical cubes. The following six functionalities have been implemented: turn the body left/right, turn the head left/right, and move the body forward/backwards. The movements are all incremental. To achieve maximum body and head... the sequence started. Now, left and right have been “interchanged”. When programming, the child would not take this into consideration. In other words, the co-ordinates of the robot are different to the coordinates of the world, but the programming child...
Collection of Recyclables from Cubes
Wøhlk, Sanne; Bogh, Morten Bie; Mikkelsen, Hardy
2014-01-01
Collection of recyclable materials is a major part of reverse logistics and an important issue in sustainable logistics. In this paper we consider a case study where paper and glass are collected from recycling cubes and transported to a treatment facility where it is processed for reuse. We...... analyze how outsourcing the planning and transportation of the service can result in conflicts of interest and as a consequence cause unsustainable solutions. Finally, we suggest an alternative payment structure which can lead to a common goal, overall economic sustainability, and an improved financial...
... knitted mesh or non-knitted sheet forms. The synthetic materials used can be absorbable, non-absorbable or a combination of absorbable and non-absorbable materials. Animal-derived mesh are made of animal tissue, such as intestine or skin, that has been processed and disinfected to be ...
The mathematics of a quantum Hamiltonian computing half adder Boolean logic gate
Dridi, G; Julien, R; Hliwa, M; Joachim, C
2015-01-01
The mathematics behind the quantum Hamiltonian computing (QHC) approach of designing Boolean logic gates with a quantum system are given. Using the quantum eigenvalue repulsion effect, the QHC AND, NAND, OR, NOR, XOR, and NXOR Hamiltonian Boolean matrices are constructed. This is applied to the construction of a QHC half adder Hamiltonian matrix requiring only six quantum states to fullfil a half Boolean logical truth table. The QHC design rules open a nano-architectronic way of constructing Boolean logic gates inside a single molecule or atom by atom at the surface of a passivated semi-conductor. (paper)
The mathematics of a quantum Hamiltonian computing half adder Boolean logic gate.
Dridi, G; Julien, R; Hliwa, M; Joachim, C
2015-08-28
The mathematics behind the quantum Hamiltonian computing (QHC) approach of designing Boolean logic gates with a quantum system are given. Using the quantum eigenvalue repulsion effect, the QHC AND, NAND, OR, NOR, XOR, and NXOR Hamiltonian Boolean matrices are constructed. This is applied to the construction of a QHC half adder Hamiltonian matrix requiring only six quantum states to fullfil a half Boolean logical truth table. The QHC design rules open a nano-architectronic way of constructing Boolean logic gates inside a single molecule or atom by atom at the surface of a passivated semi-conductor.
Groups acting on CAT(0) cube complexes
Niblo, Graham A.; Reeves, Lawrence
1997-01-01
We show that groups satisfying Kazhdan's property (T) have no unbounded actions on finite dimensional CAT(0) cube complexes, and deduce that there is a locally CAT(-1) Riemannian manifold which is not homotopy equivalent to any finite dimensional, locally CAT(0) cube complex.
The value of less connected agents in Boolean networks
Epstein, Daniel; Bazzan, Ana L. C.
2013-11-01
In multiagent systems, agents often face binary decisions where one seeks to take either the minority or the majority side. Examples are minority and congestion games in general, i.e., situations that require coordination among the agents in order to depict efficient decisions. In minority games such as the El Farol Bar Problem, previous works have shown that agents may reach appropriate levels of coordination, mostly by looking at the history of past decisions. Not many works consider any kind of structure of the social network, i.e., how agents are connected. Moreover, when structure is indeed considered, it assumes some kind of random network with a given, fixed connectivity degree. The present paper departs from the conventional approach in some ways. First, it considers more realistic network topologies, based on preferential attachments. This is especially useful in social networks. Second, the formalism of random Boolean networks is used to help agents to make decisions given their attachments (for example acquaintances). This is coupled with a reinforcement learning mechanism that allows agents to select strategies that are locally and globally efficient. Third, we use agent-based modeling and simulation, a microscopic approach, which allows us to draw conclusions about individuals and/or classes of individuals. Finally, for the sake of illustration we use two different scenarios, namely the El Farol Bar Problem and a binary route choice scenario. With this approach we target systems that adapt dynamically to changes in the environment, including other adaptive decision-makers. Our results using preferential attachments and random Boolean networks are threefold. First we show that an efficient equilibrium can be achieved, provided agents do experimentation. Second, microscopic analysis show that influential agents tend to consider few inputs in their Boolean functions. Third, we have also conducted measurements related to network clustering and centrality
Fulker, D. W.; Pearlman, F.; Pearlman, J.; Arctur, D. K.; Signell, R. P.
2016-12-01
A major challenge for geoscientists—and a key motivation for the National Science Foundation's EarchCube initiative—is to integrate data across disciplines, as is necessary for complex Earth-system studies such as climate change. The attendant technical and social complexities have led EarthCube participants to devise a system-of-systems architectural concept. Its centerpiece is a (virtual) interoperability workbench, around which a learning community can coalesce, supported in their evolving quests to join data from diverse sources, to synthesize new forms of data depicting Earth phenomena, and to overcome immense obstacles that arise, for example, from mismatched nomenclatures, projections, mesh geometries and spatial-temporal scales. The full architectural concept will require significant time and resources to implement, but this presentation describes a (minimal) starter kit. With a keep-it-simple mantra this workbench starter kit can fulfill the following four objectives: 1) demonstrate the feasibility of an interoperability workbench by mid-2017; 2) showcase scientifically useful examples of cross-domain interoperability, drawn, e.g., from funded EarthCube projects; 3) highlight selected aspects of EarthCube's architectural concept, such as a system of systems (SoS) linked via service interfaces; 4) demonstrate how workflows can be designed and used in a manner that enables sharing, promotes collaboration and fosters learning. The outcome, despite its simplicity, will embody service interfaces sufficient to construct—from extant components—data-integration and data-synthesis workflows involving multiple geoscience domains. Tentatively, the starter kit will build on the Jupyter Notebook web application, augmented with libraries for interfacing current services (at data centers involved in EarthCube's Council of Data Facilities, e.g.) and services developed specifically for EarthCube and spanning most geoscience domains.
Bebop to the Boolean boogie an unconventional guide to electronics
Maxfield, Clive
2003-01-01
From reviews of the first edition:""If you want to be reminded of the joy of electronics, take a look at Clive (Max) Maxfield's book Bebop to the Boolean Boogie.""--Computer Design ""Lives up to its title as a useful and entertaining technical guide....well-suited for students, technical writers, technicians, and sales and marketing people.""--Electronic Design""Writing a book like this one takes audacity! ... Maxfield writes lucidly on a variety of complex topics without 'writing down' to his audience."" --EDN""A highly readable, well-illustrated guided tour
Two Expectation-Maximization Algorithms for Boolean Factor Analysis
Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.
2014-01-01
Roč. 130, 23 April (2014), s. 83-97 ISSN 0925-2312 R&D Projects: GA ČR GAP202/10/0262 Grant - others:GA MŠk(CZ) ED1.1.00/02.0070; GA MŠk(CZ) EE.2.3.20.0073 Program:ED Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean Factor analysis * Binary Matrix factorization * Neural networks * Binary data model * Dimension reduction * Bars problem Subject RIV: IN - Informatics, Computer Science Impact factor: 2.083, year: 2014
A boolean optimization method for reloading a nuclear reactor
Misse Nseke, Theophile.
1982-04-01
We attempt to solve the problem of optimal reloading of fuel assemblies in a PWR, without any assumption on the fuel nature. Any loading is marked by n 2 boolean variables usub(ij). The state of the reactor is characterized by his Ksub(eff) and the related power distribution. The resulting non-linear allocation problems are solved throught mathematical programming technics combining the simplex algorithm and an extension of the Balas-Geoffrion's one. Some optimal solutions are given for PWR with assemblies of different enrichment [fr
Complexity classifications for different equivalence and audit problems for Boolean circuits
BÃ¶hler, Elmar; Creignou, Nadia; Galota, Matthias; Reith, Steffen; Schnoor, Henning; Vollmer, Heribert
2010-01-01
We study Boolean circuits as a representation of Boolean functions and conskier different equivalence, audit, and enumeration problems. For a number of restricted sets of gate types (bases) we obtain efficient algorithms, while for all other gate types we show these problems are at least NP-hard.
BEAT: A Web-Based Boolean Expression Fault-Based Test Case Generation Tool
Chen, T. Y.; Grant, D. D.; Lau, M. F.; Ng, S. P.; Vasa, V. R.
2006-01-01
BEAT is a Web-based system that generates fault-based test cases from Boolean expressions. It is based on the integration of our several fault-based test case selection strategies. The generated test cases are considered to be fault-based, because they are aiming at the detection of particular faults. For example, when the Boolean expression is in…
Geometrically Consistent Mesh Modification
Bonito, A.
2010-01-01
A new paradigm of adaptivity is to execute refinement, coarsening, and smoothing of meshes on manifolds with incomplete information about their geometry and yet preserve position and curvature accuracy. We refer to this collectively as geometrically consistent (GC) mesh modification. We discuss the concept of discrete GC, show the failure of naive approaches, and propose and analyze a simple algorithm that is GC and accuracy preserving. © 2010 Society for Industrial and Applied Mathematics.
IceCube Results and PINGU Perspectives
Koskinen, David Jason
2015-01-01
The last three years of IceCube operation with the completed detector have resulted in a plethora of results, including the first observation of high energy astrophysical neutrinos, tests of a possible neutrino flux from atmospheric charm meson decay, and competitive results of neutrino oscillation...... from atmospheric muon neutrino disappearance. Based on the success of IceCube, a new low energy in-fill, known as the Precision IceCube Next Generation Upgrade, is being proposed with the primary physics goal of resolving the ordering of the neutrino mass hierarchy....
Intrinsic viscosity of a suspension of cubes
Mallavajula, Rajesh K.
2013-11-06
We report on the viscosity of a dilute suspension of cube-shaped particles. Irrespective of the particle size, size distribution, and surface chemistry, we find empirically that cubes manifest an intrinsic viscosity [η]=3.1±0.2, which is substantially higher than the well-known value for spheres, [η]=2.5. The orientation-dependent intrinsic viscosity of cubic particles is determined theoretically using a finite-element solution of the Stokes equations. For isotropically oriented cubes, these calculations show [η]=3.1, in excellent agreement with our experimental observations. © 2013 American Physical Society.
Boolean models of biosurfactants production in Pseudomonas fluorescens.
Adrien Richard
Full Text Available Cyclolipopeptides (CLPs are biosurfactants produced by numerous Pseudomonas fluorescens strains. CLP production is known to be regulated at least by the GacA/GacS two-component pathway, but the full regulatory network is yet largely unknown. In the clinical strain MFN1032, CLP production is abolished by a mutation in the phospholipase C gene (plcC and not restored by plcC complementation. Their production is also subject to phenotypic variation. We used a modelling approach with Boolean networks, which takes into account all these observations concerning CLP production without any assumption on the topology of the considered network. Intensive computation yielded numerous models that satisfy these properties. All models minimizing the number of components point to a bistability in CLP production, which requires the presence of a yet unknown key self-inducible regulator. Furthermore, all suggest that a set of yet unexplained phenotypic variants might also be due to this epigenetic switch. The simplest of these Boolean networks was used to propose a biological regulatory network for CLP production. This modelling approach has allowed a possible regulation to be unravelled and an unusual behaviour of CLP production in P. fluorescens to be explained.
Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games
Gijs Kant
2012-10-01
Full Text Available Parameterised Boolean Equation Systems (PBESs are sequences of Boolean fixed point equations with data variables, used for, e.g., verification of modal mu-calculus formulae for process algebraic specifications with data. Solving a PBES is usually done by instantiation to a Parity Game and then solving the game. Practical game solvers exist, but the instantiation step is the bottleneck. We enhance the instantiation in two steps. First, we transform the PBES to a Parameterised Parity Game (PPG, a PBES with each equation either conjunctive or disjunctive. Then we use LTSmin, that offers transition caching, efficient storage of states and both distributed and symbolic state space generation, for generating the game graph. To that end we define a language module for LTSmin, consisting of an encoding of variables with parameters into state vectors, a grouped transition relation and a dependency matrix to indicate the dependencies between parts of the state vector and transition groups. Benchmarks on some large case studies, show that the method speeds up the instantiation significantly and decreases memory usage drastically.
Complex network analysis of state spaces for random Boolean networks
Shreim, Amer [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Berdahl, Andrew [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Sood, Vishal [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Grassberger, Peter [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Paczuski, Maya [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada)
2008-01-15
We apply complex network analysis to the state spaces of random Boolean networks (RBNs). An RBN contains N Boolean elements each with K inputs. A directed state space network (SSN) is constructed by linking each dynamical state, represented as a node, to its temporal successor. We study the heterogeneity of these SSNs at both local and global scales, as well as sample to-sample fluctuations within an ensemble of SSNs. We use in-degrees of nodes as a local topological measure, and the path diversity (Shreim A et al 2007 Phys. Rev. Lett. 98 198701) of an SSN as a global topological measure. RBNs with 2 {<=} K {<=} 5 exhibit non-trivial fluctuations at both local and global scales, while K = 2 exhibits the largest sample-to-sample (possibly non-self-averaging) fluctuations. We interpret the observed 'multi scale' fluctuations in the SSNs as indicative of the criticality and complexity of K = 2 RBNs. 'Garden of Eden' (GoE) states are nodes on an SSN that have in-degree zero. While in-degrees of non-GoE nodes for K > 1 SSNs can assume any integer value between 0 and 2{sup N}, for K = 1 all the non-GoE nodes in a given SSN have the same in-degree which is always a power of two.
Complex network analysis of state spaces for random Boolean networks
Shreim, Amer; Berdahl, Andrew; Sood, Vishal; Grassberger, Peter; Paczuski, Maya
2008-01-01
We apply complex network analysis to the state spaces of random Boolean networks (RBNs). An RBN contains N Boolean elements each with K inputs. A directed state space network (SSN) is constructed by linking each dynamical state, represented as a node, to its temporal successor. We study the heterogeneity of these SSNs at both local and global scales, as well as sample to-sample fluctuations within an ensemble of SSNs. We use in-degrees of nodes as a local topological measure, and the path diversity (Shreim A et al 2007 Phys. Rev. Lett. 98 198701) of an SSN as a global topological measure. RBNs with 2 ≤ K ≤ 5 exhibit non-trivial fluctuations at both local and global scales, while K = 2 exhibits the largest sample-to-sample (possibly non-self-averaging) fluctuations. We interpret the observed 'multi scale' fluctuations in the SSNs as indicative of the criticality and complexity of K = 2 RBNs. 'Garden of Eden' (GoE) states are nodes on an SSN that have in-degree zero. While in-degrees of non-GoE nodes for K > 1 SSNs can assume any integer value between 0 and 2 N , for K = 1 all the non-GoE nodes in a given SSN have the same in-degree which is always a power of two
A Shell Multi-dimensional Hierarchical Cubing Approach for High-Dimensional Cube
Zou, Shuzhi; Zhao, Li; Hu, Kongfa
The pre-computation of data cubes is critical for improving the response time of OLAP systems and accelerating data mining tasks in large data warehouses. However, as the sizes of data warehouses grow, the time it takes to perform this pre-computation becomes a significant performance bottleneck. In a high dimensional data warehouse, it might not be practical to build all these cuboids and their indices. In this paper, we propose a shell multi-dimensional hierarchical cubing algorithm, based on an extension of the previous minimal cubing approach. This method partitions the high dimensional data cube into low multi-dimensional hierarchical cube. Experimental results show that the proposed method is significantly more efficient than other existing cubing methods.
Chemistry Cube Game - Exploring Basic Principles of Chemistry by Turning Cubes.
Müller, Markus T
2018-02-01
The Chemistry Cube Game invites students at secondary school level 1 and 2 to explore basic concepts of chemistry in a playful way, either as individuals or in teams. It consists of 15 different cubes, 9 cubes for different acids, their corresponding bases and precursors, and 6 cubes for different reducing and oxidising agents. The cubes can be rotated in those directions indicated. Each 'allowed' vertical or horizontal rotation of 90° stands for a chemical reaction or a physical transition. Two different games and playing modes are presented here: First, redox chemistry is introduced for the formation of salts from elementary metals and non-metals. Second, the speciation of acids and bases at different pH-values is shown. The cubes can be also used for games about environmental chemistry such as the carbon and sulphur cycle, covering the topic of acid rain, or the nitrogen cycle including ammoniac synthesis, nitrification and de-nitrification.
Lieberoth, J.
1975-06-15
The numerical solution of the neutron diffusion equation plays a very important role in the analysis of nuclear reactors. A wide variety of numerical procedures has been proposed, at which most of the frequently used numerical methods are fundamentally based on the finite- difference approximation where the partial derivatives are approximated by the finite difference. For complex geometries, typical of the practical reactor problems, the computational accuracy of the finite-difference method is seriously affected by the size of the mesh width relative to the neutron diffusion length and by the heterogeneity of the medium. Thus, a very large number of mesh points are generally required to obtain a reasonably accurate approximate solution of the multi-dimensional diffusion equation. Since the computation time is approximately proportional to the number of mesh points, a detailed multidimensional analysis, based on the conventional finite-difference method, is still expensive even with modern large-scale computers. Accordingly, there is a strong incentive to develop alternatives that can reduce the number of mesh-points and still retain accuracy. One of the promising alternatives is the finite element method, which consists of the expansion of the neutron flux by piecewise polynomials. One of the advantages of this procedure is its flexibility in selecting the locations of the mesh points and the degree of the expansion polynomial. The small number of mesh points of the coarse grid enables to store the results of several of the least outer iterations and to calculate well extrapolated values of them by comfortable formalisms. This holds especially if only one energy distribution of fission neutrons is assumed for all fission processes in the reactor, because the whole information of an outer iteration is contained in a field of fission rates which has the size of all mesh points of the coarse grid.
Stability of Roundheads Armoured with Cubes
Burcharth, H. F.; Haagensen, Per; Macineira, Enrique
2003-01-01
The paper presents the results of a hydraulic model test study of the influence of concrete mass density and placement method on the stability of cube armour in a 1:2 slope cone shaped roundhead exposed to short ? crested seas. Location and development of armour displacements were studied...... for concrete cubes with mass density of 2.4 t/m 3 and 2.8 t/m 3 in random and regular placement. Significant increase in stability for the higher mass density cubes was found showing that the same dimension cubes can be used in roundhead and trunk, if for the top layer of the most exposed part of the roundhead...
GALILEO NIMS SPECTRAL IMAGE CUBES: JUPITER OPERATIONS
National Aeronautics and Space Administration — The natural form of imaging spectrometer data is the spectral image cube. It is normally in band sequential format, but has a dual nature. It is a series of 'images'...
CUBE (Computer Use By Engineers) symposium abstracts
Ruminer, J.J.
1978-07-01
This report presents the abstracts for the CUBE (Computer Use by Engineers) Symposium, October 4, through 6, 1978. Contributors are from Lawrence Livermore Laboratory, Los Alamos Scientific Laboratory, and Sandia Laboratories
Adapted Boolean network models for extracellular matrix formation
Wollbold Johannes
2009-07-01
Full Text Available Abstract Background Due to the rapid data accumulation on pathogenesis and progression of chronic inflammation, there is an increasing demand for approaches to analyse the underlying regulatory networks. For example, rheumatoid arthritis (RA is a chronic inflammatory disease, characterised by joint destruction and perpetuated by activated synovial fibroblasts (SFB. These abnormally express and/or secrete pro-inflammatory cytokines, collagens causing joint fibrosis, or tissue-degrading enzymes resulting in destruction of the extra-cellular matrix (ECM. We applied three methods to analyse ECM regulation: data discretisation to filter out noise and to reduce complexity, Boolean network construction to implement logic relationships, and formal concept analysis (FCA for the formation of minimal, but complete rule sets from the data. Results First, we extracted literature information to develop an interaction network containing 18 genes representing ECM formation and destruction. Subsequently, we constructed an asynchronous Boolean network with biologically plausible time intervals for mRNA and protein production, secretion, and inactivation. Experimental gene expression data was obtained from SFB stimulated by TGFβ1 or by TNFα and discretised thereafter. The Boolean functions of the initial network were improved iteratively by the comparison of the simulation runs to the experimental data and by exploitation of expert knowledge. This resulted in adapted networks for both cytokine stimulation conditions. The simulations were further analysed by the attribute exploration algorithm of FCA, integrating the observed time series in a fine-tuned and automated manner. The resulting temporal rules yielded new contributions to controversially discussed aspects of fibroblast biology (e.g., considerable expression of TNF and MMP9 by fibroblasts stimulation and corroborated previously known facts (e.g., co-expression of collagens and MMPs after TNF
Simulating Quantitative Cellular Responses Using Asynchronous Threshold Boolean Network Ensembles
Shah Imran
2011-07-01
Full Text Available Abstract Background With increasing knowledge about the potential mechanisms underlying cellular functions, it is becoming feasible to predict the response of biological systems to genetic and environmental perturbations. Due to the lack of homogeneity in living tissues it is difficult to estimate the physiological effect of chemicals, including potential toxicity. Here we investigate a biologically motivated model for estimating tissue level responses by aggregating the behavior of a cell population. We assume that the molecular state of individual cells is independently governed by discrete non-deterministic signaling mechanisms. This results in noisy but highly reproducible aggregate level responses that are consistent with experimental data. Results We developed an asynchronous threshold Boolean network simulation algorithm to model signal transduction in a single cell, and then used an ensemble of these models to estimate the aggregate response across a cell population. Using published data, we derived a putative crosstalk network involving growth factors and cytokines - i.e., Epidermal Growth Factor, Insulin, Insulin like Growth Factor Type 1, and Tumor Necrosis Factor α - to describe early signaling events in cell proliferation signal transduction. Reproducibility of the modeling technique across ensembles of Boolean networks representing cell populations is investigated. Furthermore, we compare our simulation results to experimental observations of hepatocytes reported in the literature. Conclusion A systematic analysis of the results following differential stimulation of this model by growth factors and cytokines suggests that: (a using Boolean network ensembles with asynchronous updating provides biologically plausible noisy individual cellular responses with reproducible mean behavior for large cell populations, and (b with sufficient data our model can estimate the response to different concentrations of extracellular ligands. Our
Molecular surface mesh generation by filtering electron density map.
Giard, Joachim; Macq, Benoît
2010-01-01
Bioinformatics applied to macromolecules are now widely spread and in continuous expansion. In this context, representing external molecular surface such as the Van der Waals Surface or the Solvent Excluded Surface can be useful for several applications. We propose a fast and parameterizable algorithm giving good visual quality meshes representing molecular surfaces. It is obtained by isosurfacing a filtered electron density map. The density map is the result of the maximum of Gaussian functions placed around atom centers. This map is filtered by an ideal low-pass filter applied on the Fourier Transform of the density map. Applying the marching cubes algorithm on the inverse transform provides a mesh representation of the molecular surface.
Molecular Surface Mesh Generation by Filtering Electron Density Map
Joachim Giard
2010-01-01
Full Text Available Bioinformatics applied to macromolecules are now widely spread and in continuous expansion. In this context, representing external molecular surface such as the Van der Waals Surface or the Solvent Excluded Surface can be useful for several applications. We propose a fast and parameterizable algorithm giving good visual quality meshes representing molecular surfaces. It is obtained by isosurfacing a filtered electron density map. The density map is the result of the maximum of Gaussian functions placed around atom centers. This map is filtered by an ideal low-pass filter applied on the Fourier Transform of the density map. Applying the marching cubes algorithm on the inverse transform provides a mesh representation of the molecular surface.
Boolean modeling in systems biology: an overview of methodology and applications
Wang, Rui-Sheng; Albert, Réka; Saadatpour, Assieh
2012-01-01
Mathematical modeling of biological processes provides deep insights into complex cellular systems. While quantitative and continuous models such as differential equations have been widely used, their use is obstructed in systems wherein the knowledge of mechanistic details and kinetic parameters is scarce. On the other hand, a wealth of molecular level qualitative data on individual components and interactions can be obtained from the experimental literature and high-throughput technologies, making qualitative approaches such as Boolean network modeling extremely useful. In this paper, we build on our research to provide a methodology overview of Boolean modeling in systems biology, including Boolean dynamic modeling of cellular networks, attractor analysis of Boolean dynamic models, as well as inferring biological regulatory mechanisms from high-throughput data using Boolean models. We finally demonstrate how Boolean models can be applied to perform the structural analysis of cellular networks. This overview aims to acquaint life science researchers with the basic steps of Boolean modeling and its applications in several areas of systems biology. (paper)
Griffin: A Tool for Symbolic Inference of Synchronous Boolean Molecular Networks
Stalin Muñoz
2018-03-01
Full Text Available Boolean networks are important models of biochemical systems, located at the high end of the abstraction spectrum. A number of Boolean gene networks have been inferred following essentially the same method. Such a method first considers experimental data for a typically underdetermined “regulation” graph. Next, Boolean networks are inferred by using biological constraints to narrow the search space, such as a desired set of (fixed-point or cyclic attractors. We describe Griffin, a computer tool enhancing this method. Griffin incorporates a number of well-established algorithms, such as Dubrova and Teslenko's algorithm for finding attractors in synchronous Boolean networks. In addition, a formal definition of regulation allows Griffin to employ “symbolic” techniques, able to represent both large sets of network states and Boolean constraints. We observe that when the set of attractors is required to be an exact set, prohibiting additional attractors, a naive Boolean coding of this constraint may be unfeasible. Such cases may be intractable even with symbolic methods, as the number of Boolean constraints may be astronomically large. To overcome this problem, we employ an Artificial Intelligence technique known as “clause learning” considerably increasing Griffin's scalability. Without clause learning only toy examples prohibiting additional attractors are solvable: only one out of seven queries reported here is answered. With clause learning, by contrast, all seven queries are answered. We illustrate Griffin with three case studies drawn from the Arabidopsis thaliana literature. Griffin is available at: http://turing.iimas.unam.mx/griffin.
Documentation for MeshKit - Reactor Geometry (&mesh) Generator
Jain, Rajeev [Argonne National Lab. (ANL), Argonne, IL (United States); Mahadevan, Vijay [Argonne National Lab. (ANL), Argonne, IL (United States)
2015-09-30
This report gives documentation for using MeshKit’s Reactor Geometry (and mesh) Generator (RGG) GUI and also briefly documents other algorithms and tools available in MeshKit. RGG is a program designed to aid in modeling and meshing of complex/large hexagonal and rectilinear reactor cores. RGG uses Argonne’s SIGMA interfaces, Qt and VTK to produce an intuitive user interface. By integrating a 3D view of the reactor with the meshing tools and combining them into one user interface, RGG streamlines the task of preparing a simulation mesh and enables real-time feedback that reduces accidental scripting mistakes that could waste hours of meshing. RGG interfaces with MeshKit tools to consolidate the meshing process, meaning that going from model to mesh is as easy as a button click. This report is designed to explain RGG v 2.0 interface and provide users with the knowledge and skills to pilot RGG successfully. Brief documentation of MeshKit source code, tools and other algorithms available are also presented for developers to extend and add new algorithms to MeshKit. RGG tools work in serial and parallel and have been used to model complex reactor core models consisting of conical pins, load pads, several thousands of axially varying material properties of instrumentation pins and other interstices meshes.
Boolean Algebra Application in Analysis of Flight Accidents
Casandra Venera BALAN
2015-12-01
Full Text Available Fault tree analysis is a deductive approach for resolving an undesired event into its causes, identifying the causes of a failure and providing a framework for a qualitative and quantitative evaluation of the top event. An alternative approach to fault tree analysis methods calculus goes to logical expressions and it is based on a graphical representation of the data structure for a logic - based binary decision diagram representation. In this analysis, such sites will be reduced to a minimal size and arranged in the sense that the variables appear in the same order in each path. An event can be defined as a statement that can be true or false. Therefore, Boolean algebra rules allow restructuring of a Fault Tree into one equivalent to it, but simpler.
Logical Attractors: a Boolean Approach to the Dynamics of Psychosis
Kupper, Z.; Hoffmann, H.
A Boolean modeling approach to attractors in the dynamics of psychosis is presented: Kinetic Logic, originating from R. Thomas, describes systems on an intermediate level between a purely verbal, qualitative description and a description using nonlinear differential equations. With this method we may model impact, feedback and temporal evolution, as well as analyze the resulting attractors. In our previous research the method has been applied to general and more specific questions in the dynamics of psychotic disorders. In this paper a model is introduced that describes different dynamical patterns of chronic psychosis in the context of vocational rehabilitation. It also shows to be useful in formulating and exploring possible treatment strategies. Finally, some of the limitations and benefits of Kinetic Logic as a modeling tool for psychology and psychiatry are discussed.
Unlimited multistability and Boolean logic in microbial signalling
Kothamachu, Varun B; Feliu, Elisenda; Cardelli, Luca
2015-01-01
The ability to map environmental signals onto distinct internal physiological states or programmes is critical for single-celled microbes. A crucial systems dynamics feature underpinning such ability is multistability. While unlimited multistability is known to arise from multi-site phosphorylation...... seen in the signalling networks of eukaryotic cells, a similarly universal mechanism has not been identified in microbial signalling systems. These systems are generally known as two-component systems comprising histidine kinase (HK) receptors and response regulator proteins engaging in phosphotransfer...... further prove that sharing of downstream components allows a system with n multi-domain hybrid HKs to attain 3n steady states. We find that such systems, when sensing distinct signals, can readily implement Boolean logic functions on these signals. Using two experimentally studied examples of two...
Minimum energy control and optimal-satisfactory control of Boolean control network
Li, Fangfei; Lu, Xiwen
2013-01-01
In the literatures, to transfer the Boolean control network from the initial state to the desired state, the expenditure of energy has been rarely considered. Motivated by this, this Letter investigates the minimum energy control and optimal-satisfactory control of Boolean control network. Based on the semi-tensor product of matrices and Floyd's algorithm, minimum energy, constrained minimum energy and optimal-satisfactory control design for Boolean control network are given respectively. A numerical example is presented to illustrate the efficiency of the obtained results.
Vectorial Resilient PC(l) of Order k Boolean Functions from AG-Codes
Hao CHEN; Liang MA; Jianhua LI
2011-01-01
Propagation criteria and resiliency of vectorial Boolean functions are important for cryptographic purpose (see [1- 4, 7, 8, 10, 11, 16]). Kurosawa, Stoh [8] and Carlet [1]gave a construction of Boolean functions satisfying PC(l) of order k from binary linear or nonlinear codes. In this paper, the algebraic-geometric codes over GF(2m) are used to modify the Carlet and Kurosawa-Satoh's construction for giving vectorial resilient Boolean functions satisfying PC(l) of order k criterion. This new construction is compared with previously known results.
Expected Number of Fixed Points in Boolean Networks with Arbitrary Topology.
Mori, Fumito; Mochizuki, Atsushi
2017-07-14
Boolean network models describe genetic, neural, and social dynamics in complex networks, where the dynamics depend generally on network topology. Fixed points in a genetic regulatory network are typically considered to correspond to cell types in an organism. We prove that the expected number of fixed points in a Boolean network, with Boolean functions drawn from probability distributions that are not required to be uniform or identical, is one, and is independent of network topology if only a feedback arc set satisfies a stochastic neutrality condition. We also demonstrate that the expected number is increased by the predominance of positive feedback in a cycle.
CubeSat Launch Initiative Overview and CubeSat 101
Higginbotham, Scott
2017-01-01
The National Aeronautics and Space Administration (NASA) recognizes the tremendous potential that CubeSats (very small satellites) have to inexpensively demonstrate advanced technologies, collect scientific data, and enhance student engagement in Science, Technology, Engineering, and Mathematics (STEM). The CubeSat Launch Initiative (CSLI) was created to provide launch opportunities for CubeSats developed by academic institutions, non-profit entities, and NASA centers. This presentation will provide an overview of the CSLI, its benefits, and its results. This presentation will also provide high level CubeSat 101 information for prospective CubeSat developers, describing the development process from concept through mission operations while highlighting key points that developers need to be mindful of.
Toward An Unstructured Mesh Database
Rezaei Mahdiraji, Alireza; Baumann, Peter Peter
2014-05-01
Unstructured meshes are used in several application domains such as earth sciences (e.g., seismology), medicine, oceanography, cli- mate modeling, GIS as approximate representations of physical objects. Meshes subdivide a domain into smaller geometric elements (called cells) which are glued together by incidence relationships. The subdivision of a domain allows computational manipulation of complicated physical structures. For instance, seismologists model earthquakes using elastic wave propagation solvers on hexahedral meshes. The hexahedral con- tains several hundred millions of grid points and millions of hexahedral cells. Each vertex node in the hexahedrals stores a multitude of data fields. To run simulation on such meshes, one needs to iterate over all the cells, iterate over incident cells to a given cell, retrieve coordinates of cells, assign data values to cells, etc. Although meshes are used in many application domains, to the best of our knowledge there is no database vendor that support unstructured mesh features. Currently, the main tool for querying and manipulating unstructured meshes are mesh libraries, e.g., CGAL and GRAL. Mesh li- braries are dedicated libraries which includes mesh algorithms and can be run on mesh representations. The libraries do not scale with dataset size, do not have declarative query language, and need deep C++ knowledge for query implementations. Furthermore, due to high coupling between the implementations and input file structure, the implementations are less reusable and costly to maintain. A dedicated mesh database offers the following advantages: 1) declarative querying, 2) ease of maintenance, 3) hiding mesh storage structure from applications, and 4) transparent query optimization. To design a mesh database, the first challenge is to define a suitable generic data model for unstructured meshes. We proposed ImG-Complexes data model as a generic topological mesh data model which extends incidence graph model to multi
Interpolation of the discrete logarithm in a finite field of characteristic two by Boolean functions
Brandstaetter, Nina; Lange, Tanja; Winterhof, Arne
2005-01-01
We obtain bounds on degree, weight, and the maximal Fourier coefficient of Boolean functions interpolating the discrete logarithm in finite fields of characteristic two. These bounds complement earlier results for finite fields of odd characteristic....
Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem
Vladimir A. Emelichev
2002-11-01
Full Text Available We consider a multiple criterion Boolean programming problem with MINMAX partial criteria. The extreme level of independent perturbations of partial criteria parameters such that efficient (Pareto optimal solution preserves optimality was obtained.
Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables
Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail
2013-01-01
In this paper, we present the empirical results for relationships between time (depth) and space (number of nodes) complexity of decision trees computing monotone Boolean functions, with at most five variables. We use Dagger (a tool for optimization
Boolean and advanced searching for EDGAR data on www.sec.gov
Securities and Exchange Commission — This search allows users to enter complex boolean queries to access all but the most recent day's EDGAR filings on www.sec.gov. Filings are from 1994 to present.
Circulant Matrices and Affine Equivalence of Monomial Rotation Symmetric Boolean Functions
2015-01-01
degree of the MRS is, we have a similar result as [40, Theorem 1.1] for n = 4p (p prime), or squarefree integers n, which along with our Theorem 5.2...Boolean functions: Construction and analysis in terms of algebraic immunity, in: H. Gilbert, H. Handschuh (Eds.), Fast Software Encryption, in: LNCS...vol. 1403, Springer-Verlag, 1998, pp. 475–488. [20] J.E. Fuller, Analysis of affine equivalent Boolean functions for cryptography (Ph.D. thesis
Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables
Chikalov, Igor
2013-01-01
In this paper, we present the empirical results for relationships between time (depth) and space (number of nodes) complexity of decision trees computing monotone Boolean functions, with at most five variables. We use Dagger (a tool for optimization of decision trees and decision rules) to conduct experiments. We show that, for each monotone Boolean function with at most five variables, there exists a totally optimal decision tree which is optimal with respect to both depth and number of nodes.
An Attractor-Based Complexity Measurement for Boolean Recurrent Neural Networks
Cabessa, Jérémie; Villa, Alessandro E. P.
2014-01-01
We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural networks that represents an assessment of their computational power in terms of the significance of their attractor dynamics. This complexity measurement is achieved by first proving a computational equivalence between Boolean recurrent neural networks and some specific class of -automata, and then translating the most refined classification of -automata to the Boolean neural network context. As a result, a hierarchical classification of Boolean neural networks based on their attractive dynamics is obtained, thus providing a novel refined attractor-based complexity measurement for Boolean recurrent neural networks. These results provide new theoretical insights to the computational and dynamical capabilities of neural networks according to their attractive potentialities. An application of our findings is illustrated by the analysis of the dynamics of a simplified model of the basal ganglia-thalamocortical network simulated by a Boolean recurrent neural network. This example shows the significance of measuring network complexity, and how our results bear new founding elements for the understanding of the complexity of real brain circuits. PMID:24727866
Compressing Data Cube in Parallel OLAP Systems
Frank Dehne
2007-03-01
Full Text Available This paper proposes an efficient algorithm to compress the cubes in the progress of the parallel data cube generation. This low overhead compression mechanism provides block-by-block and record-by-record compression by using tuple difference coding techniques, thereby maximizing the compression ratio and minimizing the decompression penalty at run-time. The experimental results demonstrate that the typical compression ratio is about 30:1 without sacrificing running time. This paper also demonstrates that the compression method is suitable for Hilbert Space Filling Curve, a mechanism widely used in multi-dimensional indexing.
Stability of Roundheads Armoured with Cubes
Burcharth, H. F.; Haagensen, Per; Macineira, Enrique
2003-01-01
The paper presents the results of a hydraulic model test study of the influence of concrete mass density and placement method on the stability of cube armour in a 1:2 slope cone shaped roundhead exposed to short ? crested seas. Location and development of armour displacements were studied...... are used cubes with concrete mass density 2.8 t/m 3 instead of 2.4 t/m 3 . Significant smaller crane capacity is needed compared to the conventional solution of unchanged mass density which implies approximately a doubling the mass of the roundhead armour units....
SUPERIMPOSED MESH PLOTTING IN MCNP
J. HENDRICKS
2001-02-01
The capability to plot superimposed meshes has been added to MCNP{trademark}. MCNP4C featured a superimposed mesh weight window generator which enabled users to set up geometries without having to subdivide geometric cells for variance reduction. The variance reduction was performed with weight windows on a rectangular or cylindrical mesh superimposed over the physical geometry. Experience with the new capability was favorable but also indicated that a number of enhancements would be very beneficial, particularly a means of visualizing the mesh and its values. The mathematics for plotting the mesh and its values is described here along with a description of other upgrades.
Ultracapacitor Based Power Supply for CubeSats, Phase II
National Aeronautics and Space Administration — Traditionally, the relatively small surface area and volume of a cube satellite has restricted the practical power limit of cube satellites. To the extent that the...
NavCube: A fully realized modernized GPS receiver
National Aeronautics and Space Administration — The goal of this IRAD project is to complete the technology development of the modernized Navigator-SpaceCube GPS receiver (named the NavCube), enabling a potential...
Wang, Xinheng
2008-01-01
Wireless telemedicine using GSM and GPRS technologies can only provide low bandwidth connections, which makes it difficult to transmit images and video. Satellite or 3G wireless transmission provides greater bandwidth, but the running costs are high. Wireless networks (WLANs) appear promising, since they can supply high bandwidth at low cost. However, the WLAN technology has limitations, such as coverage. A new wireless networking technology named the wireless mesh network (WMN) overcomes some of the limitations of the WLAN. A WMN combines the characteristics of both a WLAN and ad hoc networks, thus forming an intelligent, large scale and broadband wireless network. These features are attractive for telemedicine and telecare because of the ability to provide data, voice and video communications over a large area. One successful wireless telemedicine project which uses wireless mesh technology is the Emergency Room Link (ER-LINK) in Tucson, Arizona, USA. There are three key characteristics of a WMN: self-organization, including self-management and self-healing; dynamic changes in network topology; and scalability. What we may now see is a shift from mobile communication and satellite systems for wireless telemedicine to the use of wireless networks based on mesh technology, since the latter are very attractive in terms of cost, reliability and speed.
Graphene-based non-Boolean logic circuits
Liu, Guanxiong; Ahsan, Sonia; Khitun, Alexander G.; Lake, Roger K.; Balandin, Alexander A.
2013-10-01
Graphene revealed a number of unique properties beneficial for electronics. However, graphene does not have an energy band-gap, which presents a serious hurdle for its applications in digital logic gates. The efforts to induce a band-gap in graphene via quantum confinement or surface functionalization have not resulted in a breakthrough. Here we show that the negative differential resistance experimentally observed in graphene field-effect transistors of "conventional" design allows for construction of viable non-Boolean computational architectures with the gapless graphene. The negative differential resistance—observed under certain biasing schemes—is an intrinsic property of graphene, resulting from its symmetric band structure. Our atomistic modeling shows that the negative differential resistance appears not only in the drift-diffusion regime but also in the ballistic regime at the nanometer-scale—although the physics changes. The obtained results present a conceptual change in graphene research and indicate an alternative route for graphene's applications in information processing.
Boolean network model of the Pseudomonas aeruginosa quorum sensing circuits.
Dallidis, Stylianos E; Karafyllidis, Ioannis G
2014-09-01
To coordinate their behavior and virulence and to synchronize attacks against their hosts, bacteria communicate by continuously producing signaling molecules (called autoinducers) and continuously monitoring the concentration of these molecules. This communication is controlled by biological circuits called quorum sensing (QS) circuits. Recently QS circuits and have been recognized as an alternative target for controlling bacterial virulence and infections without the use of antibiotics. Pseudomonas aeruginosa is a Gram-negative bacterium that infects insects, plants, animals and humans and can cause acute infections. This bacterium has three interconnected QS circuits that form a very complex and versatile QS system, the operation of which is still under investigation. Here we use Boolean networks to model the complete QS system of Pseudomonas aeruginosa and we simulate and analyze its operation in both synchronous and asynchronous modes. The state space of the QS system is constructed and it turned out to be very large, hierarchical, modular and scale-free. Furthermore, we developed a simulation tool that can simulate gene knock-outs and study their effect on the regulons controlled by the three QS circuits. The model and tools we developed will give to life scientists a deeper insight to this complex QS system.
CubeSat Nighttime Earth Observations
Pack, D. W.; Hardy, B. S.; Longcore, T.
2017-12-01
Satellite monitoring of visible emissions at night has been established as a useful capability for environmental monitoring and mapping the global human footprint. Pioneering work using Defense Meteorological Support Program (DMSP) sensors has been followed by new work using the more capable Visible Infrared Imaging Radiometer Suite (VIIRS). Beginning in 2014, we have been investigating the ability of small visible light cameras on CubeSats to contribute to nighttime Earth science studies via point-and-stare imaging. This paper summarizes our recent research using a common suite of simple visible cameras on several AeroCube satellites to carry out nighttime observations of urban areas and natural gas flares, nighttime weather (including lighting), and fishing fleet lights. Example results include: urban image examples, the utility of color imagery, urban lighting change detection, and multi-frame sequences imaging nighttime weather and large ocean areas with extensive fishing vessel lights. Our results show the potential for CubeSat sensors to improve monitoring of urban growth, light pollution, energy usage, the urban-wildland interface, the improvement of electrical power grids in developing countries, light-induced fisheries, and oil industry flare activity. In addition to orbital results, the nighttime imaging capabilities of new CubeSat sensors scheduled for launch in October 2017 are discussed.
Klein, Spencer R.
2006-01-01
IceCube is a 1 km 3 neutrino observatory being built to study neutrino production in active galactic nuclei, gamma-ray bursts, supernova remnants, and a host of other astrophysical sources. High-energy neutrinos may signal the sources of ultra-high energy cosmic rays. IceCube will also study many particle-physics topics: searches for WIMP annihilation in the Earth or the Sun, and for signatures of supersymmetry in neutrino interactions, studies of neutrino properties, including searches for extra dimensions, and searches for exotica such as magnetic monopoles or Q-balls. IceCube will also study the cosmic-ray composition. In January, 2005, 60 digital optical modules (DOMs) were deployed in the South Polar ice at depths ranging from 1450 to 2450 meters, and 8 ice-tanks, each containing 2 DOMs were deployed as part of a surface air-shower array. All 76 DOMs are collecting high-quality data. After discussing the IceCube physics program and hardware, I will present some initial results with the first DOMs
Teaching Group Theory Using Rubik's Cubes
Cornock, Claire
2015-01-01
Being situated within a course at the applied end of the spectrum of maths degrees, the pure mathematics modules at Sheffield Hallam University have an applied spin. Pure topics are taught through consideration of practical examples such as knots, cryptography and automata. Rubik's cubes are used to teach group theory within a final year pure…
Refining the Barendregt cube using parameters
Kamareddine, F.; Laan, T.D.L.; Nederpelt, R.P.; Kuchen, H.; Ueda, K.
2001-01-01
The Barendregt Cube (introduced in [3]) is a framework in which eight important typed ¿-calculi are described in a uniform way. Moreover, many type systems (like Automath [18], LF [11], ML [17], and system F [10]) can be related to one of these eight systems. Further- more, via the
Using OLAP Data Cubes in Business Intelligence
Cristescu Marian Pompiliu
2016-12-01
Full Text Available The purpose of this paper is to demonstrate that it is possible to develop business intelligence projects in big and medium-size organizations, only with Microsoft products, used in accordance with standard OLAP cube technology, and presented possible alternatives, in relation with the requested functions.
Mesh erosion after abdominal sacrocolpopexy.
Kohli, N; Walsh, P M; Roat, T W; Karram, M M
1998-12-01
To report our experience with erosion of permanent suture or mesh material after abdominal sacrocolpopexy. A retrospective chart review was performed to identify patients who underwent sacrocolpopexy by the same surgeon over 8 years. Demographic data, operative notes, hospital records, and office charts were reviewed after sacrocolpopexy. Patients with erosion of either suture or mesh were treated initially with conservative therapy followed by surgical intervention as required. Fifty-seven patients underwent sacrocolpopexy using synthetic mesh during the study period. The mean (range) postoperative follow-up was 19.9 (1.3-50) months. Seven patients (12%) had erosions after abdominal sacrocolpopexy with two suture erosions and five mesh erosions. Patients with suture erosion were asymptomatic compared with patients with mesh erosion, who presented with vaginal bleeding or discharge. The mean (+/-standard deviation) time to erosion was 14.0+/-7.7 (range 4-24) months. Both patients with suture erosion were treated conservatively with estrogen cream. All five patients with mesh erosion required transvaginal removal of the mesh. Mesh erosion can follow abdominal sacrocolpopexy over a long time, and usually presents as vaginal bleeding or discharge. Although patients with suture erosion can be managed successfully with conservative treatment, patients with mesh erosion require surgical intervention. Transvaginal removal of the mesh with vaginal advancement appears to be an effective treatment in patients failing conservative management.
Notes on the Mesh Handler and Mesh Data Conversion
Lee, Sang Yong; Park, Chan Eok
2009-01-01
At the outset of the development of the thermal-hydraulic code (THC), efforts have been made to utilize the recent technology of the computational fluid dynamics. Among many of them, the unstructured mesh approach was adopted to alleviate the restriction of the grid handling system. As a natural consequence, a mesh handler (MH) has been developed to manipulate the complex mesh data from the mesh generator. The mesh generator, Gambit, was chosen at the beginning of the development of the code. But a new mesh generator, Pointwise, was introduced to get more flexible mesh generation capability. An open source code, Paraview, was chosen as a post processor, which can handle unstructured as well as structured mesh data. Overall data processing system for THC is shown in Figure-1. There are various file formats to save the mesh data in the permanent storage media. A couple of dozen of file formats are found even in the above mentioned programs. A competent mesh handler should have the capability to import or export mesh data as many as possible formats. But, in reality, there are two aspects that make it difficult to achieve the competence. The first aspect to consider is the time and efforts to program the interface code. And the second aspect, which is even more difficult one, is the fact that many mesh data file formats are proprietary information. In this paper, some experience of the development of the format conversion programs will be presented. File formats involved are Gambit neutral format, Ansys-CFX grid file format, VTK legacy file format, Nastran format and CGNS
Streaming simplification of tetrahedral meshes.
Vo, Huy T; Callahan, Steven P; Lindstrom, Peter; Pascucci, Valerio; Silva, Cláudio T
2007-01-01
Unstructured tetrahedral meshes are commonly used in scientific computing to represent scalar, vector, and tensor fields in three dimensions. Visualization of these meshes can be difficult to perform interactively due to their size and complexity. By reducing the size of the data, we can accomplish real-time visualization necessary for scientific analysis. We propose a two-step approach for streaming simplification of large tetrahedral meshes. Our algorithm arranges the data on disk in a streaming, I/O-efficient format that allows coherent access to the tetrahedral cells. A quadric-based simplification is sequentially performed on small portions of the mesh in-core. Our output is a coherent streaming mesh which facilitates future processing. Our technique is fast, produces high quality approximations, and operates out-of-core to process meshes too large for main memory.
CubeSat evolution: Analyzing CubeSat capabilities for conducting science missions
Poghosyan, Armen; Golkar, Alessandro
2017-01-01
Traditionally, the space industry produced large and sophisticated spacecraft handcrafted by large teams of engineers and budgets within the reach of only a few large government-backed institutions. However, over the last decade, the space industry experienced an increased interest towards smaller missions and recent advances in commercial-off-the-shelf (COTS) technology miniaturization spurred the development of small spacecraft missions based on the CubeSat standard. CubeSats were initially envisioned primarily as educational tools or low cost technology demonstration platforms that could be developed and launched within one or two years. Recently, however, more advanced CubeSat missions have been developed and proposed, indicating that CubeSats clearly started to transition from being solely educational and technology demonstration platforms to offer opportunities for low-cost real science missions with potential high value in terms of science return and commercial revenue. Despite the significant progress made in CubeSat research and development over the last decade, some fundamental questions still habitually arise about the CubeSat capabilities, limitations, and ultimately about their scientific and commercial value. The main objective of this review is to evaluate the state of the art CubeSat capabilities with a special focus on advanced scientific missions and a goal of assessing the potential of CubeSat platforms as capable spacecraft. A total of over 1200 launched and proposed missions have been analyzed from various sources including peer-reviewed journal publications, conference proceedings, mission webpages as well as other publicly available satellite databases and about 130 relatively high performance missions were downselected and categorized into six groups based on the primary mission objectives including "Earth Science and Spaceborne Applications", "Deep Space Exploration", "Heliophysics: Space Weather", "Astrophysics", "Spaceborne In Situ
Modeling integrated cellular machinery using hybrid Petri-Boolean networks.
Natalie Berestovsky
Full Text Available The behavior and phenotypic changes of cells are governed by a cellular circuitry that represents a set of biochemical reactions. Based on biological functions, this circuitry is divided into three types of networks, each encoding for a major biological process: signal transduction, transcription regulation, and metabolism. This division has generally enabled taming computational complexity dealing with the entire system, allowed for using modeling techniques that are specific to each of the components, and achieved separation of the different time scales at which reactions in each of the three networks occur. Nonetheless, with this division comes loss of information and power needed to elucidate certain cellular phenomena. Within the cell, these three types of networks work in tandem, and each produces signals and/or substances that are used by the others to process information and operate normally. Therefore, computational techniques for modeling integrated cellular machinery are needed. In this work, we propose an integrated hybrid model (IHM that combines Petri nets and Boolean networks to model integrated cellular networks. Coupled with a stochastic simulation mechanism, the model simulates the dynamics of the integrated network, and can be perturbed to generate testable hypotheses. Our model is qualitative and is mostly built upon knowledge from the literature and requires fine-tuning of very few parameters. We validated our model on two systems: the transcriptional regulation of glucose metabolism in human cells, and cellular osmoregulation in S. cerevisiae. The model produced results that are in very good agreement with experimental data, and produces valid hypotheses. The abstract nature of our model and the ease of its construction makes it a very good candidate for modeling integrated networks from qualitative data. The results it produces can guide the practitioner to zoom into components and interconnections and investigate them
Autonomous Modeling, Statistical Complexity and Semi-annealed Treatment of Boolean Networks
Gong, Xinwei
This dissertation presents three studies on Boolean networks. Boolean networks are a class of mathematical systems consisting of interacting elements with binary state variables. Each element is a node with a Boolean logic gate, and the presence of interactions between any two nodes is represented by directed links. Boolean networks that implement the logic structures of real systems are studied as coarse-grained models of the real systems. Large random Boolean networks are studied with mean field approximations and used to provide a baseline of possible behaviors of large real systems. This dissertation presents one study of the former type, concerning the stable oscillation of a yeast cell-cycle oscillator, and two studies of the latter type, respectively concerning the statistical complexity of large random Boolean networks and an extension of traditional mean field techniques that accounts for the presence of short loops. In the cell-cycle oscillator study, a novel autonomous update scheme is introduced to study the stability of oscillations in small networks. A motif that corrects pulse-growing perturbations and a motif that grows pulses are identified. A combination of the two motifs is capable of sustaining stable oscillations. Examining a Boolean model of the yeast cell-cycle oscillator using an autonomous update scheme yields evidence that it is endowed with such a combination. Random Boolean networks are classified as ordered, critical or disordered based on their response to small perturbations. In the second study, random Boolean networks are taken as prototypical cases for the evaluation of two measures of complexity based on a criterion for optimal statistical prediction. One measure, defined for homogeneous systems, does not distinguish between the static spatial inhomogeneity in the ordered phase and the dynamical inhomogeneity in the disordered phase. A modification in which complexities of individual nodes are calculated yields vanishing
Surface meshing with curvature convergence
Li, Huibin; Zeng, Wei; Morvan, Jean-Marie; Chen, Liming; Gu, Xianfengdavid
2014-01-01
Surface meshing plays a fundamental role in graphics and visualization. Many geometric processing tasks involve solving geometric PDEs on meshes. The numerical stability, convergence rates and approximation errors are largely determined by the mesh qualities. In practice, Delaunay refinement algorithms offer satisfactory solutions to high quality mesh generations. The theoretical proofs for volume based and surface based Delaunay refinement algorithms have been established, but those for conformal parameterization based ones remain wide open. This work focuses on the curvature measure convergence for the conformal parameterization based Delaunay refinement algorithms. Given a metric surface, the proposed approach triangulates its conformal uniformization domain by the planar Delaunay refinement algorithms, and produces a high quality mesh. We give explicit estimates for the Hausdorff distance, the normal deviation, and the differences in curvature measures between the surface and the mesh. In contrast to the conventional results based on volumetric Delaunay refinement, our stronger estimates are independent of the mesh structure and directly guarantee the convergence of curvature measures. Meanwhile, our result on Gaussian curvature measure is intrinsic to the Riemannian metric and independent of the embedding. In practice, our meshing algorithm is much easier to implement and much more efficient. The experimental results verified our theoretical results and demonstrated the efficiency of the meshing algorithm. © 2014 IEEE.
Surface meshing with curvature convergence
Li, Huibin
2014-06-01
Surface meshing plays a fundamental role in graphics and visualization. Many geometric processing tasks involve solving geometric PDEs on meshes. The numerical stability, convergence rates and approximation errors are largely determined by the mesh qualities. In practice, Delaunay refinement algorithms offer satisfactory solutions to high quality mesh generations. The theoretical proofs for volume based and surface based Delaunay refinement algorithms have been established, but those for conformal parameterization based ones remain wide open. This work focuses on the curvature measure convergence for the conformal parameterization based Delaunay refinement algorithms. Given a metric surface, the proposed approach triangulates its conformal uniformization domain by the planar Delaunay refinement algorithms, and produces a high quality mesh. We give explicit estimates for the Hausdorff distance, the normal deviation, and the differences in curvature measures between the surface and the mesh. In contrast to the conventional results based on volumetric Delaunay refinement, our stronger estimates are independent of the mesh structure and directly guarantee the convergence of curvature measures. Meanwhile, our result on Gaussian curvature measure is intrinsic to the Riemannian metric and independent of the embedding. In practice, our meshing algorithm is much easier to implement and much more efficient. The experimental results verified our theoretical results and demonstrated the efficiency of the meshing algorithm. © 2014 IEEE.
Wensheng Guo
Full Text Available In biological systems, the dynamic analysis method has gained increasing attention in the past decade. The Boolean network is the most common model of a genetic regulatory network. The interactions of activation and inhibition in the genetic regulatory network are modeled as a set of functions of the Boolean network, while the state transitions in the Boolean network reflect the dynamic property of a genetic regulatory network. A difficult problem for state transition analysis is the finding of attractors. In this paper, we modeled the genetic regulatory network as a Boolean network and proposed a solving algorithm to tackle the attractor finding problem. In the proposed algorithm, we partitioned the Boolean network into several blocks consisting of the strongly connected components according to their gradients, and defined the connection between blocks as decision node. Based on the solutions calculated on the decision nodes and using a satisfiability solving algorithm, we identified the attractors in the state transition graph of each block. The proposed algorithm is benchmarked on a variety of genetic regulatory networks. Compared with existing algorithms, it achieved similar performance on small test cases, and outperformed it on larger and more complex ones, which happens to be the trend of the modern genetic regulatory network. Furthermore, while the existing satisfiability-based algorithms cannot be parallelized due to their inherent algorithm design, the proposed algorithm exhibits a good scalability on parallel computing architectures.
The spruce budworm and forest: a qualitative comparison of ODE and Boolean models
Raina Robeva
2016-01-01
Full Text Available Boolean and polynomial models of biological systems have emerged recently as viable companions to differential equations models. It is not immediately clear however whether such models are capable of capturing the multi-stable behaviour of certain biological systems: this behaviour is often sensitive to changes in the values of the model parameters, while Boolean and polynomial models are qualitative in nature. In the past few years, Boolean models of gene regulatory systems have been shown to capture multi-stability at the molecular level, confirming that such models can be used to obtain information about the system’s qualitative dynamics when precise information regarding its parameters may not be available. In this paper, we examine Boolean approximations of a classical ODE model of budworm outbreaks in a forest and show that these models exhibit a qualitative behaviour consistent with that derived from the ODE models. In particular, we demonstrate that these models can capture the bistable nature of insect population outbreaks, thus showing that Boolean models can be successfully utilized beyond the molecular level.
Cosmic Ray Studies with IceCube
Gonzalez, Javier
In this contribution we will give an overview of the cosmic ray studies conducted within the IceCube collaboration. The IceCube detector in the geographical south pole can be used to measure various characteristics of the extensive air showers induced by high energy cosmic rays. With IceTop, the surface component of the detector, we detect the electromagnetic and muon components of the air showers, while with the deep detector we detect the high energy muons. We have measured the energy spectrum of cosmic ray primaries in the range between 1.58PeV and 1.26 EeV. A combined analysis of the high energy muon bundles in the ice and the air shower footprint in IceTop provides a measure of primary composition. We will also discuss how the sensitivity to low energy muons in the air showers has the potential to produce additional measures of primary composition.
EarthCubed: Community Convergence and Communication
Ryan, J. C.; Black, R.; Davis, R.; Dick, C.; Lee, T.; Allison, M. L.
2015-12-01
What drives engagement across a diverse community with the common goal of creating a robust cyberinfrastructure for the geosciences? Which applications, social media venues and outreach mechanisms solicit the most valuable feedback? Of the dizzying toolkit available for community-building, which tools should receive time, attention and dedication? Finally, how does it all relate to better geoscience research? Research projects in the geosciences are rapidly becoming more interdisciplinary, requiring use of broader data-sets and a multitude of data-types in an effort to explain questions important to both the scientific community and the general public. Effective use of the data and tools available requires excellent community communication and engagement across disciplines, as well as a manner to easily obtain and access those data and tools. For over two years, the EarthCube project has sought to create the most active and engaged community possible, bringing together experts from all across the NSF GEO directorate and its many-faceted disciplines. Initial efforts focused on collecting insight and opinions at in-person "end-user workshops," and informal organization of interest groups and teams. Today, efforts feature an organizational structure with dedicated internal communication and outreach groups. The EarthCube Office has been largely responsible for coordination of these groups and the social media and Internet presence of the project to date, through the creation and curation of the EarthCube.org website, social media channels, live-streaming of meetings, and newsletters. Measures of the effectiveness of these efforts will be presented, to serve as potential reference and guidance for other projects seeking to grow their own communities. In addition, we will discuss how the Office's role in outreach and engagement has changed over the past year with the creation of the Engagement and Liaison Teams, and what it signifies for the Office's role in EarthCube
Sun, Mengyang; Cheng, Xianrui; Socolar, Joshua E S
2013-06-01
A common approach to the modeling of gene regulatory networks is to represent activating or repressing interactions using ordinary differential equations for target gene concentrations that include Hill function dependences on regulator gene concentrations. An alternative formulation represents the same interactions using Boolean logic with time delays associated with each network link. We consider the attractors that emerge from the two types of models in the case of a simple but nontrivial network: a figure-8 network with one positive and one negative feedback loop. We show that the different modeling approaches give rise to the same qualitative set of attractors with the exception of a possible fixed point in the ordinary differential equation model in which concentrations sit at intermediate values. The properties of the attractors are most easily understood from the Boolean perspective, suggesting that time-delay Boolean modeling is a useful tool for understanding the logic of regulatory networks.
Acoustic logic gates and Boolean operation based on self-collimating acoustic beams
Zhang, Ting; Xu, Jian-yi; Cheng, Ying; Liu, Xiao-jun; Guo, Jian-zhong
2015-01-01
The reveal of self-collimation effect in two-dimensional (2D) photonic or acoustic crystals has opened up possibilities for signal manipulation. In this paper, we have proposed acoustic logic gates based on the linear interference of self-collimated beams in 2D sonic crystals (SCs) with line-defects. The line defects on the diagonal of the 2D square SCs are actually functioning as a 3 dB splitter. By adjusting the phase difference between two input signals, the basic Boolean logic functions such as XOR, OR, AND, and NOT are achieved both theoretically and experimentally. Due to the non-diffracting property of self-collimation beams, more complex Boolean logic and algorithms such as NAND, NOR, and XNOR can be realized by cascading the basic logic gates. The achievement of acoustic logic gates and Boolean operation provides a promising approach for acoustic signal computing and manipulations
On the Boolean extension of the Birnbaum importance to non-coherent systems
Aliee, Hananeh; Borgonovo, Emanuele; Glaß, Michael; Teich, Jürgen
2017-01-01
The Birnbaum importance measure plays a central role in reliability analysis. It has initially been introduced for coherent systems, where several of its properties hold and where its computation is straightforward. This work introduces a Boolean expression for the notion of criticality that allows the seamless extension of the Birnbaum importance to non-coherent systems. As a key feature, the novel definition makes the computation and encoding straightforward with well-established techniques such as Binary Decision Diagrams (BDDs) or Fault Trees (FTs). Several examples and a case study illustrate the findings. - Highlights: • We propose a Boolean expression for the notion of criticality in coherent and non-coherent systems. • The notion is connected with the Birnbaum importance measure. • The connection with Andrew's and Beeson extension is discussed. • The Boolean expression allows straightforward encoding in Binary Decision Diagrams.
Mechanical system reliability analysis using a combination of graph theory and Boolean function
Tang, J.
2001-01-01
A new method based on graph theory and Boolean function for assessing reliability of mechanical systems is proposed. The procedure for this approach consists of two parts. By using the graph theory, the formula for the reliability of a mechanical system that considers the interrelations of subsystems or components is generated. Use of the Boolean function to examine the failure interactions of two particular elements of the system, followed with demonstrations of how to incorporate such failure dependencies into the analysis of larger systems, a constructive algorithm for quantifying the genuine interconnections between the subsystems or components is provided. The combination of graph theory and Boolean function provides an effective way to evaluate the reliability of a large, complex mechanical system. A numerical example demonstrates that this method an effective approaches in system reliability analysis
OLAP Cube Visualization of Hydrologic Data Catalogs
Zaslavsky, I.; Rodriguez, M.; Beran, B.; Valentine, D.; van Ingen, C.; Wallis, J. C.
2007-12-01
As part of the CUAHSI Hydrologic Information System project, we assemble comprehensive observations data catalogs that support CUAHSI data discovery services (WaterOneFlow services) and online mapping interfaces (e.g. the Data Access System for Hydrology, DASH). These catalogs describe several nation-wide data repositories that are important for hydrologists, including USGS NWIS and EPA STORET data collections. The catalogs contain a wealth of information reflecting the entire history and geography of hydrologic observations in the US. Managing such catalogs requires high performance analysis and visualization technologies. OLAP (Online Analytical Processing) cube, often called data cubes, is an approach to organizing and querying large multi-dimensional data collections. We have applied the OLAP techniques, as implemented in Microsoft SQL Server 2005, to the analysis of the catalogs from several agencies. In this initial report, we focus on the OLAP technology as applied to catalogs, and preliminary results of the analysis. Specifically, we describe the challenges of generating OLAP cube dimensions, and defining aggregations and views for data catalogs as opposed to observations data themselves. The initial results are related to hydrologic data availability from the observations data catalogs. The results reflect geography and history of available data totals from USGS NWIS and EPA STORET repositories, and spatial and temporal dynamics of available measurements for several key nutrient-related parameters.
Glass, H. [Cellnet, Alpharetta, GA (United States)
2006-07-01
Mesh network applications are used by utilities for metering, demand response, and mobile workforce management. This presentation provided an overview of a multi-dimensional mesh application designed to offer improved scalability and higher throughput in advanced metering infrastructure (AMI) systems. Mesh applications can be used in AMI for load balancing and forecasting, as well as for distribution and transmission planning. New revenue opportunities can be realized through the application's ability to improve notification and monitoring services, and customer service communications. Mesh network security features include data encryption, data fragmentation and the automatic re-routing of data. In order to use mesh network applications, networks must have sufficient bandwidth and provide flexibility at the endpoint layer to support multiple devices from multiple vendors, as well as support multiple protocols. It was concluded that smart meters will not enable energy response solutions without an underlying AMI that is reliable, scalable and self-healing. .refs., tabs., figs.
Improving the quantum cost of reversible Boolean functions using reorder algorithm
Ahmed, Taghreed; Younes, Ahmed; Elsayed, Ashraf
2018-05-01
This paper introduces a novel algorithm to synthesize a low-cost reversible circuits for any Boolean function with n inputs represented as a Positive Polarity Reed-Muller expansion. The proposed algorithm applies a predefined rules to reorder the terms in the function to minimize the multi-calculation of common parts of the Boolean function to decrease the quantum cost of the reversible circuit. The paper achieves a decrease in the quantum cost and/or the circuit length, on average, when compared with relevant work in the literature.
Lavrova, Anastasia I; Postnikov, Eugene B; Zyubin, Andrey Yu; Babak, Svetlana V
2017-04-01
We consider two approaches to modelling the cell metabolism of 6-mercaptopurine, one of the important chemotherapy drugs used for treating acute lymphocytic leukaemia: kinetic ordinary differential equations, and Boolean networks supplied with one controlling node, which takes continual values. We analyse their interplay with respect to taking into account ATP concentration as a key parameter of switching between different pathways. It is shown that the Boolean networks, which allow avoiding the complexity of general kinetic modelling, preserve the possibility of reproducing the principal switching mechanism.
Characterizing short-term stability for Boolean networks over any distribution of transfer functions
Seshadhri, C.; Smith, Andrew M.; Vorobeychik, Yevgeniy; Mayo, Jackson R.; Armstrong, Robert C.
2016-01-01
Here we present a characterization of short-term stability of random Boolean networks under arbitrary distributions of transfer functions. Given any distribution of transfer functions for a random Boolean network, we present a formula that decides whether short-term chaos (damage spreading) will happen. We provide a formal proof for this formula, and empirically show that its predictions are accurate. Previous work only works for special cases of balanced families. Finally, it has been observed that these characterizations fail for unbalanced families, yet such families are widespread in real biological networks.
CubeSub - A CubeSat Based Submersible Testbed for Space Technology
Slettebo, Christian
2016-01-01
This report is a Master's Thesis in Aerospace Engineering, performed at the NASA Ames Research Center. It describes the development of the CubeSub, a submersible testbed compatible with the CubeSat form factor. The CubeSub will be used to mature technology and operational procedures to be used in space exploration, and possibly also as a tool for exploration of Earthly environments. CubeSats are carried as payloads, either containing technology to be tested or experiments and sensors for scientific use. The CubeSub is designed to be built up by modules, which can be assembled in different configurations to fulfill different needs. Each module is powered individually and intermodular communication is wireless, reducing the need for wiring. The inside of the hull is flooded with ambient water to simplify the interaction between payloads and surrounding environment. The overall shape is similar to that of a conventional AUV, slender and smooth. This is to make for a low drag, reduce the risk of snagging on surrounding objects and make it possible to deploy through an ice sheet via a narrow borehole. Rapid prototyping is utilized to a large extent, with full-scale prototypes being constructed through 3D-printing and with COTS (Commercial Off-The-Shelf) components. Arduino boards are used for control and internal communication. Modules required for basic operation have been designed, manufactured and tested. Each module is described with regards to its function, design and manufacturability. By performing tests in a pool it was found that the basic concept is sound and that future improvements include better controllability, course stability and waterproofing of electrical components. Further development is needed to make the CubeSub usable for its intended purposes. The largest gains are expected to be found by developing the software and improving controllability.
Mcclenny, Levi D; Imani, Mahdi; Braga-Neto, Ulisses M
2017-11-25
Gene regulatory networks govern the function of key cellular processes, such as control of the cell cycle, response to stress, DNA repair mechanisms, and more. Boolean networks have been used successfully in modeling gene regulatory networks. In the Boolean network model, the transcriptional state of each gene is represented by 0 (inactive) or 1 (active), and the relationship among genes is represented by logical gates updated at discrete time points. However, the Boolean gene states are never observed directly, but only indirectly and incompletely through noisy measurements based on expression technologies such as cDNA microarrays, RNA-Seq, and cell imaging-based assays. The Partially-Observed Boolean Dynamical System (POBDS) signal model is distinct from other deterministic and stochastic Boolean network models in removing the requirement of a directly observable Boolean state vector and allowing uncertainty in the measurement process, addressing the scenario encountered in practice in transcriptomic analysis. BoolFilter is an R package that implements the POBDS model and associated algorithms for state and parameter estimation. It allows the user to estimate the Boolean states, network topology, and measurement parameters from time series of transcriptomic data using exact and approximated (particle) filters, as well as simulate the transcriptomic data for a given Boolean network model. Some of its infrastructure, such as the network interface, is the same as in the previously published R package for Boolean Networks BoolNet, which enhances compatibility and user accessibility to the new package. We introduce the R package BoolFilter for Partially-Observed Boolean Dynamical Systems (POBDS). The BoolFilter package provides a useful toolbox for the bioinformatics community, with state-of-the-art algorithms for simulation of time series transcriptomic data as well as the inverse process of system identification from data obtained with various expression
Cluster analysis in systems of magnetic spheres and cubes
Pyanzina, E.S., E-mail: elena.pyanzina@urfu.ru [Ural Federal University, Lenin Av. 51, Ekaterinburg (Russian Federation); Gudkova, A.V. [Ural Federal University, Lenin Av. 51, Ekaterinburg (Russian Federation); Donaldson, J.G. [University of Vienna, Sensengasse 8, Vienna (Austria); Kantorovich, S.S. [Ural Federal University, Lenin Av. 51, Ekaterinburg (Russian Federation); University of Vienna, Sensengasse 8, Vienna (Austria)
2017-06-01
In the present work we use molecular dynamics simulations and graph-theory based cluster analysis to compare self-assembly in systems of magnetic spheres, and cubes where the dipole moment is oriented along the side of the cube in the [001] crystallographic direction. We show that under the same conditions cubes aggregate far less than their spherical counterparts. This difference can be explained in terms of the volume of phase space in which the formation of the bond is thermodynamically advantageous. It follows that this volume is much larger for a dipolar sphere than for a dipolar cube. - Highlights: • A comparison of the degree of self-assembly in systems of magnetic spheres and cubes. • Spheres are more likely to form larger clusters than cubes. • Differences in microstructure will manifest in the magnetic response of each system.
Modular Heat Dissipation Technique for a CubeSat
2015-07-28
Research Overview Even though the interest in CubeSats has increased over the past decade, there is little publicly released research about thermal...understanding of the thermal design and analysis effort of CubeSats in the past decade, a research overview was provided. 25 III. Methodology The...CubeSats, because it leaves a considerable area for circuitry on the board and has a simple scheme [ Pumpkin , 2013]. Assuming there are high power
Streaming Compression of Hexahedral Meshes
Isenburg, M; Courbet, C
2010-02-03
We describe a method for streaming compression of hexahedral meshes. Given an interleaved stream of vertices and hexahedral our coder incrementally compresses the mesh in the presented order. Our coder is extremely memory efficient when the input stream documents when vertices are referenced for the last time (i.e. when it contains topological finalization tags). Our coder then continuously releases and reuses data structures that no longer contribute to compressing the remainder of the stream. This means in practice that our coder has only a small fraction of the whole mesh in memory at any time. We can therefore compress very large meshes - even meshes that do not file in memory. Compared to traditional, non-streaming approaches that load the entire mesh and globally reorder it during compression, our algorithm trades a less compact compressed representation for significant gains in speed, memory, and I/O efficiency. For example, on the 456k hexahedra 'blade' mesh, our coder is twice as fast and uses 88 times less memory (only 3.1 MB) with the compressed file increasing about 3% in size. We also present the first scheme for predictive compression of properties associated with hexahedral cells.
Mesh Adaptation and Shape Optimization on Unstructured Meshes, Phase I
National Aeronautics and Space Administration — In this SBIR CRM proposes to implement the entropy adjoint method for solution adaptive mesh refinement into the Loci/CHEM unstructured flow solver. The scheme will...
Instant Microsoft SQL Server Analysis Services 2012 dimensions and cube
Acharya, Anurag
2013-01-01
Get to grips with a new technology, understand what it is and what it can do for you, and then get to work with the most important features and tasks. Written in a practical, friendly manner this book will take you through the journey from installing SQL Server to developing your first cubes.""Microsoft SQL Server Analysis Service 2012 Dimensions"" and Cube Starter is targeted at anyone who wants to get started with cube development in Microsoft SQL Server Analysis Services. Regardless of whether you are a SQL Server developer who knows nothing about cube development or SSAS or even OLAP, you
Getting started with SQL Server 2012 cube development
Lidberg, Simon
2013-01-01
As a practical tutorial for Analysis Services, get started with developing cubes. ""Getting Started with SQL Server 2012 Cube Development"" walks you through the basics, working with SSAS to build cubes and get them up and running.Written for SQL Server developers who have not previously worked with Analysis Services. It is assumed that you have experience with relational databases, but no prior knowledge of cube development is required. You need SQL Server 2012 in order to follow along with the exercises in this book.
Cluster analysis in systems of magnetic spheres and cubes
Pyanzina, E. S.; Gudkova, A. V.; Donaldson, J. G.; Kantorovich, S. S.
2017-06-01
In the present work we use molecular dynamics simulations and graph-theory based cluster analysis to compare self-assembly in systems of magnetic spheres, and cubes where the dipole moment is oriented along the side of the cube in the [001] crystallographic direction. We show that under the same conditions cubes aggregate far less than their spherical counterparts. This difference can be explained in terms of the volume of phase space in which the formation of the bond is thermodynamically advantageous. It follows that this volume is much larger for a dipolar sphere than for a dipolar cube.
IceCube: A Cubic Kilometer Radiation Detector
IceCube Collaboration; Klein, Spencer R; Klein, S.R.
2008-01-01
IceCube is a 1 km 3 neutrino detector now being built at the Amudsen-Scott South Pole Station. It consists of 4800 Digital Optical Modules (DOMs) which detect Cherenkov radiation from the charged particles produced in neutrino interactions. IceCube will observe astrophysical neutrinos with energies above about 100 GeV. IceCube will be able to separate ν μ , ν t , and ν τ interactions because of their different topologies. IceCube construction is currently 50% complete
Petr Koňas
2009-01-01
Full Text Available Paper presents new original application WOOD3D in form of program code assembling. The work extends the previous article “Part I – Theoretical approach” in detail description of implemented C++ classes of utilized projects Visualization Toolkit (VTK, Insight Toolkit (ITK and MIMX. Code is written in CMake style and it is available as multiplatform application. Currently GNU Linux (32/64b and MS Windows (32/64b platforms were released. Article discusses various filter classes for image filtering. Mainly Otsu and Binary threshold filters are classified for anatomy wood samples thresholding. Registration of images series is emphasized for difference of colour spaces compensation is included. Resulted work flow of image analysis is new methodological approach for images processing through the composition, visualization, filtering, registration and finite element mesh formation. Application generates script in ANSYS parametric design language (APDL which is fully compatible with ANSYS finite element solver and designer environment. The script includes the whole definition of unstructured finite element mesh formed by individual elements and nodes. Due to simple notation, the same script can be used for generation of geometrical entities in element positions. Such formed volumetric entities are prepared for further geometry approximation (e.g. by boolean or more advanced methods. Hexahedral and tetrahedral types of mesh elements are formed on user request with specified mesh options. Hexahedral meshes are formed both with uniform element size and with anisotropic character. Modified octree method for hexahedral mesh with anisotropic character was declared in application. Multicore CPUs in the application are supported for fast image analysis realization. Visualization of image series and consequent 3D image are realized in VTK format sufficiently known and public format, visualized in GPL application Paraview. Future work based on mesh
The Concept of the "Imploded Boolean Search": A Case Study with Undergraduate Chemistry Students
Tomaszewski, Robert
2016-01-01
Critical thinking and analytical problem-solving skills in research involves using different search strategies. A proposed concept for an "Imploded Boolean Search" combines three unique identifiable field types to perform a search: keyword(s), numerical value(s), and a chemical structure or reaction. The object of this type of search is…
Application of fuzzy logic to Boolean models for digital soil assessment
Gruijter, de J.J.; Walvoort, D.J.J.; Bragato, G.
2011-01-01
Boolean models based on expert knowledge are often used to classify soils into a limited number of classes of a difficult-to-measure soil attribute. Although the primary data used for these classifications contain information on whether the soil is a typical class member or a boundary case between
Boolean logic and character state identity: pitfalls of character coding in metazoan cladistics
Jenner, Ronald A.
2002-01-01
A critical study of the morphological data sets used for the most recent analyses of metazoan cladistics exposes a rather cavalier attitude towards character coding. Binary absence/presence coding is ubiquitous, but without any explicit justification. This uncompromising application of Boolean logic
A new separation algorithm for the Boolean quadric and cut polytopes
Sørensen, Michael Malmros; Letchford, Adam N.
2014-01-01
A separation algorithm is a procedure for generating cutting planes. Up to now, only a few polynomial-time separation algorithms were known for the Boolean quadric and cut polytopes. These polytopes arise in connection with zero–one quadratic programming and the max-cut problem, respectively. We...
Analysis and control of Boolean networks a semi-tensor product approach
Cheng, Daizhan; Li, Zhiqiang
2010-01-01
This book presents a new approach to the investigation of Boolean control networks, using the semi-tensor product (STP), which can express a logical function as a conventional discrete-time linear system. This makes it possible to analyze basic control problems.
Describing the What and Why of Students' Difficulties in Boolean Logic
Herman, Geoffrey L.; Loui, Michael C.; Kaczmarczyk, Lisa; Zilles, Craig
2012-01-01
The ability to reason with formal logic is a foundational skill for computer scientists and computer engineers that scaffolds the abilities to design, debug, and optimize. By interviewing students about their understanding of propositional logic and their ability to translate from English specifications to Boolean expressions, we characterized…
Complete ccc Boolean algebras, the order sequential topology, and a problem of von Neumann
Balcar, Bohuslav; Jech, Thomas; Pazák, Tomáš
2005-01-01
Roč. 37, č. 6 (2005), s. 885-898 ISSN 0024-6093 Institutional research plan: CEZ:AV0Z10750506; CEZ:AV0Z10190503 Keywords : Boolean algebras * Maharam submeasure * weak distributivity * independent reals Subject RIV: BA - General Mathematics Impact factor: 0.477, year: 2005
Using Vector and Extended Boolean Matching in an Expert System for Selecting Foster Homes.
Fox, Edward A.; Winett, Sheila G.
1990-01-01
Describes FOCES (Foster Care Expert System), a prototype expert system for choosing foster care placements for children which integrates information retrieval techniques with artificial intelligence. The use of prototypes and queries in Prolog routines, extended Boolean matching, and vector correlation are explained, as well as evaluation by…
Characterization of Boolean Algebras in Terms of Certain States of Jauch-Piron Type
Matoušek, Milan; Pták, Pavel
2015-12-01
Suppose that L is an orthomodular lattice (a quantum logic). We show that L is Boolean exactly if L possesses a strongly unital set of weakly Jauch-Piron states, or if L possesses a unital set of weakly positive states. We also discuss some general properties of Jauch-Piron-like states.
Finite size effects and symmetry breaking in the evolution of networks of competing Boolean nodes
Liu, M; Bassler, K E
2011-01-01
Finite size effects on the evolutionary dynamics of Boolean networks are analyzed. In the model considered, Boolean networks evolve via a competition between nodes that punishes those in the majority. Previous studies have found that large networks evolve to a statistical steady state that is both critical and highly canalized, and that the evolution of canalization, which is a form of robustness found in genetic regulatory networks, is associated with a particular symmetry of the evolutionary dynamics. Here, it is found that finite size networks evolve in a fundamentally different way than infinitely large networks do. The symmetry of the evolutionary dynamics of infinitely large networks that selects for canalizing Boolean functions is broken in the evolutionary dynamics of finite size networks. In finite size networks, there is an additional selection for input-inverting Boolean functions that output a value opposite to the majority of input values. The reason for the symmetry breaking in the evolutionary dynamics is found to be due to the need for nodes in finite size networks to behave differently in order to cooperate so that the system collectively performs as efficiently as possible. The results suggest that both finite size effects and symmetry are fundamental for understanding the evolution of real-world complex networks, including genetic regulatory networks.
Kramosil, Ivan
2001-01-01
Roč. 5, č. 1 (2001), s. 45-57 ISSN 1432-7643 R&D Projects: GA AV ČR IAA1030803 Institutional research plan: AV0Z1030915 Keywords : first-order predicate calculus * standard semantics * Boolean-like semantics * frequentistic semantics * completness theorems Subject RIV: BA - General Mathematics
User Practices in Keyword and Boolean Searching on an Online Public Access Catalog.
Ensor, Pat
1992-01-01
Discussion of keyword and Boolean searching techniques in online public access catalogs (OPACs) focuses on a study conducted at Indiana State University that examined users' attitudes toward searching on NOTIS (Northwestern Online Total Integrated System). Relevant literature is reviewed, and implications for library instruction are suggested. (17…
An Efficient Algorithm for Computing Attractors of Synchronous And Asynchronous Boolean Networks
Zheng, Desheng; Yang, Guowu; Li, Xiaoyu; Wang, Zhicai; Liu, Feng; He, Lei
2013-01-01
Biological networks, such as genetic regulatory networks, often contain positive and negative feedback loops that settle down to dynamically stable patterns. Identifying these patterns, the so-called attractors, can provide important insights for biologists to understand the molecular mechanisms underlying many coordinated cellular processes such as cellular division, differentiation, and homeostasis. Both synchronous and asynchronous Boolean networks have been used to simulate genetic regulatory networks and identify their attractors. The common methods of computing attractors are that start with a randomly selected initial state and finish with exhaustive search of the state space of a network. However, the time complexity of these methods grows exponentially with respect to the number and length of attractors. Here, we build two algorithms to achieve the computation of attractors in synchronous and asynchronous Boolean networks. For the synchronous scenario, combing with iterative methods and reduced order binary decision diagrams (ROBDD), we propose an improved algorithm to compute attractors. For another algorithm, the attractors of synchronous Boolean networks are utilized in asynchronous Boolean translation functions to derive attractors of asynchronous scenario. The proposed algorithms are implemented in a procedure called geneFAtt. Compared to existing tools such as genYsis, geneFAtt is significantly faster in computing attractors for empirical experimental systems. Availability The software package is available at https://sites.google.com/site/desheng619/download. PMID:23585840
Ostrowski, M; Paulevé, L; Schaub, T; Siegel, A; Guziolowski, C
2016-11-01
Boolean networks (and more general logic models) are useful frameworks to study signal transduction across multiple pathways. Logic models can be learned from a prior knowledge network structure and multiplex phosphoproteomics data. However, most efficient and scalable training methods focus on the comparison of two time-points and assume that the system has reached an early steady state. In this paper, we generalize such a learning procedure to take into account the time series traces of phosphoproteomics data in order to discriminate Boolean networks according to their transient dynamics. To that end, we identify a necessary condition that must be satisfied by the dynamics of a Boolean network to be consistent with a discretized time series trace. Based on this condition, we use Answer Set Programming to compute an over-approximation of the set of Boolean networks which fit best with experimental data and provide the corresponding encodings. Combined with model-checking approaches, we end up with a global learning algorithm. Our approach is able to learn logic models with a true positive rate higher than 78% in two case studies of mammalian signaling networks; for a larger case study, our method provides optimal answers after 7min of computation. We quantified the gain in our method predictions precision compared to learning approaches based on static data. Finally, as an application, our method proposes erroneous time-points in the time series data with respect to the optimal learned logic models. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.
Exact sampling from conditional Boolean models with applications to maximum likelihood inference
Lieshout, van M.N.M.; Zwet, van E.W.
2001-01-01
We are interested in estimating the intensity parameter of a Boolean model of discs (the bombing model) from a single realization. To do so, we derive the conditional distribution of the points (germs) of the underlying Poisson process. We demonstrate how to apply coupling from the past to generate
2016-09-15
thermoplastic PCB Printed Circuit Board PIC Programmable Intelligent Computer RAMPART RApidprototyped MEMS Propulsion and Radiation Test RF Radio Frequency S...V for printed propulsion systems of varying volumes ........... 66 Figure 23. Predicted radiation attenuation of aluminum and AM composite CubeSat...Delta V data and estimates for standard CubeSat propulsion systems ............... 42 Table 5. Delta V for RAMPART printed CubeSat propulsion
Mersiline mesh in premaxillary augmentation.
Foda, Hossam M T
2005-01-01
Premaxillary retrusion may distort the aesthetic appearance of the columella, lip, and nasal tip. This defect is characteristically seen in, but not limited to, patients with cleft lip nasal deformity. This study investigated 60 patients presenting with premaxillary deficiencies in which Mersiline mesh was used to augment the premaxilla. All the cases had surgery using the external rhinoplasty technique. Two methods of augmentation with Mersiline mesh were used: the Mersiline roll technique, for the cases with central symmetric deficiencies, and the Mersiline packing technique, for the cases with asymmetric deficiencies. Premaxillary augmentation with Mersiline mesh proved to be simple technically, easy to perform, and not associated with any complications. Periodic follow-up evaluation for a mean period of 32 months (range, 12-98 months) showed that an adequate degree of premaxillary augmentation was maintained with no clinically detectable resorption of the mesh implant.
Veliz-Cuba, Alan; Aguilar, Boris; Hinkelmann, Franziska; Laubenbacher, Reinhard
2014-06-26
A key problem in the analysis of mathematical models of molecular networks is the determination of their steady states. The present paper addresses this problem for Boolean network models, an increasingly popular modeling paradigm for networks lacking detailed kinetic information. For small models, the problem can be solved by exhaustive enumeration of all state transitions. But for larger models this is not feasible, since the size of the phase space grows exponentially with the dimension of the network. The dimension of published models is growing to over 100, so that efficient methods for steady state determination are essential. Several methods have been proposed for large networks, some of them heuristic. While these methods represent a substantial improvement in scalability over exhaustive enumeration, the problem for large networks is still unsolved in general. This paper presents an algorithm that consists of two main parts. The first is a graph theoretic reduction of the wiring diagram of the network, while preserving all information about steady states. The second part formulates the determination of all steady states of a Boolean network as a problem of finding all solutions to a system of polynomial equations over the finite number system with two elements. This problem can be solved with existing computer algebra software. This algorithm compares favorably with several existing algorithms for steady state determination. One advantage is that it is not heuristic or reliant on sampling, but rather determines algorithmically and exactly all steady states of a Boolean network. The code for the algorithm, as well as the test suite of benchmark networks, is available upon request from the corresponding author. The algorithm presented in this paper reliably determines all steady states of sparse Boolean networks with up to 1000 nodes. The algorithm is effective at analyzing virtually all published models even those of moderate connectivity. The problem for
Quantum algorithms on Walsh transform and Hamming distance for Boolean functions
Xie, Zhengwei; Qiu, Daowen; Cai, Guangya
2018-06-01
Walsh spectrum or Walsh transform is an alternative description of Boolean functions. In this paper, we explore quantum algorithms to approximate the absolute value of Walsh transform W_f at a single point z0 (i.e., |W_f(z0)|) for n-variable Boolean functions with probability at least 8/π 2 using the number of O(1/|W_f(z_{0)|ɛ }) queries, promised that the accuracy is ɛ , while the best known classical algorithm requires O(2n) queries. The Hamming distance between Boolean functions is used to study the linearity testing and other important problems. We take advantage of Walsh transform to calculate the Hamming distance between two n-variable Boolean functions f and g using O(1) queries in some cases. Then, we exploit another quantum algorithm which converts computing Hamming distance between two Boolean functions to quantum amplitude estimation (i.e., approximate counting). If Ham(f,g)=t≠0, we can approximately compute Ham( f, g) with probability at least 2/3 by combining our algorithm and {Approx-Count(f,ɛ ) algorithm} using the expected number of Θ( √{N/(\\lfloor ɛ t\\rfloor +1)}+√{t(N-t)}/\\lfloor ɛ t\\rfloor +1) queries, promised that the accuracy is ɛ . Moreover, our algorithm is optimal, while the exact query complexity for the above problem is Θ(N) and the query complexity with the accuracy ɛ is O(1/ɛ 2N/(t+1)) in classical algorithm, where N=2n. Finally, we present three exact quantum query algorithms for two promise problems on Hamming distance using O(1) queries, while any classical deterministic algorithm solving the problem uses Ω(2n) queries.
GENERATION OF IRREGULAR HEXAGONAL MESHES
Vlasov Aleksandr Nikolaevich
2012-07-01
Decomposition is performed in a constructive way and, as option, it involves meshless representation. Further, this mapping method is used to generate the calculation mesh. In this paper, the authors analyze different cases of mapping onto simply connected and bi-connected canonical domains. They represent forward and backward mapping techniques. Their potential application for generation of nonuniform meshes within the framework of the asymptotic homogenization theory is also performed to assess and project effective characteristics of heterogeneous materials (composites.
Cignoni, Paolo; Pietroni, Nico; Malomo, Luigi
2014-01-01
Mesh joinery is an innovative method to produce illustrative shape approximations suitable for fabrication. Mesh joinery is capable of producing complex fabricable structures in an efficient and visually pleasing manner. We represent an input geometry as a set of planar pieces arranged to compose a rigid structure, by exploiting an efficient slit mechanism. Since slices are planar, to fabricate them a standard 2D cutting system is enough. We automatically arrange slices according to a smooth ...
Method and system for mesh network embedded devices
Wang, Ray (Inventor)
2009-01-01
A method and system for managing mesh network devices. A mesh network device with integrated features creates an N-way mesh network with a full mesh network topology or a partial mesh network topology.
Mesh versus non-mesh repair of ventral abdominal hernias
Jawaid, M.A.; Talpur, A.H.
2008-01-01
To investigate the relative effectiveness of mesh and suture repair of ventral abdominal hernias in terms of clinical outcome, quality of life and rate of recurrence in both the techniques. This is a retrospective descriptive analysis of 236 patients with mesh and non-mesh repair of primary ventral hernias performed between January 2000 to December 2004 at Surgery Department, Liaquat University of Medical and Health Sciences, Jamshoro. The record sheets of the patients were analyzed and data retrieved to compare the results of both techniques for short-term and long-term results. The data retrieved is statistically analyzed on SPSS version 11. There were 43 (18.22%) males and 193 (81.77%) females with a mean age of 51.79 years and a range of 59 (81-22). Para-umbilical hernia was the commonest of ventral hernia and accounted for 49.8% (n=118) of the total study population followed by incisional hernia comprising 24% (n=57) of the total number. There was a significant difference in the recurrent rate at 3 years interval with 23/101 (22.77%) recurrences in suture-repaired subjects compared to 10/135 (7.40%) in mesh repair group. Chronic pain lasting up to 1-2 years was noted in 14 patients with suture repair. Wound infection is comparatively more common (8.14%) in mesh group. The other variables such as operative and postoperative complications, total hospital stay and quality of life is also discussed. Mesh repair of ventral hernia is much superior to non-mesh suture repair in terms of recurrence and overall outcome. (author)
Mapping method for generating three-dimensional meshes: past and present
Cook, W.A.; Oakes, W.R.
1982-01-01
Two transformations are derived in this paper. One is a mapping of a unit square onto a surve and the other is a mapping of a unit cube onto a three-dimensional region. Two meshing computer programs are then discussed that use these mappings. The first is INGEN, which has been used to calculate three-dimensional meshes for approximately 15 years. This meshing program uses an index scheme to number boundaries, surfaces, and regions. With such an index scheme, it is possible to control nodal points, elements, and boundary conditions. The second is ESCHER, a meshing program now being developed. Two primary considerations governing development of ESCHER are that meshes graded using quadrilaterals are required and that edge-line geometry defined by Computer-Aided Design/Computer-Aided Manufacturing (CAD/CAM) systems will be a major source of geometry definition. This program separates the processes of nodal-point connectivity generation, computation of nodal-point mapping space coordinates, and mapping of nodal points into model space
Compressive and Flexural Tests on Adobe Samples Reinforced with Wire Mesh
Jokhio, G. A.; Al-Tawil, Y. M. Y.; Syed Mohsin, S. M.; Gul, Y.; Ramli, N. I.
2018-03-01
Adobe is an economical, naturally available, and environment friendly construction material that offers excellent thermal and sound insulations as well as indoor air quality. It is important to understand and enhance the mechanical properties of this material, where a high degree of variation is reported in the literature owing to lack of research and standardization in this field. The present paper focuses first on the understanding of mechanical behaviour of adobe subjected to compressive stresses as well as flexure and then on enhancing the same with the help of steel wire mesh as reinforcement. A total of 22 samples were tested out of which, 12 cube samples were tested for compressive strength, whereas 10 beams samples were tested for modulus of rupture. Half of the samples in each category were control samples i.e. without wire mesh reinforcement, whereas the remaining half were reinforced with a single layer of wire mesh per sample. It has been found that the compressive strength of adobe increases by about 43% after adding a single layer of wire mesh reinforcement. The flexural response of adobe has also shown improvement with the addition of wire mesh reinforcement.
CubeSat quantum communications mission
Oi, Daniel K.L. [University of Strathclyde, SUPA Department of Physics, Glasgow (United Kingdom); University of Strathclyde, Strathclyde Space Institute, Glasgow (United Kingdom); Ling, Alex [National University of Singapore, Centre for Quantum Technologies, Singapore (Singapore); National University of Singapore, Dept. of Physics, Singapore (Singapore); Vallone, Giuseppe; Villoresi, Paolo [Universita degli Studi di Padova, Dipartimento di Ingegneria dell' Informazione, Padova (Italy); Greenland, Steve; Kerr, Emma [University of Strathclyde, Advanced Space Concepts Laboratory, Mechanical and Aerospace Engineering, Glasgow (United Kingdom); Macdonald, Malcolm [Technology and Innovation Centre, Scottish Centre of Excellence in Satellite Applications, Glasgow (United Kingdom); Weinfurter, Harald [Ludwig-Maximilians-Universitaet, Department fuer Physik, Munich (Germany); Kuiper, Hans [Delft University of Technology, Space Systems Engineering, Aerospace Engineering, Delft (Netherlands); Charbon, Edoardo [AQUA, EPFL, Lausanne (Switzerland); Delft University of Technology, Delft (Netherlands); Ursin, Rupert [Vienna Austrian Academy of Sciences, Institute for Quantum Optics and Quantum Information, Vienna (Austria)
2017-12-15
Quantum communication is a prime space technology application and offers near-term possibilities for long-distance quantum key distribution (QKD) and experimental tests of quantum entanglement. However, there exists considerable developmental risks and subsequent costs and time required to raise the technological readiness level of terrestrial quantum technologies and to adapt them for space operations. The small-space revolution is a promising route by which synergistic advances in miniaturization of both satellite systems and quantum technologies can be combined to leap-frog conventional space systems development. Here, we outline a recent proposal to perform orbit-to-ground transmission of entanglement and QKD using a CubeSat platform deployed from the International Space Station (ISS). This ambitious mission exploits advances in nanosatellite attitude determination and control systems (ADCS), miniaturised target acquisition and tracking sensors, compact and robust sources of single and entangled photons, and high-speed classical communications systems, all to be incorporated within a 10 kg 6 litre mass-volume envelope. The CubeSat Quantum Communications Mission (CQuCoM) would be a pathfinder for advanced nanosatellite payloads and operations, and would establish the basis for a constellation of low-Earth orbit trusted-nodes for QKD service provision. (orig.)
On the IceCube spectral anomaly
Palladino, Andrea; Vissani, Francesco [Gran Sasso Science Institute, L' Aquila (Italy); Spurio, Maurizio, E-mail: andrea.palladino@gssi.infn.it, E-mail: maurizio.spurio@bo.infn.it, E-mail: francesco.vissani@lngs.infn.it [Dipartimento di Fisica e Astronomia Università di Bologna and INFN Sezione di Bologna, Bologna (Italy)
2016-12-01
Recently it was noted that different IceCube datasets are not consistent with the same power law spectrum of the cosmic neutrinos: this is the IceCube spectral anomaly , that suggests that they observe a multicomponent spectrum. In this work, the main possibilities to enhance the description in terms of a single extragalactic neutrino component are examined. The hypothesis of a sizable contribution of Galactic high-energy neutrino events distributed as E {sup −2.7} [ Astrophys. J. 826 (2016) 185] is critically analyzed and its natural generalization is considered. The stability of the expectations is studied by introducing free parameters, motivated by theoretical considerations and observational facts. The upgraded model here examined has 1) a Galactic component with different normalization and shape E {sup −2.4}; 2) an extragalactic neutrino spectrum based on new data; 3) a non-zero prompt component of atmospheric neutrinos. The two key predictions of the model concern the 'high-energy starting events' collected from the Southern sky. The Galactic component produces a softer spectrum and a testable angular anisotropy. A second, radically different class of models, where the second component is instead isotropic, plausibly extragalactic and with a relatively soft spectrum, is disfavored instead by existing observations of muon neutrinos from the Northern sky and below few 100 TeV.
CubeSat quantum communications mission
Oi, Daniel K.L.; Ling, Alex; Vallone, Giuseppe; Villoresi, Paolo; Greenland, Steve; Kerr, Emma; Macdonald, Malcolm; Weinfurter, Harald; Kuiper, Hans; Charbon, Edoardo; Ursin, Rupert
2017-01-01
Quantum communication is a prime space technology application and offers near-term possibilities for long-distance quantum key distribution (QKD) and experimental tests of quantum entanglement. However, there exists considerable developmental risks and subsequent costs and time required to raise the technological readiness level of terrestrial quantum technologies and to adapt them for space operations. The small-space revolution is a promising route by which synergistic advances in miniaturization of both satellite systems and quantum technologies can be combined to leap-frog conventional space systems development. Here, we outline a recent proposal to perform orbit-to-ground transmission of entanglement and QKD using a CubeSat platform deployed from the International Space Station (ISS). This ambitious mission exploits advances in nanosatellite attitude determination and control systems (ADCS), miniaturised target acquisition and tracking sensors, compact and robust sources of single and entangled photons, and high-speed classical communications systems, all to be incorporated within a 10 kg 6 litre mass-volume envelope. The CubeSat Quantum Communications Mission (CQuCoM) would be a pathfinder for advanced nanosatellite payloads and operations, and would establish the basis for a constellation of low-Earth orbit trusted-nodes for QKD service provision. (orig.)
Li, V. A., E-mail: vli2@hawaii.edu; Dorrill, R.; Duvall, M. J.; Koblanski, J.; Sakai, M.; Learned, J. G.; Macchiarulo, L.; Matsuno, S.; Murillo, J.; Rosen, M.; Varner, G. S. [Department of Physics and Astronomy, University of Hawaii at Manoa, Honolulu, Hawaii 96822 (United States); Negrashov, S. [Department of Physics and Astronomy, University of Hawaii at Manoa, Honolulu, Hawaii 96822 (United States); Department of Information and Computer Sciences, University of Hawaii at Manoa, Honolulu, Hawaii 96822 (United States); Wipperfurth, S. A.; Engel, K.; McDonough, W. F. [Department of Geology, University of Maryland, College Park, Maryland 20742 (United States); Jocher, G. R.; Nishimura, K. [Ultralytics LLC, Arlington, Virginia 22203 (United States); Mumm, H. P. [National Institute of Standards and Technology, 100 Bureau Dr., Gaithersburg, Maryland 20899 (United States); Usman, S. M. [Exploratory Science and Technology Branch, National Geospatial-Intelligence Agency, Springfield, Virginia 22150 (United States); Department of Geography and Geoinformation Science, George Mason University, Fairfax, Virginia 22030 (United States)
2016-02-15
We present the development of the miniTimeCube (mTC), a novel compact neutrino detector. The mTC is a multipurpose detector, aiming to detect not only neutrinos but also fast/thermal neutrons. Potential applications include the counterproliferation of nuclear materials and the investigation of antineutrino short-baseline effects. The mTC is a plastic 0.2% {sup 10}B–doped scintillator (13 cm){sup 3} cube surrounded by 24 Micro-Channel Plate (MCP) photon detectors, each with an 8 × 8 anode totaling 1536 individual channels/pixels viewing the scintillator. It uses custom-made electronics modules which mount on top of the MCPs, making our detector compact and able to both distinguish different types of events and reject noise in real time. The detector is currently deployed and being tested at the National Institute of Standards and Technology Center for Neutron Research nuclear reactor (20 MW{sub th}) in Gaithersburg MD. A shield for further tests is being constructed, and calibration and upgrades are ongoing. The mTC’s improved spatiotemporal resolution will allow for determination of incident particle directions beyond previous capabilities.
User Manual for the PROTEUS Mesh Tools
Smith, Micheal A. [Argonne National Lab. (ANL), Argonne, IL (United States); Shemon, Emily R. [Argonne National Lab. (ANL), Argonne, IL (United States)
2015-06-01
This report describes the various mesh tools that are provided with the PROTEUS code giving both descriptions of the input and output. In many cases the examples are provided with a regression test of the mesh tools. The most important mesh tools for any user to consider using are the MT_MeshToMesh.x and the MT_RadialLattice.x codes. The former allows the conversion between most mesh types handled by PROTEUS while the second allows the merging of multiple (assembly) meshes into a radial structured grid. Note that the mesh generation process is recursive in nature and that each input specific for a given mesh tool (such as .axial or .merge) can be used as “mesh” input for any of the mesh tools discussed in this manual.
User Manual for the PROTEUS Mesh Tools
Smith, Micheal A.; Shemon, Emily R.
2015-01-01
This report describes the various mesh tools that are provided with the PROTEUS code giving both descriptions of the input and output. In many cases the examples are provided with a regression test of the mesh tools. The most important mesh tools for any user to consider using are the MT M eshToMesh.x and the MT R adialLattice.x codes. The former allows the conversion between most mesh types handled by PROTEUS while the second allows the merging of multiple (assembly) meshes into a radial structured grid. Note that the mesh generation process is recursive in nature and that each input specific for a given mesh tool (such as .axial or .merge) can be used as ''mesh'' input for any of the mesh tools discussed in this manual.
CubeSat Integration into the Space Situational Awareness Architecture
Morris, K.; Wolfson, M.; Brown, J.
2013-09-01
Lockheed Martin Space Systems Company has recently been involved in developing GEO Space Situational Awareness architectures, which allows insights into how cubesats can augment the current national systems. One hole that was identified in the current architecture is the need for timelier metric track observations to aid in the chain of custody. Obtaining observations of objects at GEO can be supported by CubeSats. These types of small satellites are increasing being built and flown by government agencies like NASA and SMDC. CubeSats are generally mass and power constrained allowing for only small payloads that cannot typically mimic traditional flight capability. CubeSats do not have a high reliability and care must be taken when choosing mission orbits to prevent creating more debris. However, due to the low costs, short development timelines, and available hardware, CubeSats can supply very valuable benefits to these complex missions, affordably. For example, utilizing CubeSats for advanced focal plane demonstrations to support technology insertion into the next generation situational awareness sensors can help to lower risks before the complex sensors are developed. CubeSats can augment the planned ground and space based assets by creating larger constellations with more access to areas of interest. To aid in maintaining custody of objects, a CubeSat constellation at 500 km above GEO would provide increased point of light tracking that can augment the ground SSA assets. Key features of the Cubesat include a small visible camera looking along the GEO belt, a small propulsion system that allows phasing between CubeSats, and an image processor to reduce the data sent to the ground. An elegant communications network will also be used to provide commands to and data from multiple CubeSats. Additional CubeSats can be deployed on GSO launches or through ride shares to GEO, replenishing or adding to the constellation with each launch. Each CubeSat would take images of
Achieving Science with CubeSats: Thinking Inside the Box
Zurbuchen, Thomas H.; Lal, Bhavya
2017-01-01
We present the results of a study conducted by the National Academies of Sciences, Engineering, and Medicine. The study focused on the scientific potential and technological promise of CubeSats. We will first review the growth of the CubeSat platform from an education-focused technology toward a platform of importance for technology development, science, and commercial use, both in the United States and internationally. The use has especially exploded in recent years. For example, of the over 400 CubeSats launched since 2000, more than 80% of all science-focused ones have been launched just in the past four years. Similarly, more than 80% of peer-reviewed papers describing new science based on CubeSat data have been published in the past five years.We will then assess the technological and science promise of CubeSats across space science disciplines, and discuss a subset of priority science goals that can be achieved given the current state of CubeSat capabilities. Many of these goals address targeted science, often in coordination with other spacecraft, or by using sacrificial or high-risk orbits that lead to the demise of the satellite after critical data have been collected. Other goals relate to the use of CubeSats as constellations or swarms, deploying tens to hundreds of CubeSats that function as one distributed array of measurements.Finally, we will summarize our conclusions and recommendations from this study; especially those focused on nearterm investment that could improve the capabilities of CubeSats toward increased science and technological return and enable the science communities’ use of CubeSats.
Massively Clustered CubeSats NCPS Demo Mission
Robertson, Glen A.; Young, David; Kim, Tony; Houts, Mike
2013-01-01
Technologies under development for the proposed Nuclear Cryogenic Propulsion Stage (NCPS) will require an un-crewed demonstration mission before they can be flight qualified over distances and time frames representative of a crewed Mars mission. In this paper, we describe a Massively Clustered CubeSats platform, possibly comprising hundreds of CubeSats, as the main payload of the NCPS demo mission. This platform would enable a mechanism for cost savings for the demo mission through shared support between NASA and other government agencies as well as leveraged commercial aerospace and academic community involvement. We believe a Massively Clustered CubeSats platform should be an obvious first choice for the NCPS demo mission when one considers that cost and risk of the payload can be spread across many CubeSat customers and that the NCPS demo mission can capitalize on using CubeSats developed by others for its own instrumentation needs. Moreover, a demo mission of the NCPS offers an unprecedented opportunity to invigorate the public on a global scale through direct individual participation coordinated through a web-based collaboration engine. The platform we describe would be capable of delivering CubeSats at various locations along a trajectory toward the primary mission destination, in this case Mars, permitting a variety of potential CubeSat-specific missions. Cameras on various CubeSats can also be used to provide multiple views of the space environment and the NCPS vehicle for video monitoring as well as allow the public to "ride along" as virtual passengers on the mission. This collaborative approach could even initiate a brand new Science, Technology, Engineering and Math (STEM) program for launching student developed CubeSat payloads beyond Low Earth Orbit (LEO) on future deep space technology qualification missions. Keywords: Nuclear Propulsion, NCPS, SLS, Mars, CubeSat.
Microwave Atmospheric Sounder on CubeSat
Padmanabhan, S.; Brown, S. E.; Kangaslahti, P.; Cofield, R.; Russell, D.; Stachnik, R. A.; Su, H.; Wu, L.; Tanelli, S.; Niamsuwan, N.
2014-12-01
To accurately predict how the distribution of extreme events may change in the future we need to understand the mechanisms that influence such events in our current climate. Our current observing system is not well-suited for observing extreme events globally due to the sparse sampling and in-homogeneity of ground-based in-situ observations and the infrequent revisit time of satellite observations. Observations of weather extremes, such as extreme precipitation events, temperature extremes, tropical and extra-tropical cyclones among others, with temporal resolution on the order of minutes and spatial resolution on the order of few kms (cost passive microwave sounding and imaging sensors on CubeSats that would work in concert with traditional flagship observational systems, such as those manifested on large environmental satellites (i.e. JPSS,WSF,GCOM-W), to monitor weather extremes. A 118/183 GHz sensor would enable observations of temperature and precipitation extremes over land and ocean as well as tropical and extra-tropical cyclones. This proposed project would enable low cost, compact radiometer instrumentation at 118 and 183 GHz that would fit in a 6U Cubesat with the objective of mass-producing this design to enable a suite of small satellites to image the key geophysical parameters needed to improve prediction of extreme weather events. We take advantage of past and current technology developments at JPL viz. HAMSR (High Altitude Microwave Scanning Radiometer), Advanced Component Technology (ACT'08) to enable low-mass, low-power high frequency airborne radiometers. In this paper, we will describe the design and implementation of the 118 GHz temperature sounder and 183 GHz humidity sounder on the 6U CubeSat. In addition, a summary of radiometer calibration and retrieval techniques of temperature and humidity will be discussed. The successful demonstration of this instrument on the 6U CubeSat would pave the way for the development of a constellation which
Yoon, S; Lindstrom, P; Pascucci, V; Manocha, D
2005-01-01
We present a novel method for computing cache-oblivious layouts of large meshes that improve the performance of interactive visualization and geometric processing algorithms. Given that the mesh is accessed in a reasonably coherent manner, we assume no particular data access patterns or cache parameters of the memory hierarchy involved in the computation. Furthermore, our formulation extends directly to computing layouts of multi-resolution and bounding volume hierarchies of large meshes. We develop a simple and practical cache-oblivious metric for estimating cache misses. Computing a coherent mesh layout is reduced to a combinatorial optimization problem. We designed and implemented an out-of-core multilevel minimization algorithm and tested its performance on unstructured meshes composed of tens to hundreds of millions of triangles. Our layouts can significantly reduce the number of cache misses. We have observed 2-20 times speedups in view-dependent rendering, collision detection, and isocontour extraction without any modification of the algorithms or runtime applications
Connectivity editing for quadrilateral meshes
Peng, Chihan; Zhang, Eugene; Kobayashi, Yoshihiro; Wonka, Peter
2011-01-01
We propose new connectivity editing operations for quadrilateral meshes with the unique ability to explicitly control the location, orientation, type, and number of the irregular vertices (valence not equal to four) in the mesh while preserving sharp edges. We provide theoretical analysis on what editing operations are possible and impossible and introduce three fundamental operations to move and re-orient a pair of irregular vertices. We argue that our editing operations are fundamental, because they only change the quad mesh in the smallest possible region and involve the fewest irregular vertices (i.e., two). The irregular vertex movement operations are supplemented by operations for the splitting, merging, canceling, and aligning of irregular vertices. We explain how the proposed highlevel operations are realized through graph-level editing operations such as quad collapses, edge flips, and edge splits. The utility of these mesh editing operations are demonstrated by improving the connectivity of quad meshes generated from state-of-art quadrangulation techniques. © 2011 ACM.
Connectivity editing for quadrilateral meshes
Peng, Chihan
2011-12-12
We propose new connectivity editing operations for quadrilateral meshes with the unique ability to explicitly control the location, orientation, type, and number of the irregular vertices (valence not equal to four) in the mesh while preserving sharp edges. We provide theoretical analysis on what editing operations are possible and impossible and introduce three fundamental operations to move and re-orient a pair of irregular vertices. We argue that our editing operations are fundamental, because they only change the quad mesh in the smallest possible region and involve the fewest irregular vertices (i.e., two). The irregular vertex movement operations are supplemented by operations for the splitting, merging, canceling, and aligning of irregular vertices. We explain how the proposed highlevel operations are realized through graph-level editing operations such as quad collapses, edge flips, and edge splits. The utility of these mesh editing operations are demonstrated by improving the connectivity of quad meshes generated from state-of-art quadrangulation techniques. © 2011 ACM.
The Larger Bound on the Domination Number of Fibonacci Cubes and Lucas Cubes
Shengzhang Ren
2014-01-01
Full Text Available Let Γn and Λn be the n-dimensional Fibonacci cube and Lucas cube, respectively. Denote by Γ[un,k,z] the subgraph of Γn induced by the end-vertex un,k,z that has no up-neighbor. In this paper, the number of end-vertices and domination number γ of Γn and Λn are studied. The formula of calculating the number of end-vertices is given and it is proved that γ(Γ[un,k,z]≤2k-1+1. Using these results, the larger bound on the domination number γ of Γn and Λn is determined.
O'Hara, Ryan P; Chand, Arpita; Vidiyala, Sowmya; Arechavala, Stacie M; Mitsouras, Dimitrios; Rudin, Stephen; Ionita, Ciprian N
2016-02-27
Complex vascular anatomies can cause the failure of image-guided endovascular procedures. 3D printed patient-specific vascular phantoms provide clinicians and medical device companies the ability to preemptively plan surgical treatments, test the likelihood of device success, and determine potential operative setbacks. This research aims to present advanced mesh manipulation techniques of stereolithographic (STL) files segmented from medical imaging and post-print surface optimization to match physiological vascular flow resistance. For phantom design, we developed three mesh manipulation techniques. The first method allows outlet 3D mesh manipulations to merge superfluous vessels into a single junction, decreasing the number of flow outlets and making it feasible to include smaller vessels. Next we introduced Boolean operations to eliminate the need to manually merge mesh layers and eliminate errors of mesh self-intersections that previously occurred. Finally we optimize support addition to preserve the patient anatomical geometry. For post-print surface optimization, we investigated various solutions and methods to remove support material and smooth the inner vessel surface. Solutions of chloroform, alcohol and sodium hydroxide were used to process various phantoms and hydraulic resistance was measured and compared with values reported in literature. The newly mesh manipulation methods decrease the phantom design time by 30 - 80% and allow for rapid development of accurate vascular models. We have created 3D printed vascular models with vessel diameters less than 0.5 mm. The methods presented in this work could lead to shorter design time for patient specific phantoms and better physiological simulations.
Modified MIMO Cube for Enhanced Channel Capacity
Lajos Nagy
2012-01-01
Full Text Available This paper deals with the optimization of MIMO antenna elements' position in modified MIMO cube for getting maximal channel capacity in indoor environment. The dependence of the channel capacity on the antenna orientation was analyzed by simulations. We have also examined the effect of the frequency dependence of the antenna system (in case of conjugate matching and nonconjugate matching for the channel capacity. Based on the simulation results in the created and measured antenna system, the antennas were at a right angle to each other. At the two chosen different structures, we measured the antenna parameters and the channel capacity. In this paper, we present the results of the measurements which clearly confirm our simulations. We will point out the differences between the two antenna structures.
Cordón García, Oscar; Moya Anegón, Félix de; Zarco Fernández, Carmen
2000-01-01
[ES] Although the fuzzy retrieval model constitutes a powerful extension of the boolean one, being able to deal with the imprecision and subjectivity existing in the Information Retrieval process, users are not usually able to express their query requirements in the form of an extended boolean query including weights. To solve this problem, different tools to assist the user in the query formulation have been proposed. In this paper, the genetic algorithm-programming technique is considered t...
A short Boolean derivation of mean failure frequency for any (also non-coherent) system
Schneeweiss, Winfrid G.
2009-01-01
For stationary repairable systems it is shown that the probabilistic weights for the individual components' mean failure frequencies (MFFs) that can be added to yield the system's MFF are found easily from the first step of the Boolean fault tree function's Shannon decomposition. This way one finds a general theory of a system's MFF and the case of coherence covered in standard textbooks is shown to be a subcase. Unfortunately, elegant rules for calculating system MFF from any polynomial form of the fault tree's Boolean function are only known for the coherent case, but repeated here, because they are not yet found in many textbooks. An example known from literature is treated extensively with great care.
Velderraín, José Dávila; Martínez-García, Juan Carlos; Álvarez-Buylla, Elena R
2017-01-01
Mathematical models based on dynamical systems theory are well-suited tools for the integration of available molecular experimental data into coherent frameworks in order to propose hypotheses about the cooperative regulatory mechanisms driving developmental processes. Computational analysis of the proposed models using well-established methods enables testing the hypotheses by contrasting predictions with observations. Within such framework, Boolean gene regulatory network dynamical models have been extensively used in modeling plant development. Boolean models are simple and intuitively appealing, ideal tools for collaborative efforts between theorists and experimentalists. In this chapter we present protocols used in our group for the study of diverse plant developmental processes. We focus on conceptual clarity and practical implementation, providing directions to the corresponding technical literature.
CIRCUIT IMPLEMENTATION OF VHDL-DESCRIPTIONS OF SYSTEMS OF PARTIAL BOOLEAN FUNCTIONS
P. N. Bibilo
2016-01-01
Full Text Available Method for description of incompletely specified (partial Boolean functions in VHDL is proposed. Examples of synthesized VHDL models of partial Boolean functions are presented; and the results of experiments on circuit implementation of VHDL descriptions of systems of partial functions. The realizability of original partial functions in logical circuits was verified by formal verification. The results of the experiments show that the preliminary minimization in DNF class and in the class of BDD representations for pseudo-random systems of completely specified functions does not improve practically (and in the case of BDD sometimes worsens the results of the subsequent synthesis in the basis of FPGA unlike the significant efficiency of these procedures for the synthesis of benchmark circuits taken from the practice of the design.
Thales SESO's hollow and massive corner cube solutions
Fappani, Denis; Dahan, Déborah; Costes, Vincent; Luitot, Clément
2017-11-01
For Space Activities, more and more Corner Cubes, used as solution for retro reflection of light (telemetry and positioning), are emerging worldwide in different projects. Depending on the application, they can be massive or hollow Corner Cubes. For corners as well as for any kind of space optics, it usual that use of light/lightened components is always a baseline for purpose of mass reduction payloads. But other parameters, such as the system stability under severe environment, are also major issues, especially for the corner cube systems which require generally very tight angular accuracies. For the particular case of the hollow corner cube, an alternative solution to the usual cementing of the 3 reflective surfaces, has been developed with success in collaboration with CNES to guarantee a better stability and fulfill the weight requirements.. Another important parameter is the dihedral angles that have a great influence on the wavefront error. Two technologies can be considered, either a Corner Cubes array assembled in a very stable housing, or the irreversible adherence technology used for assembling the three parts of a cube. This latter technology enables in particular not having to use cement. The poster will point out the conceptual design, the manufacturing and control key-aspects of such corner cube assemblies as well as the technologies used for their assembling.
An evaluation of space time cube representation of spatiotemporal patterns.
Kristensson, Per Ola; Dahlbäck, Nils; Anundi, Daniel; Björnstad, Marius; Gillberg, Hanna; Haraldsson, Jonas; Mårtensson, Ingrid; Nordvall, Mathias; Ståhl, Josefine
2009-01-01
Space time cube representation is an information visualization technique where spatiotemporal data points are mapped into a cube. Information visualization researchers have previously argued that space time cube representation is beneficial in revealing complex spatiotemporal patterns in a data set to users. The argument is based on the fact that both time and spatial information are displayed simultaneously to users, an effect difficult to achieve in other representations. However, to our knowledge the actual usefulness of space time cube representation in conveying complex spatiotemporal patterns to users has not been empirically validated. To fill this gap, we report on a between-subjects experiment comparing novice users' error rates and response times when answering a set of questions using either space time cube or a baseline 2D representation. For some simple questions, the error rates were lower when using the baseline representation. For complex questions where the participants needed an overall understanding of the spatiotemporal structure of the data set, the space time cube representation resulted in on average twice as fast response times with no difference in error rates compared to the baseline. These results provide an empirical foundation for the hypothesis that space time cube representation benefits users analyzing complex spatiotemporal patterns.
Realization of a quantum Hamiltonian Boolean logic gate on the Si(001):H surface.
Kolmer, Marek; Zuzak, Rafal; Dridi, Ghassen; Godlewski, Szymon; Joachim, Christian; Szymonski, Marek
2015-08-07
The design and construction of the first prototypical QHC (Quantum Hamiltonian Computing) atomic scale Boolean logic gate is reported using scanning tunnelling microscope (STM) tip-induced atom manipulation on an Si(001):H surface. The NOR/OR gate truth table was confirmed by dI/dU STS (Scanning Tunnelling Spectroscopy) tracking how the surface states of the QHC quantum circuit on the Si(001):H surface are shifted according to the input logical status.
Web-page Prediction for Domain Specific Web-search using Boolean Bit Mask
Sinha, Sukanta; Duttagupta, Rana; Mukhopadhyay, Debajyoti
2012-01-01
Search Engine is a Web-page retrieval tool. Nowadays Web searchers utilize their time using an efficient search engine. To improve the performance of the search engine, we are introducing a unique mechanism which will give Web searchers more prominent search results. In this paper, we are going to discuss a domain specific Web search prototype which will generate the predicted Web-page list for user given search string using Boolean bit mask.
Identification of control targets in Boolean molecular network models via computational algebra.
Murrugarra, David; Veliz-Cuba, Alan; Aguilar, Boris; Laubenbacher, Reinhard
2016-09-23
Many problems in biomedicine and other areas of the life sciences can be characterized as control problems, with the goal of finding strategies to change a disease or otherwise undesirable state of a biological system into another, more desirable, state through an intervention, such as a drug or other therapeutic treatment. The identification of such strategies is typically based on a mathematical model of the process to be altered through targeted control inputs. This paper focuses on processes at the molecular level that determine the state of an individual cell, involving signaling or gene regulation. The mathematical model type considered is that of Boolean networks. The potential control targets can be represented by a set of nodes and edges that can be manipulated to produce a desired effect on the system. This paper presents a method for the identification of potential intervention targets in Boolean molecular network models using algebraic techniques. The approach exploits an algebraic representation of Boolean networks to encode the control candidates in the network wiring diagram as the solutions of a system of polynomials equations, and then uses computational algebra techniques to find such controllers. The control methods in this paper are validated through the identification of combinatorial interventions in the signaling pathways of previously reported control targets in two well studied systems, a p53-mdm2 network and a blood T cell lymphocyte granular leukemia survival signaling network. Supplementary data is available online and our code in Macaulay2 and Matlab are available via http://www.ms.uky.edu/~dmu228/ControlAlg . This paper presents a novel method for the identification of intervention targets in Boolean network models. The results in this paper show that the proposed methods are useful and efficient for moderately large networks.
Complete CCC Boolean Algebras, the order Sequential Topology, and a Problem of von Neumann
Balcar, Bohuslav; Jech, Thomas; Pazák, Tomáš
2005-01-01
Roč. 37, č. 6 (2005), s. 885-898 ISSN 0024-6093 R&D Projects: GA ČR(CZ) GA201/02/0857; GA ČR(CZ) GA201/03/0933 Institutional research plan: CEZ:AV0Z10190503 Keywords : Boolean algebra * Maharam submeasure * weak distributivity Subject RIV: BA - General Mathematics Impact factor: 0.477, year: 2005
THE METHOD OF CONSTRUCTING A BOOLEAN FORMULA OF A POLYGON IN THE DISJUNCTIVE NORMAL FORM
A. A. Butov
2014-01-01
Full Text Available The paper focuses on finalizing the method of finding a polygon Boolean formula in disjunctive normal form, described in the previous article [1]. An improved method eliminates the drawback asso-ciated with the existence of a class of problems for which the solution is only approximate. The pro-posed method always allows to find an exact solution. The method can be used, in particular, in the systems of computer-aided design of integrated circuits topology.
Comparison of Seven Methods for Boolean Factor Analysis and Their Evaluation by Information Gain
Frolov, A.; Húsek, Dušan; Polyakov, P.Y.
2016-01-01
Roč. 27, č. 3 (2016), s. 538-550 ISSN 2162-237X R&D Projects: GA MŠk ED1.1.00/02.0070 Institutional support: RVO:67985807 Keywords : associative memory * bars problem (BP) * Boolean factor analysis (BFA) * data mining * dimension reduction * Hebbian learning rule * information gain * likelihood maximization (LM) * neural network application * recurrent neural network * statistics Subject RIV: IN - Informatics, Computer Science Impact factor: 6.108, year: 2016
Recurrent Neural Network Based Boolean Factor Analysis and its Application to Word Clustering
Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.
2009-01-01
Roč. 20, č. 7 (2009), s. 1073-1086 ISSN 1045-9227 R&D Projects: GA MŠk(CZ) 1M0567 Institutional research plan: CEZ:AV0Z10300504 Keywords : recurrent neural network * Hopfield-like neural network * associative memory * unsupervised learning * neural network architecture * neural network application * statistics * Boolean factor analysis * concepts search * information retrieval Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.889, year: 2009
Jens Christian Claussen
2017-06-01
Full Text Available The analysis of microbiome compositions in the human gut has gained increasing interest due to the broader availability of data and functional databases and substantial progress in data analysis methods, but also due to the high relevance of the microbiome in human health and disease. While most analyses infer interactions among highly abundant species, the large number of low-abundance species has received less attention. Here we present a novel analysis method based on Boolean operations applied to microbial co-occurrence patterns. We calibrate our approach with simulated data based on a dynamical Boolean network model from which we interpret the statistics of attractor states as a theoretical proxy for microbiome composition. We show that for given fractions of synergistic and competitive interactions in the model our Boolean abundance analysis can reliably detect these interactions. Analyzing a novel data set of 822 microbiome compositions of the human gut, we find a large number of highly significant synergistic interactions among these low-abundance species, forming a connected network, and a few isolated competitive interactions.
Detecting small attractors of large Boolean networks by function-reduction-based strategy.
Zheng, Qiben; Shen, Liangzhong; Shang, Xuequn; Liu, Wenbin
2016-04-01
Boolean networks (BNs) are widely used to model gene regulatory networks and to design therapeutic intervention strategies to affect the long-term behaviour of systems. A central aim of Boolean-network analysis is to find attractors that correspond to various cellular states, such as cell types or the stage of cell differentiation. This problem is NP-hard and various algorithms have been used to tackle it with considerable success. The idea is that a singleton attractor corresponds to n consistent subsequences in the truth table. To find these subsequences, the authors gradually reduce the entire truth table of Boolean functions by extending a partial gene activity profile (GAP). Not only does this process delete inconsistent subsequences in truth tables, it also directly determines values for some nodes not extended, which means it can abandon the partial GAPs that cannot lead to an attractor as early as possible. The results of simulation show that the proposed algorithm can detect small attractors with length p = 4 in BNs of up to 200 nodes with average indegree K = 2.
PATHLOGIC-S: a scalable Boolean framework for modelling cellular signalling.
Liam G Fearnley
Full Text Available Curated databases of signal transduction have grown to describe several thousand reactions, and efficient use of these data requires the development of modelling tools to elucidate and explore system properties. We present PATHLOGIC-S, a Boolean specification for a signalling model, with its associated GPL-licensed implementation using integer programming techniques. The PATHLOGIC-S specification has been designed to function on current desktop workstations, and is capable of providing analyses on some of the largest currently available datasets through use of Boolean modelling techniques to generate predictions of stable and semi-stable network states from data in community file formats. PATHLOGIC-S also addresses major problems associated with the presence and modelling of inhibition in Boolean systems, and reduces logical incoherence due to common inhibitory mechanisms in signalling systems. We apply this approach to signal transduction networks including Reactome and two pathways from the Panther Pathways database, and present the results of computations on each along with a discussion of execution time. A software implementation of the framework and model is freely available under a GPL license.
Exploring candidate biological functions by Boolean Function Networks for Saccharomyces cerevisiae.
Maria Simak
Full Text Available The great amount of gene expression data has brought a big challenge for the discovery of Gene Regulatory Network (GRN. For network reconstruction and the investigation of regulatory relations, it is desirable to ensure directness of links between genes on a map, infer their directionality and explore candidate biological functions from high-throughput transcriptomic data. To address these problems, we introduce a Boolean Function Network (BFN model based on techniques of hidden Markov model (HMM, likelihood ratio test and Boolean logic functions. BFN consists of two consecutive tests to establish links between pairs of genes and check their directness. We evaluate the performance of BFN through the application to S. cerevisiae time course data. BFN produces regulatory relations which show consistency with succession of cell cycle phases. Furthermore, it also improves sensitivity and specificity when compared with alternative methods of genetic network reverse engineering. Moreover, we demonstrate that BFN can provide proper resolution for GO enrichment of gene sets. Finally, the Boolean functions discovered by BFN can provide useful insights for the identification of control mechanisms of regulatory processes, which is the special advantage of the proposed approach. In combination with low computational complexity, BFN can serve as an efficient screening tool to reconstruct genes relations on the whole genome level. In addition, the BFN approach is also feasible to a wide range of time course datasets.
PARAMETER ESTIMATION IN NON-HOMOGENEOUS BOOLEAN MODELS: AN APPLICATION TO PLANT DEFENSE RESPONSE
Maria Angeles Gallego
2014-11-01
Full Text Available Many medical and biological problems require to extract information from microscopical images. Boolean models have been extensively used to analyze binary images of random clumps in many scientific fields. In this paper, a particular type of Boolean model with an underlying non-stationary point process is considered. The intensity of the underlying point process is formulated as a fixed function of the distance to a region of interest. A method to estimate the parameters of this Boolean model is introduced, and its performance is checked in two different settings. Firstly, a comparative study with other existent methods is done using simulated data. Secondly, the method is applied to analyze the longleaf data set, which is a very popular data set in the context of point processes included in the R package spatstat. Obtained results show that the new method provides as accurate estimates as those obtained with more complex methods developed for the general case. Finally, to illustrate the application of this model and this method, a particular type of phytopathological images are analyzed. These images show callose depositions in leaves of Arabidopsis plants. The analysis of callose depositions, is very popular in the phytopathological literature to quantify activity of plant immunity.
3D Printing the Complete CubeSat
Kief, Craig
2015-01-01
The 3D Printing the Complete CubeSat project is designed to advance the state-of-the-art in 3D printing for CubeSat applications. Printing in 3D has the potential to increase reliability, reduce design iteration time and provide greater design flexibility in the areas of radiation mitigation, communications, propulsion, and wiring, among others. This project is investigating the possibility of including propulsion systems into the design of printed CubeSat components. One such concept, an embedded micro pulsed plasma thruster (mPPT), could provide auxiliary reaction control propulsion for a spacecraft as a means to desaturate momentum wheels.
New Formula for Stability of Cube Armoured Roundheads
Maciñeira, Enrique; Burcharth, Hans F.
2009-01-01
The paper presents a new formula for the stability of cube armoured roundheads. The formula is based on physical model tests in Aalborg University which both long crested and short crested waves of different wave steepness were used. The slope of the radius of the head were varied in order...... to explore the influence of the geometry on the armour stability. Besides cubes with mass density 2.4 t/m3, cubes with mass density 2.80 t/m3 were used in order to include the effect of mass density in the formula. The damage predictions given by the formula have been compared with prototype hand...
Multigrid for refined triangle meshes
Shapira, Yair
1997-02-01
A two-level preconditioning method for the solution of (locally) refined finite element schemes using triangle meshes is introduced. In the isotropic SPD case, it is shown that the condition number of the preconditioned stiffness matrix is bounded uniformly for all sufficiently regular triangulations. This is also verified numerically for an isotropic diffusion problem with highly discontinuous coefficients.
Resterilized Polypropylene Mesh for Inguinal Hernia Repair
2018-04-19
Apr 19, 2018 ... Conclusion: The use of sterilized polypropylene mesh for the repair of inguinal ... and nonabsorbable materials to reduce the tissue–mesh. INTRODUCTION ... which we have been practicing in our center since we introduced ...
Management of complications of mesh surgery.
Lee, Dominic; Zimmern, Philippe E
2015-07-01
Transvaginal placements of synthetic mid-urethral slings and vaginal meshes have largely superseded traditional tissue repairs in the current era because of presumed efficacy and ease of implant with device 'kits'. The use of synthetic material has generated novel complications including mesh extrusion, pelvic and vaginal pain and mesh contraction. In this review, our aim is to discuss the management, surgical techniques and outcomes associated with mesh removal. Recent publications have seen an increase in presentation of these mesh-related complications, and reports from multiple tertiary centers have suggested that not all patients benefit from surgical intervention. Although the true incidence of mesh complications is unknown, recent publications can serve to guide physicians and inform patients of the surgical outcomes from mesh-related complications. In addition, the literature highlights the growing need for a registry to account for a more accurate reporting of these events and to counsel patients on the risk and benefits before proceeding with mesh surgeries.
LunarCube for Deep Space Missions, Phase I
National Aeronautics and Space Administration — Busek Co., Inc. and Morehead State University propose to develop a 6U CubeSat capable of reaching a lunar orbit from GEO. The primary objective is to demonstrate...
Deep Space CubeSat Prototype Platform Design and Testing
National Aeronautics and Space Administration — This IRAD will significantly advance a GSFC Deep Space CubeSat prototype effort in almost all subsystems. Because it represents a “tall pole” for lunar orbiters, as...
CubeSat Handling of Multisystem Precision Time Transfer (CHOMPTT)
National Aeronautics and Space Administration — The CubeSat Handling of Multisystem Precision Time Transfer (CHOMPTT) mission is a precision timing satellite equipped with atomic clocks synchronized with a ground...
Optical Intersatellite Communications for CubeSat Swarms, Phase I
National Aeronautics and Space Administration — The growing interest in CubeSat swarm and constellation systems by NASA, the Department of Defense and commercial ventures has created a need for self-managed...
An Adaptive Langmuir Probe for CubeSats and Explorers
National Aeronautics and Space Administration — We propose to build an Adaptive Langmuir Probe (ALP) for CubeSats designed to mitigate spacecraft charging unique to small platforms. This project builds a new...
6th International Meshing Roundtable '97
White, D.
1997-09-01
The goal of the 6th International Meshing Roundtable is to bring together researchers and developers from industry, academia, and government labs in a stimulating, open environment for the exchange of technical information related to the meshing process. In the pas~ the Roundtable has enjoyed significant participation born each of these groups from a wide variety of countries. The Roundtable will consist of technical presentations from contributed papers and abstracts, two invited speakers, and two invited panels of experts discussing topics related to the development and use of automatic mesh generation tools. In addition, this year we will feature a "Bring Your Best Mesh" competition and poster session to encourage discussion and participation from a wide variety of mesh generation tool users. The schedule and evening social events are designed to provide numerous opportunities for informal dialog. A proceedings will be published by Sandia National Laboratories and distributed at the Roundtable. In addition, papers of exceptionally high quaIity will be submitted to a special issue of the International Journal of Computational Geometry and Applications. Papers and one page abstracts were sought that present original results on the meshing process. Potential topics include but are got limited to: Unstructured triangular and tetrahedral mesh generation Unstructured quadrilateral and hexahedral mesh generation Automated blocking and structured mesh generation Mixed element meshing Surface mesh generation Geometry decomposition and clean-up techniques Geometry modification techniques related to meshing Adaptive mesh refinement and mesh quality control Mesh visualization Special purpose meshing algorithms for particular applications Theoretical or novel ideas with practical potential Technical presentations from industrial researchers.
SQL Server Analysis Services 2012 cube development cookbook
Dewald, Baya; Hughes, Steve
2013-01-01
A practical cookbook packed with recipes to help developers produce data cubes as quickly as possible by following step by step instructions, rather than explaining data mining concepts with SSAS.If you are a BI or ETL developer using SQL Server Analysis services to build OLAP cubes, this book is ideal for you. Prior knowledge of relational databases and experience with Excel as well as SQL development is required.
AURA-A radio frequency extension to IceCube
Landsman, H.; Ruckman, L.; Varner, G.S.
2009-01-01
The excellent radio frequency (RF) transparency of cold polar ice, combined with the coherent Cherenkov emission produced by neutrino-induced showers when viewed at wavelengths longer than a few centimeters, has spurred considerable interest in a large-scale radio-wave neutrino detector array. The AURA (Askaryan Under-ice Radio Array) experimental effort, within the IceCube collaboration, seeks to take advantage of the opportunity presented by IceCube [A. Karle, Nucl. Instr. and Meth. A (2009), this issue, doi: (10.1016/j.nima.2009.03.180).; A. Achtenberg et al., The IceCube Collaboration, Astropart. Phys. 26 (2006) 155 ] drilling through 2010 to establish the RF technology needed to achieve 100-1000km 3 effective volumes. In the 2006-2007 Austral summer, three deep in-ice RF clusters were deployed at depths of ∼1300 and ∼300m on top of the IceCube strings. Additional three clusters will be deployed in the Austral summer of 2008-2009. Verification and calibration results from the current deployed clusters are presented, and the detector design and performances are discussed. Augmentation of IceCube with large-scale (1000km 3 sr) radio and acoustic arrays would extend the physics reach of IceCube into the EeV-ZeV regime and offer substantial technological redundancy.
Hypervelocity impact of tungsten cubes on spaced armour
Chandel, Pradeep S; Sood, Dharmanshu; Kumar, Rajeev; Sharma, Prince; Sewak, Bhupinder; Bhardwaj, Vikas; Athwal, Manoj; Mangla, Vikas; Biswas, Ipsita; Singh, Manjit
2012-01-01
The paper summarizes the experimental observations and simulation studies of damage potential of tungsten alloy cubes on relatively thin mild steel spaced armour target plates in the velocity regime 1300 – 4000 ms −1 using Two Stage Light Gas Gun technique. The cubes of size 9.5 mm and 12 mm having mass 15 g and 30 g respectively were made to impact normally on three target plates of size 300 mm × 300 mm of thickness 4, 4 and 10 mm at 100 mm distance apart. Flash radiography has been used to image the projectile-target interaction in the nitrogen environment at 300 mbar vacuum at room temperature. The results reveal clear perforation by 9.5 mm cube in all the three target plates up to impact velocity of about 2000 m/s. While 12 mm cube can perforate the spaced armour upto impact velocity of 4000 m/s. This shows that 9.5mm tungsten alloy cube is not effective beyond 2000 m/s while 12 mm tungsten alloy cube can defeat the spaced armour upto 4000 m/s. The simulation studies have been carried out using Autodyn 3D nonlinear code using Lagrange solver at velocities 1200 – 4000 m/s. The simulation results are in good agreement with the experimental findings.
Miniature scientific-grade magnetic sensors for CubeSats
Pronenko, Vira; Belyayev, Serhiy
2016-07-01
Micro- and nanosatellites have become more attractive due to their low development and launch cost. A class of nanosatellites defined by the CubeSat standard allows standardizing CubeSat preparation and launch, thus making the projects more affordable. Because of the complexity of sensors miniaturization to install them onboard CubeSat, the majority of CubeSat launches are aimed the technology demonstration or education missions. The scientific success of CubeSat mission depends on the sensors quality. In spite that the sensitivity of the magnetic sensors strongly depends on their size, the recent development in this branch allows us to propose tiny but sensitive both AC and DC magnetometers. The goal of the present report is to introduce the new design of miniature three-component sensors for measurement of vector magnetic fields - for quasi-stationary and slowly fluctuating - flux-gate magnetometer (FGM) - and for alternative ones - search-coil magnetometer (SCM). In order to create magnetometers with the really highest possible level of parameters, a set of scientific and technological problems, mostly aimed at the sensor construction improvement, was solved. The most important parameter characterizing magnetometer quality is its own magnetic noise level (NL). The analysis of the NL influencing factors is made and the ways to decrease it are discussed in the report. Construction details and technical specifications of miniature but sensitive FGM and SCM for the CubeSat mission are presented. This work is supported by EC Framework 7 funded project 607197.
Collaboration, IceCube-Gen2; :; Aartsen, M. G.; Ackermann, M.; Adams, J.; Aguilar, J. A.; Ahlers, M.; Ahrens, M.; Samarai, I. Al; Altmann, D.; Andeen, K.; Anderson, T.; Ansseau, I.; Anton, G.; Argüelles, C.
2017-01-01
Papers on research & development towards IceCube-Gen2, the next generation neutrino observatory at South Pole, submitted to the 35th International Cosmic Ray Conference (ICRC 2017, Busan, South Korea) by the IceCube-Gen2 Collaboration.
User Manual for the PROTEUS Mesh Tools
Smith, Micheal A. [Argonne National Lab. (ANL), Argonne, IL (United States); Shemon, Emily R [Argonne National Lab. (ANL), Argonne, IL (United States)
2016-09-19
PROTEUS is built around a finite element representation of the geometry for visualization. In addition, the PROTEUS-SN solver was built to solve the even-parity transport equation on a finite element mesh provided as input. Similarly, PROTEUS-MOC and PROTEUS-NEMO were built to apply the method of characteristics on unstructured finite element meshes. Given the complexity of real world problems, experience has shown that using commercial mesh generator to create rather simple input geometries is overly complex and slow. As a consequence, significant effort has been put into place to create multiple codes that help assist in the mesh generation and manipulation. There are three input means to create a mesh in PROTEUS: UFMESH, GRID, and NEMESH. At present, the UFMESH is a simple way to generate two-dimensional Cartesian and hexagonal fuel assembly geometries. The UFmesh input allows for simple assembly mesh generation while the GRID input allows the generation of Cartesian, hexagonal, and regular triangular structured grid geometry options. The NEMESH is a way for the user to create their own mesh or convert another mesh file format into a PROTEUS input format. Given that one has an input mesh format acceptable for PROTEUS, we have constructed several tools which allow further mesh and geometry construction (i.e. mesh extrusion and merging). This report describes the various mesh tools that are provided with the PROTEUS code giving both descriptions of the input and output. In many cases the examples are provided with a regression test of the mesh tools. The most important mesh tools for any user to consider using are the MT_MeshToMesh.x and the MT_RadialLattice.x codes. The former allows the conversion between most mesh types handled by PROTEUS while the second allows the merging of multiple (assembly) meshes into a radial structured grid. Note that the mesh generation process is recursive in nature and that each input specific for a given mesh tool (such as .axial
Voltammetry at micro-mesh electrodes
Wadhawan Jay D.
2003-01-01
Full Text Available The voltammetry at three micro-mesh electrodes is explored. It is found that at sufficiently short experimental durations, the micro-mesh working electrode first behaves as an ensemble of microband electrodes, then follows the behaviour anticipated for an array of diffusion-independent micro-ring electrodes of the same perimeter as individual grid-squares within the mesh. During prolonged electrolysis, the micro-mesh electrode follows that behaviour anticipated theoretically for a cubically-packed partially-blocked electrode. Application of the micro-mesh electrode for the electrochemical determination of carbon dioxide in DMSO electrolyte solutions is further illustrated.
22nd International Meshing Roundtable
Staten, Matthew
2014-01-01
This volume contains the articles presented at the 22nd International Meshing Roundtable (IMR) organized, in part, by Sandia National Laboratories and was held on Oct 13-16, 2013 in Orlando, Florida, USA. The first IMR was held in 1992, and the conference series has been held annually since. Each year the IMR brings together researchers, developers, and application experts in a variety of disciplines, from all over the world, to present and discuss ideas on mesh generation and related topics. The technical papers in this volume present theoretical and novel ideas and algorithms with practical potential, as well as technical applications in science and engineering, geometric modeling, computer graphics and visualization.
21st International Meshing Roundtable
Weill, Jean-Christophe
2013-01-01
This volume contains the articles presented at the 21st International Meshing Roundtable (IMR) organized, in part, by Sandia National Laboratories and was held on October 7–10, 2012 in San Jose, CA, USA. The first IMR was held in 1992, and the conference series has been held annually since. Each year the IMR brings together researchers, developers, and application experts in a variety of disciplines, from all over the world, to present and discuss ideas on mesh generation and related topics. The technical papers in this volume present theoretical and novel ideas and algorithms with practical potential, as well as technical applications in science and engineering, geometric modeling, computer graphics, and visualization.
EarthCube: A Community Organization for Geoscience Cyberinfrastructure
Patten, K.; Allison, M. L.
2014-12-01
The National Science Foundation's (NSF) EarthCube initiative is a community-driven approach to building cyberinfrastructure for managing, sharing, and exploring geoscience data and information to better address today's grand-challenge science questions. The EarthCube Test Enterprise Governance project is a two-year effort seeking to engage diverse geo- and cyber-science communities in applying a responsive approach to the development of a governing system for EarthCube. During Year 1, an Assembly of seven stakeholder groups representing the broad EarthCube community developed a draft Governance Framework. Finalized at the June 2014 EarthCube All Hands Meeting, this framework will be tested during the demonstration phase in Year 2, beginning October 2014. A brief overview of the framework: Community-elected members of the EarthCube Leadership Council will be responsible for managing strategic direction and identifying the scope of EarthCube. Three Standing Committees will also be established to oversee the development of technology and architecture, to coordinate among new and existing data facilities, and to represent the academic geosciences community in driving development of EarthCube cyberinfrastructure. An Engagement Team and a Liaison Team will support communication and partnerships with internal and external stakeholders, and a central Office will serve a logistical support function to the governance as a whole. Finally, ad hoc Working Groups and Special Interest Groups will take on other issues related to EarthCube's goals. The Year 2 demonstration phase will test the effectiveness of the proposed framework and allow for elements to be changed to better meet community needs. It will begin by populating committees and teams, and finalizing leadership and decision-making processes to move forward on community-selected priorities including identifying science drivers, coordinating emerging technical elements, and coming to convergence on system architecture. A
Adaptive Mesh Refinement in CTH
Crawford, David
1999-01-01
This paper reports progress on implementing a new capability of adaptive mesh refinement into the Eulerian multimaterial shock- physics code CTH. The adaptivity is block-based with refinement and unrefinement occurring in an isotropic 2:1 manner. The code is designed to run on serial, multiprocessor and massive parallel platforms. An approximate factor of three in memory and performance improvements over comparable resolution non-adaptive calculations has-been demonstrated for a number of problems
Stochastic Boolean networks: An efficient approach to modeling gene regulatory networks
Liang Jinghang
2012-08-01
Full Text Available Abstract Background Various computational models have been of interest due to their use in the modelling of gene regulatory networks (GRNs. As a logical model, probabilistic Boolean networks (PBNs consider molecular and genetic noise, so the study of PBNs provides significant insights into the understanding of the dynamics of GRNs. This will ultimately lead to advances in developing therapeutic methods that intervene in the process of disease development and progression. The applications of PBNs, however, are hindered by the complexities involved in the computation of the state transition matrix and the steady-state distribution of a PBN. For a PBN with n genes and N Boolean networks, the complexity to compute the state transition matrix is O(nN22n or O(nN2n for a sparse matrix. Results This paper presents a novel implementation of PBNs based on the notions of stochastic logic and stochastic computation. This stochastic implementation of a PBN is referred to as a stochastic Boolean network (SBN. An SBN provides an accurate and efficient simulation of a PBN without and with random gene perturbation. The state transition matrix is computed in an SBN with a complexity of O(nL2n, where L is a factor related to the stochastic sequence length. Since the minimum sequence length required for obtaining an evaluation accuracy approximately increases in a polynomial order with the number of genes, n, and the number of Boolean networks, N, usually increases exponentially with n, L is typically smaller than N, especially in a network with a large number of genes. Hence, the computational efficiency of an SBN is primarily limited by the number of genes, but not directly by the total possible number of Boolean networks. Furthermore, a time-frame expanded SBN enables an efficient analysis of the steady-state distribution of a PBN. These findings are supported by the simulation results of a simplified p53 network, several randomly generated networks and a
CubeSat Material Limits for Design for Demise
Kelley, R. L.; Jarkey, D. R.
2014-01-01
The CubeSat form factor of nano-satellite (a satellite with a mass between one and ten kilograms) has grown in popularity due to their ease of construction and low development and launch costs. In particular, their use as student led payload design projects has increased due to the growing number of launch opportunities. CubeSats are often deployed as secondary or tertiary payloads on most US launch vehicles or they may be deployed from the ISS. The focus of this study will be on CubeSats launched from the ISS. From a space safety standpoint, the development and deployment processes for CubeSats differ significantly from that of most satellites. For large satellites, extensive design reviews and documentation are completed, including assessing requirements associated with re-entry survivability. Typical CubeSat missions selected for ISS deployment have a less rigorous review process that may not evaluate aspects beyond overall design feasibility. CubeSat design teams often do not have the resources to ensure their design is compliant with re-entry risk requirements. A study was conducted to examine methods to easily identify the maximum amount of a given material that can be used in the construction of a CubeSats without posing harm to persons on the ground. The results demonstrate that there is not a general equation or relationship that can be used for all materials; instead a limiting value must be defined for each unique material. In addition, the specific limits found for a number of generic materials that have been previously used as benchmarking materials for re-entry survivability analysis tool comparison will be discussed.
Qubits and quantum Hamiltonian computing performances for operating a digital Boolean 1/2-adder
Dridi, Ghassen; Faizy Namarvar, Omid; Joachim, Christian
2018-04-01
Quantum Boolean (1 + 1) digits 1/2-adders are designed with 3 qubits for the quantum computing (Qubits) and 4 quantum states for the quantum Hamiltonian computing (QHC) approaches. Detailed analytical solutions are provided to analyse the time operation of those different 1/2-adder gates. QHC is more robust to noise than Qubits and requires about the same amount of energy for running its 1/2-adder logical operations. QHC is faster in time than Qubits but its logical output measurement takes longer.
2017-09-01
satisfying the strict avalanche criterion,” Discrete Math ., vol. 185, pp. 29–39, 1998. [2] R.C. Bose, “On some connections between the design of... Discrete Appl. Math ., vol. 149, pp. 73–86, 2005. [11] T.W. Cusick and P. Stănică, Cryptographic Boolean Functions and Applications, 2nd ed., San Diego...Stănică, “Bisecting binomial coefficients,” Discrete Appl. Math ., vol. 227, pp. 70–83, 2017. [28] T. Martinsen, W. Meidl, and P. Stănică, “Generalized
Construction of a fuzzy and all Boolean logic gates based on DNA
M. Zadegan, Reza; Jepsen, Mette D E; Hildebrandt, Lasse
2015-01-01
to the operation of the six Boolean logic gates AND, NAND, OR, NOR, XOR, and XNOR. The logic gate complex is shown to work also when implemented in a three-dimensional DNA origami box structure, where it controlled the position of the lid in a closed or open position. Implementation of multiple microRNA sensitive...... DNA locks on one DNA origami box structure enabled fuzzy logical operation that allows biosensing of complex molecular signals. Integrating logic gates with DNA origami systems opens a vast avenue to applications in the fields of nanomedicine for diagnostics and therapeutics....
Variances as order parameter and complexity measure for random Boolean networks
Luque, Bartolo; Ballesteros, Fernando J; Fernandez, Manuel
2005-01-01
Several order parameters have been considered to predict and characterize the transition between ordered and disordered phases in random Boolean networks, such as the Hamming distance between replicas or the stable core, which have been successfully used. In this work, we propose a natural and clear new order parameter: the temporal variance. We compute its value analytically and compare it with the results of numerical experiments. Finally, we propose a complexity measure based on the compromise between temporal and spatial variances. This new order parameter and its related complexity measure can be easily applied to other complex systems
Security analysis of boolean algebra based on Zhang-Wang digital signature scheme
Zheng, Jinbin
2014-01-01
In 2005, Zhang and Wang proposed an improvement signature scheme without using one-way hash function and message redundancy. In this paper, we show that this scheme exits potential safety concerns through the analysis of boolean algebra, such as bitwise exclusive-or, and point out that mapping is not one to one between assembly instructions and machine code actually by means of the analysis of the result of the assembly program segment, and which possibly causes safety problems unknown to the software
Variances as order parameter and complexity measure for random Boolean networks
Luque, Bartolo [Departamento de Matematica Aplicada y EstadIstica, Escuela Superior de Ingenieros Aeronauticos, Universidad Politecnica de Madrid, Plaza Cardenal Cisneros 3, Madrid 28040 (Spain); Ballesteros, Fernando J [Observatori Astronomic, Universitat de Valencia, Ed. Instituts d' Investigacio, Pol. La Coma s/n, E-46980 Paterna, Valencia (Spain); Fernandez, Manuel [Departamento de Matematica Aplicada y EstadIstica, Escuela Superior de Ingenieros Aeronauticos, Universidad Politecnica de Madrid, Plaza Cardenal Cisneros 3, Madrid 28040 (Spain)
2005-02-04
Several order parameters have been considered to predict and characterize the transition between ordered and disordered phases in random Boolean networks, such as the Hamming distance between replicas or the stable core, which have been successfully used. In this work, we propose a natural and clear new order parameter: the temporal variance. We compute its value analytically and compare it with the results of numerical experiments. Finally, we propose a complexity measure based on the compromise between temporal and spatial variances. This new order parameter and its related complexity measure can be easily applied to other complex systems.
Efficient Multi-Valued Bounded Model Checking for LTL over Quasi-Boolean Algebras
Andrade, Jefferson O.; Kameyama, Yukiyoshi
2012-01-01
Multi-valued Model Checking extends classical, two-valued model checking to multi-valued logic such as Quasi-Boolean logic. The added expressivity is useful in dealing with such concepts as incompleteness and uncertainty in target systems, while it comes with the cost of time and space. Chechik and others proposed an efficient reduction from multi-valued model checking problems to two-valued ones, but to the authors' knowledge, no study was done for multi-valued bounded model checking. In thi...
A quantum speedup in machine learning: finding an N-bit Boolean function for a classification
Yoo, Seokwon; Lee, Jinhyoung; Bang, Jeongho; Lee, Changhyoup
2014-01-01
We compare quantum and classical machines designed for learning an N-bit Boolean function in order to address how a quantum system improves the machine learning behavior. The machines of the two types consist of the same number of operations and control parameters, but only the quantum machines utilize the quantum coherence naturally induced by unitary operators. We show that quantum superposition enables quantum learning that is faster than classical learning by expanding the approximate solution regions, i.e., the acceptable regions. This is also demonstrated by means of numerical simulations with a standard feedback model, namely random search, and a practical model, namely differential evolution. (paper)
Assessment of Electronic Circuits Reliability Using Boolean Truth Table Modeling Method
EI-Shanshoury, A.I.
2011-01-01
This paper explores the use of Boolean Truth Table modeling Method (BTTM) in the analysis of qualitative data. It is widely used in certain fields especially in the fields of electrical and electronic engineering. Our work focuses on the evaluation of power supply circuit reliability using (BTTM) which involves systematic attempts to falsify and identify hypotheses on the basis of truth tables constructed from qualitative data. Reliability parameters such as the system's failure rates for the power supply case study are estimated. All possible state combinations (operating and failed states) of the major components in the circuit were listed and their effects on overall system were studied
Continuous time Boolean modeling for biological signaling: application of Gillespie algorithm.
Stoll, Gautier; Viara, Eric; Barillot, Emmanuel; Calzone, Laurence
2012-08-29
Mathematical modeling is used as a Systems Biology tool to answer biological questions, and more precisely, to validate a network that describes biological observations and predict the effect of perturbations. This article presents an algorithm for modeling biological networks in a discrete framework with continuous time. There exist two major types of mathematical modeling approaches: (1) quantitative modeling, representing various chemical species concentrations by real numbers, mainly based on differential equations and chemical kinetics formalism; (2) and qualitative modeling, representing chemical species concentrations or activities by a finite set of discrete values. Both approaches answer particular (and often different) biological questions. Qualitative modeling approach permits a simple and less detailed description of the biological systems, efficiently describes stable state identification but remains inconvenient in describing the transient kinetics leading to these states. In this context, time is represented by discrete steps. Quantitative modeling, on the other hand, can describe more accurately the dynamical behavior of biological processes as it follows the evolution of concentration or activities of chemical species as a function of time, but requires an important amount of information on the parameters difficult to find in the literature. Here, we propose a modeling framework based on a qualitative approach that is intrinsically continuous in time. The algorithm presented in this article fills the gap between qualitative and quantitative modeling. It is based on continuous time Markov process applied on a Boolean state space. In order to describe the temporal evolution of the biological process we wish to model, we explicitly specify the transition rates for each node. For that purpose, we built a language that can be seen as a generalization of Boolean equations. Mathematically, this approach can be translated in a set of ordinary differential
Strahler, Alan H.; Jupp, David L. B.
1990-01-01
Geometric-optical discrete-element mathematical models for forest canopies have been developed using the Boolean logic and models of Serra. The geometric-optical approach is considered to be particularly well suited to describing the bidirectional reflectance of forest woodland canopies, where the concentration of leaf material within crowns and the resulting between-tree gaps make plane-parallel, radiative-transfer models inappropriate. The approach leads to invertible formulations, in which the spatial and directional variance provides the means for remote estimation of tree crown size, shape, and total cover from remotedly sensed imagery.
Security analysis of boolean algebra based on Zhang-Wang digital signature scheme
Zheng, Jinbin, E-mail: jbzheng518@163.com [School of Mathematics and Computer Science, Long Yan University, Longyan 364012 (China)
2014-10-06
In 2005, Zhang and Wang proposed an improvement signature scheme without using one-way hash function and message redundancy. In this paper, we show that this scheme exits potential safety concerns through the analysis of boolean algebra, such as bitwise exclusive-or, and point out that mapping is not one to one between assembly instructions and machine code actually by means of the analysis of the result of the assembly program segment, and which possibly causes safety problems unknown to the software.
Li, X Y; Yang, G W; Zheng, D S; Guo, W S; Hung, W N N
2015-04-28
Genetic regulatory networks are the key to understanding biochemical systems. One condition of the genetic regulatory network under different living environments can be modeled as a synchronous Boolean network. The attractors of these Boolean networks will help biologists to identify determinant and stable factors. Existing methods identify attractors based on a random initial state or the entire state simultaneously. They cannot identify the fixed length attractors directly. The complexity of including time increases exponentially with respect to the attractor number and length of attractors. This study used the bounded model checking to quickly locate fixed length attractors. Based on the SAT solver, we propose a new algorithm for efficiently computing the fixed length attractors, which is more suitable for large Boolean networks and numerous attractors' networks. After comparison using the tool BooleNet, empirical experiments involving biochemical systems demonstrated the feasibility and efficiency of our approach.
Latest results from the IceCube neutrino observatory
Schukraft, Anne [RWTH Aachen Univ. (Germany). III. Physikalisches Inst.; Collaboration: IceCube-Collaboration
2013-07-01
The IceCube Neutrino Observatory is the world's largest neutrino detector with a broad physics program covering the neutrino spectrum from several tens of GeV up to EeV energies. With its completion in 2010 it has reached its full sensitivity and analyses with unprecedented statistics are performed. One of the major research efforts is the search for extraterrestrial neutrino sources, which have not yet been discovered but would be a smoking gun for hadronic acceleration and could allow to identify the sources of high-energy cosmic rays. Such include steady galactic and extragalactic source candidates, e.g. Supernova Remnants and Active Galactic Nuclei, as well as transient phenomena like flaring objects and Gamma Ray Bursts. With its searches for diffuse neutrino fluxes in different energy ranges, IceCube is sensitive to fluxes of prompt atmospheric neutrinos, extragalactic neutrinos and cosmogenic neutrinos. In the low-energy range below 100 GeV, IceCube supplements classical neutrino oscillation experiments with its sensitivity to the deficit of atmospheric muon neutrinos at 25 GeV and searches for neutrinos from the annihilation of dark matter. The IceCube physics program is complemented by the surface array IceTop, which together with the detector part inside the ice serves for cosmic ray anisotropy, spectrum and composition measurements around the knee. The presentation summarizes ongoing IceCube physics analyses and recent results.
On the verge of an astronomy CubeSat revolution
Shkolnik, Evgenya L.
2018-05-01
CubeSats are small satellites built in standard sizes and form factors, which have been growing in popularity but have thus far been largely ignored within the field of astronomy. When deployed as space-based telescopes, they enable science experiments not possible with existing or planned large space missions, filling several key gaps in astronomical research. Unlike expensive and highly sought after space telescopes such as the Hubble Space Telescope, whose time must be shared among many instruments and science programs, CubeSats can monitor sources for weeks or months at time, and at wavelengths not accessible from the ground such as the ultraviolet, far-infrared and low-frequency radio. Science cases for CubeSats being developed now include a wide variety of astrophysical experiments, including exoplanets, stars, black holes and radio transients. Achieving high-impact astronomical research with CubeSats is becoming increasingly feasible with advances in technologies such as precision pointing, compact sensitive detectors and the miniaturization of propulsion systems. CubeSats may also pair with the large space- and ground-based telescopes to provide complementary data to better explain the physical processes observed.
Jennings Jason
2010-01-01
Full Text Available Laparoscopic inguinal herniorraphy via a transabdominal preperitoneal (TAPP approach using Polypropylene Mesh (Mesh and staples is an accepted technique. Mesh induces a localised inflammatory response that may extend to, and involve, adjacent abdominal and pelvic viscera such as the appendix. We present an interesting case of suspected Mesh-induced appendicitis treated successfully with laparoscopic appendicectomy, without Mesh removal, in an elderly gentleman who presented with symptoms and signs of acute appendicitis 18 months after laparoscopic inguinal hernia repair. Possible mechanisms for Mesh-induced appendicitis are briefly discussed.
Park, Jeong-Eun; Kim, Sungi; Son, Jiwoong; Lee, Yeonhee; Nam, Jwa-Min
2016-12-14
The plasmonic properties of metal nanostructures have been heavily utilized for surface-enhanced Raman scattering (SERS) and metal-enhanced fluorescence (MEF), but the direct photoluminescence (PL) from plasmonic metal nanostructures, especially with plasmonic coupling, has not been widely used as much as SERS and MEF due to the lack of understanding of the PL mechanism, relatively weak signals, and the poor availability of the synthetic methods for the nanostructures with strong PL signals. The direct PL from metal nanostructures is beneficial if these issues can be addressed because it does not exhibit photoblinking or photobleaching, does not require dye-labeling, and can be employed as a highly reliable optical signal that directly depends on nanostructure morphology. Herein, we designed and synthesized plasmonic cube-in-cube (CiC) nanoparticles (NPs) with a controllable interior nanogap in a high yield from Au nanocubes (AuNCs). In synthesizing the CiC NPs, we developed a galvanic void formation (GVF) process, composed of replacement/reduction and void formation steps. We unraveled the super-radiant character of the plasmonic coupling-induced plasmon mode which can result in highly enhanced PL intensity and long-lasting PL, and the PL mechanisms of these structures were analyzed and matched with the plasmon hybridization model. Importantly, the PL intensity and quantum yield (QY) of CiC NPs are 31 times and 16 times higher than those of AuNCs, respectively, which have shown the highest PL intensity and QY reported for metallic nanostructures. Finally, we confirmed the long-term photostability of the PL signal, and the signal remained stable for at least 1 h under continuous illumination.
Boolean logic analysis for flow regime recognition of gas–liquid horizontal flow
Ramskill, Nicholas P; Wang, Mi
2011-01-01
In order to develop a flowmeter for the accurate measurement of multiphase flows, it is of the utmost importance to correctly identify the flow regime present to enable the selection of the optimal method for metering. In this study, the horizontal flow of air and water in a pipeline was studied under a multitude of conditions using electrical resistance tomography but the flow regimes that are presented in this paper have been limited to plug and bubble air–water flows. This study proposes a novel method for recognition of the prevalent flow regime using only a fraction of the data, thus rendering the analysis more efficient. By considering the average conductivity of five zones along the central axis of the tomogram, key features can be identified, thus enabling the recognition of the prevalent flow regime. Boolean logic and frequency spectrum analysis has been applied for flow regime recognition. Visualization of the flow using the reconstructed images provides a qualitative comparison between different flow regimes. Application of the Boolean logic scheme enables a quantitative comparison of the flow patterns, thus reducing the subjectivity in the identification of the prevalent flow regime
Feedback topology and XOR-dynamics in Boolean networks with varying input structure
Ciandrini, L.; Maffi, C.; Motta, A.; Bassetti, B.; Cosentino Lagomarsino, M.
2009-08-01
We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter γ . We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying γ , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.
On the number of different dynamics in Boolean networks with deterministic update schedules.
Aracena, J; Demongeot, J; Fanchon, E; Montalva, M
2013-04-01
Deterministic Boolean networks are a type of discrete dynamical systems widely used in the modeling of genetic networks. The dynamics of such systems is characterized by the local activation functions and the update schedule, i.e., the order in which the nodes are updated. In this paper, we address the problem of knowing the different dynamics of a Boolean network when the update schedule is changed. We begin by proving that the problem of the existence of a pair of update schedules with different dynamics is NP-complete. However, we show that certain structural properties of the interaction diagraph are sufficient for guaranteeing distinct dynamics of a network. In [1] the authors define equivalence classes which have the property that all the update schedules of a given class yield the same dynamics. In order to determine the dynamics associated to a network, we develop an algorithm to efficiently enumerate the above equivalence classes by selecting a representative update schedule for each class with a minimum number of blocks. Finally, we run this algorithm on the well known Arabidopsis thaliana network to determine the full spectrum of its different dynamics. Copyright © 2013 Elsevier Inc. All rights reserved.
Feedback topology and XOR-dynamics in Boolean networks with varying input structure.
Ciandrini, L; Maffi, C; Motta, A; Bassetti, B; Cosentino Lagomarsino, M
2009-08-01
We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter gamma. We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying gamma , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.
Attractor-Based Obstructions to Growth in Homogeneous Cyclic Boolean Automata.
Khan, Bilal; Cantor, Yuri; Dombrowski, Kirk
2015-11-01
We consider a synchronous Boolean organism consisting of N cells arranged in a circle, where each cell initially takes on an independently chosen Boolean value. During the lifetime of the organism, each cell updates its own value by responding to the presence (or absence) of diversity amongst its two neighbours' values. We show that if all cells eventually take a value of 0 (irrespective of their initial values) then the organism necessarily has a cell count that is a power of 2. In addition, the converse is also proved: if the number of cells in the organism is a proper power of 2, then no matter what the initial values of the cells are, eventually all cells take on a value of 0 and then cease to change further. We argue that such an absence of structure in the dynamical properties of the organism implies a lack of adaptiveness, and so is evolutionarily disadvantageous. It follows that as the organism doubles in size (say from m to 2m) it will necessarily encounter an intermediate size that is a proper power of 2, and suffers from low adaptiveness. Finally we show, through computational experiments, that one way an organism can grow to more than twice its size and still avoid passing through intermediate sizes that lack structural dynamics, is for the organism to depart from assumptions of homogeneity at the cellular level.
Boolean network model for cancer pathways: predicting carcinogenesis and targeted therapy outcomes.
Herman F Fumiã
Full Text Available A Boolean dynamical system integrating the main signaling pathways involved in cancer is constructed based on the currently known protein-protein interaction network. This system exhibits stationary protein activation patterns--attractors--dependent on the cell's microenvironment. These dynamical attractors were determined through simulations and their stabilities against mutations were tested. In a higher hierarchical level, it was possible to group the network attractors into distinct cell phenotypes and determine driver mutations that promote phenotypic transitions. We find that driver nodes are not necessarily central in the network topology, but at least they are direct regulators of central components towards which converge or through which crosstalk distinct cancer signaling pathways. The predicted drivers are in agreement with those pointed out by diverse census of cancer genes recently performed for several human cancers. Furthermore, our results demonstrate that cell phenotypes can evolve towards full malignancy through distinct sequences of accumulated mutations. In particular, the network model supports routes of carcinogenesis known for some tumor types. Finally, the Boolean network model is employed to evaluate the outcome of molecularly targeted cancer therapies. The major find is that monotherapies were additive in their effects and that the association of targeted drugs is necessary for cancer eradication.
Technology for production of shelf stable fruit cubes
Mishra, B.B.; Jain, M.P.; Sharma, A.
2009-01-01
A technology has been developed for the production of intermediate moisture fruit cubes using a combination of osmotic dehydration and infrared drying. Fruits like pineapple, papaya, mango, banana and apple can be successfully converted into intermediate moisture products in the form of fruit cubes using this technology. The fruit cubes can blend very well as natural nutritious supplements with breakfast cereals and in certain food preparations like ice creams, milk shakes, jellies and custards. The product is microbiologically safe for consumption and can be stored at ambient storage condition for more than six months. This technology is an effective alternative for post harvest processing and preservation of ripened fruits. Fruit jam is an additional by-product generated by the process. This technology has been transferred to TT and CD, BARC
Searches for astrophysical neutrinos with IceCube
Williams, D.
2014-01-01
Powerful astrophysical objects such as active galactic nuclei (AGN), core collapse supernovae and gamma ray bursts (GRBs) are potential sources of the highest energy cosmic rays. Many models of cosmic ray proton acceleration predict a corresponding flux of neutrinos in the TeV-PeV energy range. The detection of astrophysical neutrinos requires the largest neutrino detector ever built: IceCube, a cubic-kilometer array located near the geographic South Pole. IceCube has been collecting data throughout its construction, which was complete in December 2010. Data from the partial IceCube detector have already set interesting limits on astrophysical neutrino fluxes, including stringent limits on neutrino production in GRBs. (authors)
Sierra toolkit computational mesh conceptual model
Baur, David G.; Edwards, Harold Carter; Cochran, William K.; Williams, Alan B.; Sjaardema, Gregory D.
2010-01-01
The Sierra Toolkit computational mesh is a software library intended to support massively parallel multi-physics computations on dynamically changing unstructured meshes. This domain of intended use is inherently complex due to distributed memory parallelism, parallel scalability, heterogeneity of physics, heterogeneous discretization of an unstructured mesh, and runtime adaptation of the mesh. Management of this inherent complexity begins with a conceptual analysis and modeling of this domain of intended use; i.e., development of a domain model. The Sierra Toolkit computational mesh software library is designed and implemented based upon this domain model. Software developers using, maintaining, or extending the Sierra Toolkit computational mesh library must be familiar with the concepts/domain model presented in this report.
SOSPEX, an interactive tool to explore SOFIA spectral cubes
Fadda, Dario; Chambers, Edward T.
2018-01-01
We present SOSPEX (SOFIA SPectral EXplorer), an interactive tool to visualize and analyze spectral cubes obtained with the FIFI-LS and GREAT instruments onboard the SOFIA Infrared Observatory. This software package is written in Python 3 and it is available either through Github or Anaconda.Through this GUI it is possible to explore directly the spectral cubes produced by the SOFIA pipeline and archived in the SOFIA Science Archive. Spectral cubes are visualized showing their spatial and spectral dimensions in two different windows. By selecting a part of the spectrum, the flux from the corresponding slice of the cube is visualized in the spatial window. On the other hand, it is possible to define apertures on the spatial window to show the corresponding spectral energy distribution in the spectral window.Flux isocontours can be overlapped to external images in the spatial window while line names, atmospheric transmission, or external spectra can be overplotted on the spectral window. Atmospheric models with specific parameters can be retrieved, compared to the spectra and applied to the uncorrected FIFI-LS cubes in the cases where the standard values give unsatisfactory results. Subcubes can be selected and saved as FITS files by cropping or cutting the original cubes. Lines and continuum can be fitted in the spectral window saving the results in Jyson files which can be reloaded later. Finally, in the case of spatially extended observations, it is possible to compute spectral momenta as a function of the position to obtain velocity dispersion maps or velocity diagrams.
Anisotropic evaluation of synthetic surgical meshes.
Saberski, E R; Orenstein, S B; Novitsky, Y W
2011-02-01
The material properties of meshes used in hernia repair contribute to the overall mechanical behavior of the repair. The anisotropic potential of synthetic meshes, representing a difference in material properties (e.g., elasticity) in different material axes, is not well defined to date. Haphazard orientation of anisotropic mesh material can contribute to inconsistent surgical outcomes. We aimed to characterize and compare anisotropic properties of commonly used synthetic meshes. Six different polypropylene (Trelex(®), ProLite™, Ultrapro™), polyester (Parietex™), and PTFE-based (Dualmesh(®), Infinit) synthetic meshes were selected. Longitudinal and transverse axes were defined for each mesh, and samples were cut in each axis orientation. Samples underwent uniaxial tensile testing, from which the elastic modulus (E) in each axis was determined. The degree of anisotropy (λ) was calculated as a logarithmic expression of the ratio between the elastic modulus in each axis. Five of six meshes displayed significant anisotropic behavior. Ultrapro™ and Infinit exhibited approximately 12- and 20-fold differences between perpendicular axes, respectively. Trelex(®), ProLite™, and Parietex™ were 2.3-2.4 times. Dualmesh(®) was the least anisotropic mesh, without marked difference between the axes. Anisotropy of synthetic meshes has been underappreciated. In this study, we found striking differences between elastic properties of perpendicular axes for most commonly used synthetic meshes. Indiscriminate orientation of anisotropic mesh may adversely affect hernia repairs. Proper labeling of all implants by manufacturers should be mandatory. Understanding the specific anisotropic behavior of synthetic meshes should allow surgeons to employ rational implant orientation to maximize outcomes of hernia repair.
A Governance Roadmap and Framework for EarthCube
Allison, M. L.
2012-12-01
EarthCube is a process and an outcome, established to transform the conduct of research through the development of community-guided cyberinfrastructure for the Geosciences as the prototype for potential deployment across all domain sciences. EarthCube aims to create a knowledge management system and infrastructure that integrates all Earth system and human dimensions data in an open transparent, and inclusive manner. EarthCube requires broad community participation in concept, framework, and implementation and must not be hindered by rigid preconceptions. We discovered widely varying interpretations, expectations, and assumptions about governance among EarthCube participants. Our definition of governance refers to the processes, structure and organizational elements that determine, within an organization or system of organizations, how power is exercised, how stakeholders have their say, how decisions are made, and how decision makers are held accountable. We have learned, from historic infrastructure case studies, background research on governance and from community feedback during this roadmap process, that other types of large-scale, complex infrastructures, including the Internet, have no central control, administration, or management. No national infrastructure that we examined is governed by a single entity, let alone a single governance archetype. Thus we feel the roadmap process must accommodate a governance system or system of systems that may have a single governing entity, particularly at the start, but can evolve into a collective of governing bodies as warranted, in order to be successful. A fast-track process during Spring, 2012 culminated in a Governance Roadmap delivered to an NSF-sponsored charrette in June with an aggressive timetable to define and implement a governance structure to enable the elements of EarthCube to become operational expeditiously. Our goal is to help ensure the realization of this infrastructure sooner, more efficiently, and
Shelf stable intermediate moisture fruit cubes using radiation technology
Mishra, Bibhuti B.; Saxena, Sudhanshu; Gautam, Satyendra; Chander, Ramesh; Sharma, Arun
2009-01-01
A process has been developed to prepare shelf stable ready-to-eat (RTE) intermediate moisture pineapple slices and papaya cubes using radiation technology. The combination of hurdles including osmotic dehydration, blanching, infrared drying, and gamma radiation dose of 1 kGy successfully reduced the microbial load to below detectable limit. The shelf life of the intermediate moisture pineapple slices and papaya cubes was found to be 40 days at ambient temperature (28 ± 2 deg C). The control samples spoiled within 6 days. The RTE intermediate moisture fruit products were found to have good texture, colour and sensory acceptability during this 40 days storage. (author)
CubeSat constellations for disaster management in remote areas
Santilli, Giancarlo; Vendittozzi, Cristian; Cappelletti, Chantal; Battistini, Simone; Gessini, Paolo
2018-04-01
In recent years, CubeSats have considerably extended their range of possible applications, from a low cost means to train students and young researchers in space related activities up to possible complementary solutions to larger missions. Increasingly popular, whereas CubeSats are still not a solution for all types of missions, they offer the possibility of performing ambitious scientific experiments. Especially worth considering is the possibility of performing Distributed Space Missions, in which CubeSat systems can be used to increase observation sampling rates and resolutions, as well as to perform tasks that a single satellite is unable to handle. The cost of access to space for traditional Earth Observation (EO) missions is still quite high. Efficient architecture design would allow reducing mission costs by employing CubeSat systems, while maintaining a level of performance that, for some applications, could be close to that provided by larger platforms, and decreasing the time needed to design and deploy a fully functional constellation. For these reasons many countries, including developing nations, agencies and organizations are looking to CubeSat platforms to access space cheaply with, potentially, tens of remote sensing satellites. During disaster management, real-time, fast and continuous information broadcast is a fundamental requirement. In this sense, a constellation of small satellites can considerably decrease the revisit time (defined as the time elapsed between two consecutive observations of the same point on Earth by a satellite) over remote areas, by increasing the number of spacecraft properly distributed in orbit. This allows collecting as much data as possible for the use by Disaster Management Centers. This paper describes the characteristics of a constellation of CubeSats built to enable access over the most remote regions of Brazil, supporting an integrated system for mitigating environmental disasters in an attempt to prevent the
Instant SQL Server Analysis Services 2012 Cube Security
Jayanty, Satya SK
2013-01-01
Filled with practical, step-by-step instructions and clear explanations for the most important and useful tasks. Instant Microsoft SQL Server Analysis Services 2012 Cube Security is a practical, hands-on guide that provides a number of clear, step-by-step exercises for getting started with cube security.This book is aimed at Database Administrators, Data Architects, and Systems Administrators who are managing the SQL Server data platform. It is also beneficial for analysis services developers who already have some experience with the technology, but who want to go into more detail on advanced
Searches for magnetic monopoles with IceCube
Pollmann Anna
2018-01-01
IceCube is a high energy neutrino detector using the clear ice at the South Pole as a detection medium. As monopoles pass through this ice they produce optical light by a variety of mechanisms. With increasing velocity, they produce light by catalysis of baryon decay, luminescence in the ice associated with electronic excitations, indirect and direct Cherenkov light from the monopole track, and Cherenkov light from cascades induced by pair creation and photonuclear reactions. By searching for this light, current best limits for the monopole flux over a broad range of velocities was achieved using the IceCube detector. A review of these magnetic monopole searches is presented.
Integrated Solar-Panel Antenna Array for CubeSats
Baktur, Reyhan
2016-01-01
The goal of the Integrated Solar-Panel Antenna Array for CubeSats (ISAAC) project is to design and demonstrate an effective and efficien toptically transparent, high-gain, lightweight, conformal X-band antenna array that is integrated with the solar panels of a CubeSat. The targeted demonstration is for a Near Earth Network (NEN)radio at X-band, but the design can be easilyscaled to other network radios for higher frequencies. ISAAC is a less expensive and more flexible design for communication systemscompared to a deployed dish antenna or the existing integrated solar panel antenna design.
Unstructured mesh adaptivity for urban flooding modelling
Hu, R.; Fang, F.; Salinas, P.; Pain, C. C.
2018-05-01
Over the past few decades, urban floods have been gaining more attention due to their increase in frequency. To provide reliable flooding predictions in urban areas, various numerical models have been developed to perform high-resolution flood simulations. However, the use of high-resolution meshes across the whole computational domain causes a high computational burden. In this paper, a 2D control-volume and finite-element flood model using adaptive unstructured mesh technology has been developed. This adaptive unstructured mesh technique enables meshes to be adapted optimally in time and space in response to the evolving flow features, thus providing sufficient mesh resolution where and when it is required. It has the advantage of capturing the details of local flows and wetting and drying front while reducing the computational cost. Complex topographic features are represented accurately during the flooding process. For example, the high-resolution meshes around the buildings and steep regions are placed when the flooding water reaches these regions. In this work a flooding event that happened in 2002 in Glasgow, Scotland, United Kingdom has been simulated to demonstrate the capability of the adaptive unstructured mesh flooding model. The simulations have been performed using both fixed and adaptive unstructured meshes, and then results have been compared with those published 2D and 3D results. The presented method shows that the 2D adaptive mesh model provides accurate results while having a low computational cost.
Adaptive hybrid mesh refinement for multiphysics applications
Khamayseh, Ahmed; Almeida, Valmor de
2007-01-01
The accuracy and convergence of computational solutions of mesh-based methods is strongly dependent on the quality of the mesh used. We have developed methods for optimizing meshes that are comprised of elements of arbitrary polygonal and polyhedral type. We present in this research the development of r-h hybrid adaptive meshing technology tailored to application areas relevant to multi-physics modeling and simulation. Solution-based adaptation methods are used to reposition mesh nodes (r-adaptation) or to refine the mesh cells (h-adaptation) to minimize solution error. The numerical methods perform either the r-adaptive mesh optimization or the h-adaptive mesh refinement method on the initial isotropic or anisotropic meshes to equidistribute weighted geometric and/or solution error function. We have successfully introduced r-h adaptivity to a least-squares method with spherical harmonics basis functions for the solution of the spherical shallow atmosphere model used in climate modeling. In addition, application of this technology also covers a wide range of disciplines in computational sciences, most notably, time-dependent multi-physics, multi-scale modeling and simulation
Meshes optimized for discrete exterior calculus (DEC).
Mousley, Sarah C. [Univ. of Illinois, Urbana-Champaign, IL (United States); Deakin, Michael [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Knupp, Patrick [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Mitchell, Scott A. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2017-12-01
We study the optimization of an energy function used by the meshing community to measure and improve mesh quality. This energy is non-traditional because it is dependent on both the primal triangulation and its dual Voronoi (power) diagram. The energy is a measure of the mesh's quality for usage in Discrete Exterior Calculus (DEC), a method for numerically solving PDEs. In DEC, the PDE domain is triangulated and this mesh is used to obtain discrete approximations of the continuous operators in the PDE. The energy of a mesh gives an upper bound on the error of the discrete diagonal approximation of the Hodge star operator. In practice, one begins with an initial mesh and then makes adjustments to produce a mesh of lower energy. However, we have discovered several shortcomings in directly optimizing this energy, e.g. its non-convexity, and we show that the search for an optimized mesh may lead to mesh inversion (malformed triangles). We propose a new energy function to address some of these issues.
Transrectal Mesh Erosion Requiring Bowel Resection.
Kemp, Marta Maria; Slim, Karem; Rabischong, Benoît; Bourdel, Nicolas; Canis, Michel; Botchorishvili, Revaz
To report a case of a transrectal mesh erosion as complication of laparoscopic promontofixation with mesh repair, necessitating bowel resection and subsequent surgical interventions. Sacrocolpopexy has become a standard procedure for vaginal vault prolapse [1], and the laparoscopic approach has gained popularity owing to more rapid recovery and less morbidity [2,3]. Mesh erosion is a well-known complication of surgical treatment for prolapse as reported in several negative evaluations, including a report from the US Food and Drug Administration in 2011 [4]. Mesh complications are more common after surgeries via the vaginal approach [5]; nonetheless, the incidence of vaginal mesh erosion after laparoscopic procedures is as high as 9% [6]. The incidence of transrectal mesh exposure after laparoscopic ventral rectopexy is roughly 1% [7]. The diagnosis may be delayed because of its rarity and variable presentation. In addition, polyester meshes, such as the mesh used in this case, carry a higher risk of exposure [8]. A 57-year-old woman experiencing genital prolapse, with the cervix classified as +3 according to the Pelvic Organ Prolapse Quantification system, underwent laparoscopic standard sacrocolpopexy using polyester mesh. Subtotal hysterectomy and bilateral adnexectomy were performed concomitantly. A 3-year follow-up consultation demonstrated no signs or symptoms of erosion of any type. At 7 years after the surgery, however, the patient presented with rectal discharge, diagnosed as infectious rectocolitis with the isolation of Clostridium difficile. She underwent a total of 5 repair surgeries in a period of 4 months, including transrectal resection of exposed mesh, laparoscopic ablation of mesh with digestive resection, exploratory laparoscopy with abscess drainage, and exploratory laparoscopy with ablation of residual mesh and transverse colostomy. She recovered well after the last intervention, exhibiting no signs of vaginal or rectal fistula and no recurrence
RGG: Reactor geometry (and mesh) generator
Jain, R.; Tautges, T.
2012-01-01
The reactor geometry (and mesh) generator RGG takes advantage of information about repeated structures in both assembly and core lattices to simplify the creation of geometry and mesh. It is released as open source software as a part of the MeshKit mesh generation library. The methodology operates in three stages. First, assembly geometry models of various types are generated by a tool called AssyGen. Next, the assembly model or models are meshed by using MeshKit tools or the CUBIT mesh generation tool-kit, optionally based on a journal file output by AssyGen. After one or more assembly model meshes have been constructed, a tool called CoreGen uses a copy/move/merge process to arrange the model meshes into a core model. In this paper, we present the current state of tools and new features in RGG. We also discuss the parallel-enabled CoreGen, which in several cases achieves super-linear speedups since the problems fit in available RAM at higher processor counts. Several RGG applications - 1/6 VHTR model, 1/4 PWR reactor core, and a full-core model for Monju - are reported. (authors)
Parallel adaptive simulations on unstructured meshes
Shephard, M S; Jansen, K E; Sahni, O; Diachin, L A
2007-01-01
This paper discusses methods being developed by the ITAPS center to support the execution of parallel adaptive simulations on unstructured meshes. The paper first outlines the ITAPS approach to the development of interoperable mesh, geometry and field services to support the needs of SciDAC application in these areas. The paper then demonstrates the ability of unstructured adaptive meshing methods built on such interoperable services to effectively solve important physics problems. Attention is then focused on ITAPs' developing ability to solve adaptive unstructured mesh problems on massively parallel computers
Integrated Solar-Panel Antenna Array for CubeSats (ISAAC)
National Aeronautics and Space Administration — This project will develop a new subsystem technology for CubeSats. Integrated Solar-Panel Antenna Array for CubeSats (ISAAC) is an efficient, compact, high gain, low...
Integrated CubeSat ADACS with Reaction Wheels and Star Tracker, Phase II
National Aeronautics and Space Administration — The MAI-400SS Space Sextant is a precision attitude determination and control system for CubeSats and Nanosats. The MAI-400SS enables future CubeSat missions with...
Tensile Behaviour of Welded Wire Mesh and Hexagonal Metal Mesh for Ferrocement Application
Tanawade, A. G.; Modhera, C. D.
2017-08-01
Tension tests were conducted on welded mesh and hexagonal Metal mesh. Welded Mesh is available in the market in different sizes. The two types are analysed viz. Ø 2.3 mm and Ø 2.7 mm welded mesh, having opening size 31.75 mm × 31.75 mm and 25.4 mm × 25.4 mm respectively. Tensile strength test was performed on samples of welded mesh in three different orientations namely 0°, 30° and 45° degrees with the loading axis and hexagonal Metal mesh of Ø 0.7 mm, having opening 19.05 × 19.05 mm. Experimental tests were conducted on samples of these meshes. The objective of this study was to investigate the behaviour of the welded mesh and hexagonal Metal mesh. The result shows that the tension load carrying capacity of welded mesh of Ø 2.7 mm of 0° orientation is good as compared to Ø2.3 mm mesh and ductility of hexagonal Metal mesh is good in behaviour.
Zhang, Fang; Merrill, Matthew D.; Tokash, Justin C.; Saito, Tomonori; Cheng, Shaoan; Hickner, Michael A.; Logan, Bruce E.
2011-01-01
that the mesh properties of these cathodes can significantly affect performance. Cathodes made from the coarsest mesh (30-mesh) achieved the highest maximum power of 1616 ± 25 mW m-2 (normalized to cathode projected surface area; 47.1 ± 0.7 W m-3 based on liquid
Intravesical midurethral sling mesh erosion secondary to transvaginal mesh reconstructive surgery
Sukanda Bin Jaili
2015-05-01
Conclusion: Repeated vaginal reconstructive surgery may jeopardize a primary mesh or sling, and pose a high risk of mesh erosion, which may be delayed for several years. Removal of the mesh erosion and bladder repair are feasible pervaginally with good outcome.
Yih-Lon Lin
2013-01-01
Full Text Available If the given Boolean function is linearly separable, a robust uncoupled cellular neural network can be designed as a maximal margin classifier. On the other hand, if the given Boolean function is linearly separable but has a small geometric margin or it is not linearly separable, a popular approach is to find a sequence of robust uncoupled cellular neural networks implementing the given Boolean function. In the past research works using this approach, the control template parameters and thresholds are restricted to assume only a given finite set of integers, and this is certainly unnecessary for the template design. In this study, we try to remove this restriction. Minterm- and maxterm-based decomposition algorithms utilizing the soft margin and maximal margin support vector classifiers are proposed to design a sequence of robust templates implementing an arbitrary Boolean function. Several illustrative examples are simulated to demonstrate the efficiency of the proposed method by comparing our results with those produced by other decomposition methods with restricted weights.
The IceCube Neutrino Observatory: instrumentation and online systems
Aartsen, M.G.; Ackermann, M.; Adams, J.; Aguilar, J.A.; Ansseau, I.; Ahlers, M.; Auer, R.; Baccus, J.; Barnet, S.; Ahrens, M.; Altmann, D.; Anton, G.; Andeen, K.; Anderson, T.; Archinger, M.; Argüelles, C.; Axani, S.; Auffenberg, J.; Bai, X.; Barwick, S.W.
2017-01-01
The IceCube Neutrino Observatory is a cubic-kilometer-scale high-energy neutrino detector built into the ice at the South Pole. Construction of IceCube, the largest neutrino detector built to date, was completed in 2011 and enabled the discovery of high-energy astrophysical neutrinos. We describe here the design, production, and calibration of the IceCube digital optical module (DOM), the cable systems, computing hardware, and our methodology for drilling and deployment. We also describe the online triggering and data filtering systems that select candidate neutrino and cosmic ray events for analysis. Due to a rigorous pre-deployment protocol, 98.4% of the DOMs in the deep ice are operating and collecting data. IceCube routinely achieves a detector uptime of 99% by emphasizing software stability and monitoring. Detector operations have been stable since construction was completed, and the detector is expected to operate at least until the end of the next decade.
Cosmic-ray anisotropy studies with IceCube
McNally, Frank
2014-03-01
The IceCube neutrino observatory detects tens of billions of energetic muons per year produced by cosmic-ray interactions with the atmosphere. The size of this sample has allowed IceCube to observe a significant anisotropy in arrival direction for cosmic rays with median energies between 20 and 400 TeV. This anisotropy is characterized by a large scale structure of per-mille amplitude accompanied by structures with smaller amplitudes and with typical angular sizes between 10° and 20°. IceTop, the surface component of IceCube, has observed a similar anisotropy in the arrival direction distribution of cosmic rays, extending the study to PeV energies. The better energy resolution of IceTop allows for additional studies of the anisotropy, for example a comparison of the energy spectrum in regions of a cosmic-ray excess or deficit to the rest of the sky. We present an update on the cosmic-ray anisotropy observed with IceCube and IceTop and the results of first studies of the energy spectrum at locations of cosmic-ray excess or deficit.
New Formula for Stability of Cube Armoured Roundheads
Maciñeira, Enrique; Burcharth, Hans F.
2007-01-01
Design of armour for rubble mound breakwater roundheads constitutes in many cases a problem due to the limitation of available data and guidelines. The objective of the paper is to present the results of a comprehensive model test study on the stability of cube armoured roundheads, resulting...... in a new stability formula...
An Overview of Cube-Satellite Propulsion Technologies and Trends
Akshay Reddy Tummala
2017-12-01
Full Text Available CubeSats provide a cost effective means to perform scientific and technological studies in space. Due to their affordability, CubeSat technologies have been diversely studied and developed by educational institutions, companies and space organizations all over the world. The CubeSat technology that is surveyed in this paper is the propulsion system. A propulsion system is the primary mobility device of a spacecraft and helps with orbit modifications and attitude control. This paper provides an overview of micro-propulsion technologies that have been developed or are currently being developed for CubeSats. Some of the micro-propulsion technologies listed have also flown as secondary propulsion systems on larger spacecraft. Operating principles and key design considerations for each class of propulsion system are outlined. Finally, the performance factors of micro-propulsion systems have been summarized in terms of: first, a comparison of thrust and specific impulse for all propulsion systems; second, a comparison of power and specific impulse, as also thrust-to-power ratio and specific impulse for electric propulsion systems.
Sublimation-Induced Shape Evolution of Silver Cubes
Ding, Yong
2009-12-18
The heat is on: Surface sublimation and shape transformation of silver cubes, enclosed by {100} surfaces and about 100nm in size, are examined by in situ transmission electron microscopy (see picture). High-index surfaces, such as {110}, of face-centered cubic metals are more stable when the temperature is close to the melting point.
Optimizing RDF Data Cubes for Efficient Processing of Analytical Queries
Jakobsen, Kim Ahlstrøm; Andersen, Alex B.; Hose, Katja
2015-01-01
data warehouses and data cubes. Today, external data sources are essential for analytics and, as the Semantic Web gains popularity, more and more external sources are available in native RDF. With the recent SPARQL 1.1 standard, performing analytical queries over RDF data sources has finally become...
Root oxygen use determination of propagated cucumber on rockwool cubes
Gérard, S.; Blok, C.
2013-01-01
Cucumbers were propagated in rockwool cubes in a climate cell for four weeks. The complete root system of each cucumber was enclosed in an airtight box. Each box was connected to an air bag, which acted as an air reservoir. A peristaltic pump ensured air circulation in the system. Treatments
Performing High-Quality Science on CubeSats
H. Zurbuchen, Thomas; von Steiger, Rudolf; Bartalev, Sergey
2016-01-01
in this area of research. Our discussions focused on four themes characteristic of CubeSats and their evolution: 1) identification of appropriate science in avariety of research disciplines, 2) technology development, 3) international vs. national approaches, and 4) educational benefits. These discussions...
Sublimation-Induced Shape Evolution of Silver Cubes
Ding, Yong; Fan, Fengru; Tian, Zhongqun; Wang, Zhong Lin
2009-01-01
The heat is on: Surface sublimation and shape transformation of silver cubes, enclosed by {100} surfaces and about 100nm in size, are examined by in situ transmission electron microscopy (see picture). High-index surfaces, such as {110}, of face
Mathematics Hiding in the Nets for a Cube
Jeon, Kyungsoon
2009-01-01
Whether they are third graders or teacher candidates, students can learn about perimeter and area while having fun manipulating two-dimensional figures into three-dimensional objects. In this article, the author describes a common mathematical activity for geometry students by creating nets for a cube. By making connections between nets in two…
CubeSat Form Factor Thermal Control Louvers
Evans, Allison L. (Inventor)
2018-01-01
Thermal control louvers for CubeSats or small spacecraft may include a plurality of springs attached to a back panel of the thermal control louvers. The thermal control louvers may also include a front panel, which includes at least two end panels interlocked with one or more middle panels. The front panel may secure the springs, shafts, and flaps to the back panel.
The listening cube: a three dimensional auditory training program
De Raeve, L.; Anderson, I.; Bammens, M.; Jans, J.; Haesevoets, M.; Pans, R.; Vandistel, H.; Vrolix, Y.
2012-01-01
OBJECTIVES: Here we present the Listening Cube, an auditory training program for children and adults receiving cochlear implants, developed during the clinical practice at the KIDS Royal Institute for the Deaf in Belgium. We provide information on the content of the program as well as guidance as to
The Software Invention Cube: A classification scheme for software inventions
Bergstra, J.A.; Klint, P.
2008-01-01
The patent system protects inventions. The requirement that a software invention should make ‘a technical contribution’ turns out to be untenable in practice and this raises the question, what constitutes an invention in the realm of software. The authors developed the Software Invention Cube
The Latest IceCube Results and the Implications
Mase, Keiichi
IceCube was built at the South Pole and aims to detect high energy neutrinos from the universe mainly above 100 GeV. The transparent ice media allows us to build a 1 km3 large detection volume to detect the rarely interacting particles. Neutrinos are thought to be generated at astrophysical sources such as active galactic nuclei and gamma-ray bursts. Nature of the rare interaction with matters and little deflection by a magnetic field makes it possible to explore such sources located at the deep universe. Since the neutrinos are produced through collisions of hadronic particles, the observation can elucidate the origin of cosmic rays, which is still mystery after the discovery 100 years ago. The detector was completed at the end of 2010 and is running smoothly. Recently, IceCube has found the first evidence of extraterrestrial neutrinos with energies above approximately 60 TeV. IceCube also contributes to elementary particle physics by searching for neutrinos produced in self-annihilation of SUSY particles such as neutralinos and by investigating atmospheric neutrino oscillations. The latest IceCube results and the corresponding implications are presented.
Laparoscopic Pelvic Floor Repair Using Polypropylene Mesh
Shih-Shien Weng
2008-09-01
Conclusion: Laparoscopic pelvic floor repair using a single piece of polypropylene mesh combined with uterosacral ligament suspension appears to be a feasible procedure for the treatment of advanced vaginal vault prolapse and enterocele. Fewer mesh erosions and postoperative pain syndromes were seen in patients who had no previous pelvic floor reconstructive surgery.
Robust diamond meshes with unique wettability properties.
Yang, Yizhou; Li, Hongdong; Cheng, Shaoheng; Zou, Guangtian; Wang, Chuanxi; Lin, Quan
2014-03-18
Robust diamond meshes with excellent superhydrophobic and superoleophilic properties have been fabricated. Superhydrophobicity is observed for water with varying pH from 1 to 14 with good recyclability. Reversible superhydrophobicity and hydrophilicity can be easily controlled. The diamond meshes show highly efficient water-oil separation and water pH droplet transference.
Mesh-graft urethroplasty: a case report
田中, 敏博; 滝川, 浩; 香川, 征; 長江, 浩朗
1987-01-01
We used a meshed free-foreskin transplant in a two-stage procedure for reconstruction of the extended stricture of urethra after direct vision urethrotomy. The results were excellent. Mesh-graft urethroplasty is a useful method for patients with extended strictures of the urethra or recurrent strictures after several operations.
7th International Meshing Roundtable '98
Eldred, T.J.
1998-10-01
The goal of the 7th International Meshing Roundtable is to bring together researchers and developers from industry, academia, and government labs in a stimulating, open environment for the exchange of technical information related to the meshing process. In the past, the Roundtable has enjoyed significant participation from each of these groups from a wide variety of countries.
Postoperative pain outcomes after transvaginal mesh revision.
Danford, Jill M; Osborn, David J; Reynolds, W Stuart; Biller, Daniel H; Dmochowski, Roger R
2015-01-01
Although the current literature discusses mesh complications including pain, as well as suggesting different techniques for removing mesh, there is little literature regarding pain outcomes after surgical removal or revision. The purpose of this study is to determine if surgical removal or revision of vaginal mesh improves patient's subjective complaints of pelvic pain associated with original placement of mesh. After obtaining approval from the Vanderbilt University Medical Center Institutional Review Board, a retrospective review of female patients with pain secondary to previous mesh placement who underwent excision or revision of vaginal mesh from January 2000 to August 2012 was performed. Patient age, relevant medical history including menopause status, previous hysterectomy, smoking status, and presence of diabetes, fibromyalgia, interstitial cystitis, and chronic pelvic pain, was obtained. Patients' postoperative pain complaints were assessed. Of the 481 patients who underwent surgery for mesh revision, removal or urethrolysis, 233 patients met our inclusion criteria. One hundred and sixty-nine patients (73 %) reported that their pain improved, 19 (8 %) reported that their pain worsened, and 45 (19 %) reported that their pain remained unchanged after surgery. Prior history of chronic pelvic pain was associated with increased risk of failure of the procedure to relieve pain (OR 0.28, 95 % CI 0.12-0.64, p = 0.003). Excision or revision of vaginal mesh appears to be effective in improving patients' pain symptoms most of the time. Patients with a history of chronic pelvic pain are at an increased risk of no improvement or of worsening pain.
Converting skeletal structures to quad dominant meshes
Bærentzen, Jakob Andreas; Misztal, Marek Krzysztof; Welnicka, Katarzyna
2012-01-01
We propose the Skeleton to Quad-dominant polygonal Mesh algorithm (SQM), which converts skeletal structures to meshes composed entirely of polar and annular regions. Both types of regions have a regular structure where all faces are quads except for a single ring of triangles at the center of each...
Adaptive mesh refinement in titanium
Colella, Phillip; Wen, Tong
2005-01-21
In this paper, we evaluate Titanium's usability as a high-level parallel programming language through a case study, where we implement a subset of Chombo's functionality in Titanium. Chombo is a software package applying the Adaptive Mesh Refinement methodology to numerical Partial Differential Equations at the production level. In Chombo, the library approach is used to parallel programming (C++ and Fortran, with MPI), whereas Titanium is a Java dialect designed for high-performance scientific computing. The performance of our implementation is studied and compared with that of Chombo in solving Poisson's equation based on two grid configurations from a real application. Also provided are the counts of lines of code from both sides.
A Governance Roadmap and Framework for EarthCube
Governance Steering Committee, EarthCube
2013-04-01
EarthCube is a process and an outcome, established to transform the conduct of research through the development of community-guided cyberinfrastructure for the Geosciences as the prototype for potential deployment across all domain sciences. EarthCube aims to create a knowledge management system and infrastructure that integrates all Earth system and human dimensions data in an open transparent, and inclusive manner. EarthCube requires broad community participation in concept, framework, and implementation and must not be hindered by rigid preconceptions. We discovered widely varying interpretations, expectations, and assumptions about governance among EarthCube participants. Our definition of governance refers to the processes, structure and organizational elements that determine, within an organization or system of organizations, how power is exercised, how stakeholders have their say, how decisions are made, and how decision makers are held accountable. We have learned, from historic infrastructure case studies, background research on governance and from community feedback during this roadmap process, that other types of large-scale, complex infrastructures, including the Internet, have no central control, administration, or management. No national infrastructure that we examined is governed by a single entity, let alone a single governance archetype. Thus we feel the roadmap process must accommodate a governance system or system of systems that may have a single governing entity, particularly at the start, but can evolve into a collective of governing bodies as warranted, in order to be successful. A fast-track process during Spring, 2012 culminated in a Governance Roadmap delivered to an NSF-sponsored charrette in June with an aggressive timetable to define and implement a governance structure to enable the elements of EarthCube to become operational expeditiously. Our goal is to help ensure the realization of this infrastructure sooner, more efficiently, and
X-Band CubeSat Communication System Demonstration
Altunc, Serhat; Kegege, Obadiah; Bundick, Steve; Shaw, Harry; Schaire, Scott; Bussey, George; Crum, Gary; Burke, Jacob C.; Palo, Scott; O'Conor, Darren
2015-01-01
Today's CubeSats mostly operate their communications at UHF- and S-band frequencies. UHF band is presently crowded, thus downlink communications are at lower data rates due to bandwidth limitations and are unreliable due to interference. This research presents an end-to-end robust, innovative, compact, efficient and low cost S-band uplink and X-band downlink CubeSat communication system demonstration between a balloon and a Near Earth Network (NEN) ground system. Since communication systems serve as umbilical cords for space missions, demonstration of this X-band communication system is critical for successfully supporting current and future CubeSat communication needs. This research has three main objectives. The first objective is to design, simulate, and test a CubeSat S- and X-band communication system. Satellite Tool Kit (STK) dynamic link budget calculations and HFSS Simulations and modeling results have been used to trade the merit of various designs for small satellite applications. S- and X-band antennas have been tested in the compact antenna test range at Goddard Space Flight Center (GSFC) to gather radiation pattern data. The second objective is simulate and test a CubeSat compatible X-band communication system at 12.5Mbps including S-band antennas, X-band antennas, Laboratory for Atmospheric and Space Physics (LASP) /GSFC transmitter and an S-band receiver from TRL-5 to TRL-8 by the end of this effort. Different X-band communication system components (antennas, diplexers, etc.) from GSFC, other NASA centers, universities, and private companies have been investigated and traded, and a complete component list for the communication system baseline has been developed by performing analytical and numerical analysis. This objective also includes running simulations and performing trades between different X-band antenna systems to optimize communication system performance. The final objective is to perform an end-to-end X-band CubeSat communication system
Automatic mesh generation with QMESH program
Ise, Takeharu; Tsutsui, Tsuneo
1977-05-01
Usage of the two-dimensional self-organizing mesh generation program, QMESH, is presented together with the descriptions and the experience, as it has recently been converted and reconstructed from the NEACPL version to the FACOM. The program package consists of the QMESH code to generate quadrilaterial meshes with smoothing techniques, the QPLOT code to plot the data obtained from the QMESH on the graphic COM, and the RENUM code to renumber the meshes by using a bandwidth minimization procedure. The technique of mesh reconstructuring coupled with smoothing techniques is especially useful when one generates the meshes for computer codes based on the finite element method. Several typical examples are given for easy access to the QMESH program, which is registered in the R.B-disks of JAERI for users. (auth.)
Radiography of Co-60 in the lead cube castings
Djoli Soembogo; Harun Al Rasyid R; Namad Sianta
2016-01-01
Radiography Co-60 on Carbon steel or Stainless steel has been widely applied, but for metal Lead has not yet been applied and has not yet widely known. Lead has a greater density than Carbon steel or Stainless steel and could muffle gamma radiation so it takes a longer exposure time. The result of its film radiography are also not as good as compared to radiography applications on carbon steel or Stainless steel. The study also applied digital radiography using isotope Co-60 sources and used Epson V700 scanner positive film for digitization results of conventional radiographic films. These radiographs using film AGFA D7 to get the contrast medium, medium sensitivity and good image quality. The purpose of radiography Co-60 on the cube castings Lead is to find indications of defective castings cube Lead and digitizing the results using conventional radiographic film with a positive film media scanner to process the data transfer and storage of digital data. Radiographic testing has been carried out using the isotope Co-60 on metal castings Lead with a single thickness of a single shadow method using positive film scanner media and isotope Co-60 with disabilities observation parameter Lead metal castings on radiographic film. Co-60 radiation time exposure is 3,500 hours for the thickness of the metal cube castings Lead 100 mm with the activity of 29 Ci and perpendicular SFD of 840 mm. Radiographic testing on metal cube castings Lead by the method of a single thickness of single image defects produce a parameter indicative for a cube of metal castings Lead of porosity level 2. The density mean of radiographic film was 2.051 and 2.046 for 5 minutes in a developer solution. The result of scanning positive film is in the form of digital radiography which allows for the transfer of digital data or computerized storage of digital data. This status is still within limits acceptable under the standards referred. (author)
Bossi, Giulia; Marcato, Gianluca; Gottardi, Guido; Borgatti, Lisa
2016-04-01
When designing the geotechnical model of a landslide the information to define the soil profile within the slope is usually inferred from a small amount of data. This is particularly true for large landslides where the study area is vast and the variability of terrains is high. In this framework, a method allowing the best locations for further field investigation campaigns to be identified would be extremely useful. The Boolean Stochastic Generation method (BoSG), which randomly generates different soil distributions of two definite soil types in both 2D and 3D models, is a newly developed algorithm that can guide in this process. In this work the method has been applied to the Mortisa landslide case study, which is located in the Cortina d'Ampezzo valley (Veneto, Italy), part of the Dolomites UNESCO World Heritage list. The mudslide is 3.5 km long, stretching from 1750 to 1300 m a.s.l., and is located in a highly antrophized area where is damaging some buildings and a national road with its almost continuous movements. In fact, from year 2008, GNSS surveys recorded rates of displacements reaching 1.2 m/year in the most active parts of the landslide; the movements occur on a slip surfaces are located between 20 and 50 m below the surface. From the borecores some wooden samples were extracted allowing to reconstruct the sequence of events that led to the development of the present-day Mortisa slope. Interdigitated layers of gravel in a silty clay matrix originated from subsequent earth and debris flows events since the Lateglacial compose the landslide body, a condition that is particularly apt to be investigated with BoSG. A BoSG run for the Mortisa landslide was performed calculating 1200 soil configurations and using laboratory test parameters for the silty-clay matrix. The results were stacked in a tridimensional matrix in order to calculate the mean and the standard deviation (SD) of displacements for each element of the model mesh. In this way maps of the SD
Super-transient scaling in time-delay autonomous Boolean network motifs
D' Huys, Otti, E-mail: otti.dhuys@phy.duke.edu; Haynes, Nicholas D. [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Lohmann, Johannes [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Institut für Theoretische Physik, Technische Universität Berlin, Hardenbergstraße 36, 10623 Berlin (Germany); Gauthier, Daniel J. [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Department of Physics, The Ohio State University, Columbus, Ohio 43210 (United States)
2016-09-15
Autonomous Boolean networks are commonly used to model the dynamics of gene regulatory networks and allow for the prediction of stable dynamical attractors. However, most models do not account for time delays along the network links and noise, which are crucial features of real biological systems. Concentrating on two paradigmatic motifs, the toggle switch and the repressilator, we develop an experimental testbed that explicitly includes both inter-node time delays and noise using digital logic elements on field-programmable gate arrays. We observe transients that last millions to billions of characteristic time scales and scale exponentially with the amount of time delays between nodes, a phenomenon known as super-transient scaling. We develop a hybrid model that includes time delays along network links and allows for stochastic variation in the delays. Using this model, we explain the observed super-transient scaling of both motifs and recreate the experimentally measured transient distributions.
Fisher information at the edge of chaos in random Boolean networks.
Wang, X Rosalind; Lizier, Joseph T; Prokopenko, Mikhail
2011-01-01
We study the order-chaos phase transition in random Boolean networks (RBNs), which have been used as models of gene regulatory networks. In particular we seek to characterize the phase diagram in information-theoretic terms, focusing on the effect of the control parameters (activity level and connectivity). Fisher information, which measures how much system dynamics can reveal about the control parameters, offers a natural interpretation of the phase diagram in RBNs. We report that this measure is maximized near the order-chaos phase transitions in RBNs, since this is the region where the system is most sensitive to its parameters. Furthermore, we use this study of RBNs to clarify the relationship between Shannon and Fisher information measures.
Quantum tests for the linearity and permutation invariance of Boolean functions
Hillery, Mark [Department of Physics, Hunter College of the City University of New York, 695 Park Avenue, New York, New York 10021 (United States); Andersson, Erika [SUPA, School of Engineering and Physical Sciences, Heriot-Watt University, Edinburgh EH14 4AS (United Kingdom)
2011-12-15
The goal in function property testing is to determine whether a black-box Boolean function has a certain property or is {epsilon}-far from having that property. The performance of the algorithm is judged by how many calls need to be made to the black box in order to determine, with high probability, which of the two alternatives is the case. Here we present two quantum algorithms, the first to determine whether the function is linear and the second to determine whether it is symmetric (invariant under permutations of the arguments). Both require order {epsilon}{sup -2/3} calls to the oracle, which is better than known classical algorithms. In addition, in the case of linearity testing, if the function is linear, the quantum algorithm identifies which linear function it is. The linearity test combines the Bernstein-Vazirani algorithm and amplitude amplification, while the test to determine whether a function is symmetric uses projective measurements and amplitude amplification.
The pseudo-Boolean optimization approach to form the N-version software structure
Kovalev, I. V.; Kovalev, D. I.; Zelenkov, P. V.; Voroshilova, A. A.
2015-10-01
The problem of developing an optimal structure of N-version software system presents a kind of very complex optimization problem. This causes the use of deterministic optimization methods inappropriate for solving the stated problem. In this view, exploiting heuristic strategies looks more rational. In the field of pseudo-Boolean optimization theory, the so called method of varied probabilities (MVP) has been developed to solve problems with a large dimensionality. Some additional modifications of MVP have been made to solve the problem of N-version systems design. Those algorithms take into account the discovered specific features of the objective function. The practical experiments have shown the advantage of using these algorithm modifications because of reducing a search space.
Lima, Ricardo
2016-06-16
This paper addresses the solution of a cardinality Boolean quadratic programming problem using three different approaches. The first transforms the original problem into six mixed-integer linear programming (MILP) formulations. The second approach takes one of the MILP formulations and relies on the specific features of an MILP solver, namely using starting incumbents, polishing, and callbacks. The last involves the direct solution of the original problem by solvers that can accomodate the nonlinear combinatorial problem. Particular emphasis is placed on the definition of the MILP reformulations and their comparison with the other approaches. The results indicate that the data of the problem has a strong influence on the performance of the different approaches, and that there are clear-cut approaches that are better for some instances of the data. A detailed analysis of the results is made to identify the most effective approaches for specific instances of the data. © 2016 Springer Science+Business Media New York
Lima, Ricardo; Grossmann, Ignacio E.
2016-01-01
This paper addresses the solution of a cardinality Boolean quadratic programming problem using three different approaches. The first transforms the original problem into six mixed-integer linear programming (MILP) formulations. The second approach takes one of the MILP formulations and relies on the specific features of an MILP solver, namely using starting incumbents, polishing, and callbacks. The last involves the direct solution of the original problem by solvers that can accomodate the nonlinear combinatorial problem. Particular emphasis is placed on the definition of the MILP reformulations and their comparison with the other approaches. The results indicate that the data of the problem has a strong influence on the performance of the different approaches, and that there are clear-cut approaches that are better for some instances of the data. A detailed analysis of the results is made to identify the most effective approaches for specific instances of the data. © 2016 Springer Science+Business Media New York
Chao Luo
Full Text Available A novel algebraic approach is proposed to study dynamics of asynchronous random Boolean networks where a random number of nodes can be updated at each time step (ARBNs. In this article, the logical equations of ARBNs are converted into the discrete-time linear representation and dynamical behaviors of systems are investigated. We provide a general formula of network transition matrices of ARBNs as well as a necessary and sufficient algebraic criterion to determine whether a group of given states compose an attractor of length[Formula: see text] in ARBNs. Consequently, algorithms are achieved to find all of the attractors and basins in ARBNs. Examples are showed to demonstrate the feasibility of the proposed scheme.
Strahler, Alan H.; Li, Xiao-Wen; Jupp, David L. B.
1991-01-01
The bidirectional radiance or reflectance of a forest or woodland can be modeled using principles of geometric optics and Boolean models for random sets in a three dimensional space. This model may be defined at two levels, the scene includes four components; sunlight and shadowed canopy, and sunlit and shadowed background. The reflectance of the scene is modeled as the sum of the reflectances of the individual components as weighted by their areal proportions in the field of view. At the leaf level, the canopy envelope is an assemblage of leaves, and thus the reflectance is a function of the areal proportions of sunlit and shadowed leaf, and sunlit and shadowed background. Because the proportions of scene components are dependent upon the directions of irradiance and exitance, the model accounts for the hotspot that is well known in leaf and tree canopies.
Programming Cell Adhesion for On-Chip Sequential Boolean Logic Functions.
Qu, Xiangmeng; Wang, Shaopeng; Ge, Zhilei; Wang, Jianbang; Yao, Guangbao; Li, Jiang; Zuo, Xiaolei; Shi, Jiye; Song, Shiping; Wang, Lihua; Li, Li; Pei, Hao; Fan, Chunhai
2017-08-02
Programmable remodelling of cell surfaces enables high-precision regulation of cell behavior. In this work, we developed in vitro constructed DNA-based chemical reaction networks (CRNs) to program on-chip cell adhesion. We found that the RGD-functionalized DNA CRNs are entirely noninvasive when interfaced with the fluidic mosaic membrane of living cells. DNA toehold with different lengths could tunably alter the release kinetics of cells, which shows rapid release in minutes with the use of a 6-base toehold. We further demonstrated the realization of Boolean logic functions by using DNA strand displacement reactions, which include multi-input and sequential cell logic gates (AND, OR, XOR, and AND-OR). This study provides a highly generic tool for self-organization of biological systems.
Fog water collection effectiveness: Mesh intercomparisons
Fernandez, Daniel; Torregrosa, Alicia; Weiss-Penzias, Peter; Zhang, Bong June; Sorensen, Deckard; Cohen, Robert; McKinley, Gareth; Kleingartner, Justin; Oliphant, Andrew; Bowman, Matthew
2018-01-01
To explore fog water harvesting potential in California, we conducted long-term measurements involving three types of mesh using standard fog collectors (SFC). Volumetric fog water measurements from SFCs and wind data were collected and recorded in 15-minute intervals over three summertime fog seasons (2014–2016) at four California sites. SFCs were deployed with: standard 1.00 m2 double-layer 35% shade coefficient Raschel; stainless steel mesh coated with the MIT-14 hydrophobic formulation; and FogHa-Tin, a German manufactured, 3-dimensional spacer fabric deployed in two orientations. Analysis of 3419 volumetric samples from all sites showed strong relationships between mesh efficiency and wind speed. Raschel mesh collected 160% more fog water than FogHa-Tin at wind speeds less than 1 m s–1 and 45% less for wind speeds greater than 5 m s–1. MIT-14 coated stainless-steel mesh collected more fog water than Raschel mesh at all wind speeds. At low wind speeds of steel mesh collected 3% more and at wind speeds of 4–5 m s–1, it collected 41% more. FogHa-Tin collected 5% more fog water when the warp of the weave was oriented vertically, per manufacturer specification, than when the warp of the weave was oriented horizontally. Time series measurements of three distinct mesh across similar wind regimes revealed inconsistent lags in fog water collection and inconsistent performance. Since such differences occurred under similar wind-speed regimes, we conclude that other factors play important roles in mesh performance, including in-situ fog event and aerosol dynamics that affect droplet-size spectra and droplet-to-mesh surface interactions.
Recurrent-neural-network-based Boolean factor analysis and its application to word clustering.
Frolov, Alexander A; Husek, Dusan; Polyakov, Pavel Yu
2009-07-01
The objective of this paper is to introduce a neural-network-based algorithm for word clustering as an extension of the neural-network-based Boolean factor analysis algorithm (Frolov , 2007). It is shown that this extended algorithm supports even the more complex model of signals that are supposed to be related to textual documents. It is hypothesized that every topic in textual data is characterized by a set of words which coherently appear in documents dedicated to a given topic. The appearance of each word in a document is coded by the activity of a particular neuron. In accordance with the Hebbian learning rule implemented in the network, sets of coherently appearing words (treated as factors) create tightly connected groups of neurons, hence, revealing them as attractors of the network dynamics. The found factors are eliminated from the network memory by the Hebbian unlearning rule facilitating the search of other factors. Topics related to the found sets of words can be identified based on the words' semantics. To make the method complete, a special technique based on a Bayesian procedure has been developed for the following purposes: first, to provide a complete description of factors in terms of component probability, and second, to enhance the accuracy of classification of signals to determine whether it contains the factor. Since it is assumed that every word may possibly contribute to several topics, the proposed method might be related to the method of fuzzy clustering. In this paper, we show that the results of Boolean factor analysis and fuzzy clustering are not contradictory, but complementary. To demonstrate the capabilities of this attempt, the method is applied to two types of textual data on neural networks in two different languages. The obtained topics and corresponding words are at a good level of agreement despite the fact that identical topics in Russian and English conferences contain different sets of keywords.
Neutrino oscillation parameter sampling with MonteCUBES
Blennow, Mattias; Fernandez-Martinez, Enrique
2010-01-01
We present MonteCUBES ("Monte Carlo Utility Based Experiment Simulator"), a software package designed to sample the neutrino oscillation parameter space through Markov Chain Monte Carlo algorithms. MonteCUBES makes use of the GLoBES software so that the existing experiment definitions for GLoBES, describing long baseline and reactor experiments, can be used with MonteCUBES. MonteCUBES consists of two main parts: The first is a C library, written as a plug-in for GLoBES, implementing the Markov Chain Monte Carlo algorithm to sample the parameter space. The second part is a user-friendly graphical Matlab interface to easily read, analyze, plot and export the results of the parameter space sampling. Program summaryProgram title: MonteCUBES (Monte Carlo Utility Based Experiment Simulator) Catalogue identifier: AEFJ_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEFJ_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: GNU General Public Licence No. of lines in distributed program, including test data, etc.: 69 634 No. of bytes in distributed program, including test data, etc.: 3 980 776 Distribution format: tar.gz Programming language: C Computer: MonteCUBES builds and installs on 32 bit and 64 bit Linux systems where GLoBES is installed Operating system: 32 bit and 64 bit Linux RAM: Typically a few MBs Classification: 11.1 External routines: GLoBES [1,2] and routines/libraries used by GLoBES Subprograms used:Cat Id ADZI_v1_0, Title GLoBES, Reference CPC 177 (2007) 439 Nature of problem: Since neutrino masses do not appear in the standard model of particle physics, many models of neutrino masses also induce other types of new physics, which could affect the outcome of neutrino oscillation experiments. In general, these new physics imply high-dimensional parameter spaces that are difficult to explore using classical methods such as multi-dimensional projections and minimizations, such as those
[CLINICAL EVALUATION OF THE NEW ANTISEPTIC MESHES].
Gogoladze, M; Kiladze, M; Chkhikvadze, T; Jiqia, D
2016-12-01
Improving the results of hernia treatment and prevention of complications became a goal of our research which included two parts - experimental and clinical. Histomorphological and bacteriological researches showed that the best result out of the 3 control groups was received in case of covering implant "Coladerm"+ with chlorhexidine. Based on the experiment results working process continued in clinics in order to test and introduce new "coladerm"+ chlorhexidine covered poliprophilene meshes into practice. For clinical illustration there were 60 patients introduced to the research who had hernioplasty procedures by different nets: I group - standard meshes+"coladerm"+chlorhexidine, 35 patients; II group - standard meshes +"coladerm", 15 patients; III group - standard meshes, 10 patients. Assessment of the wound and echo-control was done post-surgery on the 8th, 30th and 90th days. This clinical research based on the experimental results once again showed the best anti-microbe features of new antiseptic polymeric biocomposite meshes (standard meshes+"coladerm"+chlorhexidine); timely termination of regeneration and reparation processes without any post-surgery suppurative complications. We hope that new antiseptic polymeric biocomposite meshes presented by us will be successfully used in surgical practice of hernia treatment based on and supported by expermental-clinical research.
Fog water collection effectiveness: Mesh intercomparisons
Fernandez, Daniel; Torregrosa, Alicia; Weiss-Penzias, Peter; Zhang, Bong June; Sorensen, Deckard; Cohen, Robert; McKinley, Gareth; Kleingartner, Justin; Oliphant, Andrew; Bowman, Matthew
2018-01-01
To explore fog water harvesting potential in California, we conducted long-term measurements involving three types of mesh using standard fog collectors (SFC). Volumetric fog water measurements from SFCs and wind data were collected and recorded in 15-minute intervals over three summertime fog seasons (2014–2016) at four California sites. SFCs were deployed with: standard 1.00 m2 double-layer 35% shade coefficient Raschel; stainless steel mesh coated with the MIT-14 hydrophobic formulation; and FogHa-Tin, a German manufactured, 3-dimensional spacer fabric deployed in two orientations. Analysis of 3419 volumetric samples from all sites showed strong relationships between mesh efficiency and wind speed. Raschel mesh collected 160% more fog water than FogHa-Tin at wind speeds less than 1 m s–1 and 45% less for wind speeds greater than 5 m s–1. MIT-14 coated stainless-steel mesh collected more fog water than Raschel mesh at all wind speeds. At low wind speeds of wind speeds of 4–5 m s–1, it collected 41% more. FogHa-Tin collected 5% more fog water when the warp of the weave was oriented vertically, per manufacturer specification, than when the warp of the weave was oriented horizontally. Time series measurements of three distinct mesh across similar wind regimes revealed inconsistent lags in fog water collection and inconsistent performance. Since such differences occurred under similar wind-speed regimes, we conclude that other factors play important roles in mesh performance, including in-situ fog event and aerosol dynamics that affect droplet-size spectra and droplet-to-mesh surface interactions.
Transvaginal mesh procedures for pelvic organ prolapse.
Walter, Jens-Erik
2011-02-01
To provide an update on transvaginal mesh procedures, newly available minimally invasive surgical techniques for pelvic floor repair. The discussion is limited to minimally invasive transvaginal mesh procedures. PubMed and Medline were searched for articles published in English, using the key words "pelvic organ prolapse," transvaginal mesh," and "minimally invasive surgery." Results were restricted to systematic reviews, randomized control trials/controlled clinical trials, and observational studies. Searches were updated on a regular basis, and articles were incorporated in the guideline to May 2010. Grey (unpublished) literature was identified through searching the websites of health technology assessment and health technology assessment-related agencies, clinical practice guideline collections, clinical trial registries, and national and international medical specialty societies. The quality of evidence was rated using the criteria described in the Report of the Canadian Task Force on the Preventive Health Care. Recommendations for practice were ranked according to the method described in that report (Table 1). Counselling for the surgical treatment of pelvic organ prolapse should consider all benefits, harms, and costs of the surgical procedure, with particular emphasis on the use of mesh. 1. Patients should be counselled that transvaginal mesh procedures are considered novel techniques for pelvic floor repair that demonstrate high rates of anatomical cure in uncontrolled short-term case series. (II-2B) 2. Patients should be informed of the range of success rates until stronger evidence of superiority is published. (II-2B) 3. Training specific to transvaginal mesh procedures should be undertaken before procedures are performed. (III-C) 4. Patients should undergo thorough preoperative counselling regarding (a) the potential serious adverse sequelae of transvaginal mesh repairs, including mesh exposure, pain, and dyspareunia; and (b) the limited data available
Zhang, Fang
2011-02-01
Mesh current collectors made of stainless steel (SS) can be integrated into microbial fuel cell (MFC) cathodes constructed of a reactive carbon black and Pt catalyst mixture and a poly(dimethylsiloxane) (PDMS) diffusion layer. It is shown here that the mesh properties of these cathodes can significantly affect performance. Cathodes made from the coarsest mesh (30-mesh) achieved the highest maximum power of 1616 ± 25 mW m-2 (normalized to cathode projected surface area; 47.1 ± 0.7 W m-3 based on liquid volume), while the finest mesh (120-mesh) had the lowest power density (599 ± 57 mW m-2). Electrochemical impedance spectroscopy showed that charge transfer and diffusion resistances decreased with increasing mesh opening size. In MFC tests, the cathode performance was primarily limited by reaction kinetics, and not mass transfer. Oxygen permeability increased with mesh opening size, accounting for the decreased diffusion resistance. At higher current densities, diffusion became a limiting factor, especially for fine mesh with low oxygen transfer coefficients. These results demonstrate the critical nature of the mesh size used for constructing MFC cathodes. © 2010 Elsevier B.V. All rights reserved.
Polygonal Prism Mesh in the Viscous Layers for the Polyhedral Mesh Generator, PolyGen
Lee, Sang Yong; Park, Chan Eok; Kim, Shin Whan
2015-01-01
Polyhedral mesh has been known to have some benefits over the tetrahedral mesh. Efforts have been made to set up a polyhedral mesh generation system with open source programs SALOME and TetGen. The evaluation has shown that the polyhedral mesh generation system is promising. But it is necessary to extend the capability of the system to handle the viscous layers to be a generalized mesh generator. A brief review to the previous works on the mesh generation for the viscous layers will be made in section 2. Several challenging issues for the polygonal prism mesh generation will be discussed as well. The procedure to generate a polygonal prism mesh will be discussed in detail in section 3. Conclusion will be followed in section 4. A procedure to generate meshes in the viscous layers with PolyGen has been successfully designed. But more efforts have to be exercised to find the best way for the generating meshes for viscous layers. Using the extrusion direction of the STL data will the first of the trials in the near future
Effect of contact angle on the orientation, stability, and assembly of dense floating cubes.
Daniello, Robert; Khan, Kashan; Donnell, Michael; Rothstein, Jonathan P
2014-02-01
In this paper, the effect of contact angle, density, and size on the orientation, stability, and assembly of floating cubes was investigated. All the cubes tested were more dense than water. Floatation occurred as a result of capillary stresses induced by deformation of the air-water interface. The advancing contact angle of the bare acrylic cubes was measured to be 85°. The contact angle of the cubes was increased by painting the cubes with a commercially available superhydrophobic paint to reach an advancing contact angle of 150°. Depending on their size, density, and contact angle, the cubes were observed to float in one of three primary orientations: edge up, vertex up, and face up. An experimental apparatus was built such that the sum of the gravitational force, buoyancy force, and capillary forces could be measured using a force transducer as a function of cube position as it was lowered through the air-water interface. Measurements showed that the maximum capillary forces were always experienced for the face up orientation. However, when floatation was possible in the vertex up orientation, it was found to be the most stable cube orientation because it had the lowest center of gravity. A series of theoretical predictions were performed for the cubes floating in each of the three primary orientations to calculate the net force on the cube. The theoretical predictions were found to match the experimental measurements well. A cube stability diagram of cube orientation as a function of cube contact angle and size was prepared from the predictions of theory and found to match the experimental observations quite well. The assembly of cubes floating face up and vertex up were also studied for assemblies of two, three, and many cubes. Cubes floating face up were found to assemble face-to-face and form regular square lattice patterns with no free interface between cubes. Cubes floating vertex up were found to assemble in a variety of different arrangements
Mesh Optimization for Ground Vehicle Aerodynamics
Adrian Gaylard; Essam F Abo-Serie; Nor Elyana Ahmad
2010-01-01
Mesh optimization strategy for estimating accurate drag of a ground vehicle is proposed based on examining the effect of different mesh parameters. The optimized mesh parameters were selected using design of experiment (DOE) method to be able to work in a...
Engagement of Metal Debris into Gear Mesh
handschuh, Robert F.; Krantz, Timothy L.
2010-01-01
A series of bench-top experiments was conducted to determine the effects of metallic debris being dragged through meshing gear teeth. A test rig that is typically used to conduct contact fatigue experiments was used for these tests. Several sizes of drill material, shim stock and pieces of gear teeth were introduced and then driven through the meshing region. The level of torque required to drive the "chip" through the gear mesh was measured. From the data gathered, chip size sufficient to jam the mechanism can be determined.
Mesh requirements for neutron transport calculations
Askew, J.R.
1967-07-01
Fine-structure calculations are reported for a cylindrical natural uranium-graphite cell using different solution methods (discrete ordinate and collision probability codes) and varying the spatial mesh. It is suggested that of formulations assuming the source constant in a mesh interval the differential approach is generally to be preferred. Due to cancellation between approximations made in the derivation of the finite difference equations and the errors in neglecting source variation, the discrete ordinate code gave a more accurate estimate of fine structure for a given mesh even for unusually coarse representations. (author)
S-Cube: Enabling the Next Generation of Software Services
Metzger, Andreas; Pohl, Klaus
The Service Oriented Architecture (SOA) paradigm is increasingly adopted by industry for building distributed software systems. However, when designing, developing and operating innovative software services and servicebased systems, several challenges exist. Those challenges include how to manage the complexity of those systems, how to establish, monitor and enforce Quality of Service (QoS) and Service Level Agreements (SLAs), as well as how to build those systems such that they can proactively adapt to dynamically changing requirements and context conditions. Developing foundational solutions for those challenges requires joint efforts of different research communities such as Business Process Management, Grid Computing, Service Oriented Computing and Software Engineering. This paper provides an overview of S-Cube, the European Network of Excellence on Software Services and Systems. S-Cube brings together researchers from leading research institutions across Europe, who join their competences to develop foundations, theories as well as methods and tools for future service-based systems.
Almost everywhere convergence over cubes of multiple trigonometric Fourier series
Antonov, N Yu
2004-01-01
Under certain conditions on a function φ:[0,+∞)→[0,+∞) we prove a theorem asserting that the convergence almost everywhere of trigonometric Fourier series for all functions of class φ(L) [-π,π) implies the convergence over cubes of the multiple Fourier series and all its conjugates for an arbitrary function f element of φ(L)(log + L) d-1 ) [-π,π) d , d element of N. It follows from this and an earlier result of the author on the convergence almost everywhere of Fourier series of functions of one variable and class L(log + L)(log + log + log + L)) [-π,π) that if f element of L(log + L) d (log + log + log + L)) [-π,π) d , d element of N, then the Fourier series of f and all its conjugates converge over cubes almost everywhere
Blazar origin of some IceCube events
Miranda, Luis Salvador; Leon, Alberto Rosales de; Sahu, Sarira [Universidad Nacional Autonoma de Mexico, Circuito Exterior, C.U., Instituto de Ciencias Nucleares, Mexico, DF (Mexico)
2016-07-15
Recently the ANTARES collaboration presented a time dependent analysis of a selected number of flaring blazars to look for upward going muon events produced from the charge current interaction of the muon neutrinos. We use the same list of flaring blazars to look for a possible positional correlation with the IceCube neutrino events. In the context of the photohadronic model we propose that the neutrinos are produced within the nuclear region of the blazar where Fermi accelerated high energy protons interact with the background synchrotron/SSC photons. Although we found that some objects from the ANTARES list are within the error circles of a few IceCube events, the statistical analysis shows that none of these sources have a significant correlation. (orig.)
Practical layer designs for polarizing beam-splitter cubes.
von Blanckenhagen, Bernhard
2006-03-01
Liquid-crystal-on-silicon- (LCoS-) based digital projection systems require high-performance polarizing beam splitters. The classical beam-splitter cube with an immersed interference coating can fulfill these requirements. Practical layer designs can be generated by computer optimization using the classic MacNeille polarizer layer design as the starting layer design. Multilayer structures with 100 nm bandwidth covering the blue, green, or red spectral region and one design covering the whole visible spectral region are designed. In a second step these designs are realized by using plasma-ion-assisted deposition. The performance of the practical beam-splitter cubes is compared with the theoretical performance of the layer designs.
IceCube Constraints on the Fermi Bubbles
Sherf, Nimrod; Keshet, Uri [Physics Department, Ben-Gurion University of the Negev, POB 653, Be’er-Sheva 84105 (Israel); Gurwich, Ilya, E-mail: sherfnim@post.bgu.ac.il, E-mail: ukeshet@bgu.ac.il, E-mail: gurwichphys@gmail.com [Department of Physics, NRCN, POB 9001, Beer-Sheva 84190 (Israel)
2017-10-01
We analyze the IceCube four-year neutrino data in search of a signal from the Fermi bubbles. No signal is found from the bubbles or from their dense shell, even when taking into account the softer background. This imposes a conservative ξ {sub i} < 8% upper limit on the cosmic-ray ion (CRI) acceleration efficiency, and an η ≡ ξ {sub e} / ξ {sub i} ≳ 0.006 lower limit on the electron-to-ion ratio of acceleration efficiencies (at the 2 σ confidence level). For typical ξ {sub i} , a signal should surface once the number of IceCube neutrinos increases by ∼an order of magnitude, unless there is a
IceCube and the Development of Neutrino Astronomy
CERN. Geneva
2016-01-01
Abstract: IceCube's discovery of a diffuse flux of astrophysical neutrinos started a new era of neutrino astronomy.I will review the multiple diffuse analyses in IceCube that observe the astrophysical flux, and what each can tell us. Then I will focus on spatial analyses that aim to identify the sources of such astrophysical neutrinos. This will be followed by an attempt to reconcile all results to draw a coherent picture that is the state of neutrino astronomy. Current plans for a streamlined real-time alert system to promote multi-messenger observations, and future plans of new detectors at the South Pole will be discussed to map out a path for discovering the first high-energy neutrino source in the sky.
A spatio-temporal extension to the map cube operator
Alzate, Juan C.; Moreno, Francisco J.; Echeverri, Jaime
2012-09-01
OLAP (On Line Analytical Processing) is a set of techniques and operators to facilitate the data analysis usually stored in a data warehouse. In this paper, we extend the functionality of an OLAP operator known as Map Cube with the definition and incorporation of a function that allows the formulation of spatio-temporal queries. For example, consider a data warehouse about crimes that includes data about the places where the crimes were committed. Suppose we want to find and visualize the trajectory (a trajectory is just the path that an object follows through space as a function of time) of the crimes of a suspect beginning with his oldest crime and ending with his most recent one. In order to meet this requirement, we extend the Map Cube operator.
Data Cubes Integration in Spatial OLAP for Agricultural Commodities
Putri, A. I.; Sitanggang, I. S.
2017-03-01
Ministry of Agriculture Indonesia collects data of agricultural commodities in Indonesia in the annual period. Agricultural commodities data include food crops, horticulture, plantations, and livestock. The data are available in the spreadsheet format. This study developed data cubes for food crops, plantations, and livestock using the galaxy schema of data warehouse and integrated the data cubes into the SOLAP Horticulture using SpagoBI. SOLAP is useful for data analysis and data visualization. The application displays agricultural commodities data in form of crosstab and chart. This study also developed the location intelligence module that visualizes agricultural commodities data on the map. The system was tested using the black box approach. The result showed that main functions including roll up, drill down, slice, dice, and pivot work properly. This application is expected to enable users to easily obtain data summaries of agricultural commodities.
Modelling the response of quasi-optical corner cube mixers
Kelly, W.M.; Eivers, J.G.; Gans, M.J.
1986-01-01
A three-dimensional modeling technique is developed to analyze and predict the optical performance of Schottky-diode corner-cube/wire-antenna devices for submm-astronomy applications. The model determines the antenna efficiency for the case of Gaussian input beams, and simulations of performance in a variety of configurations can be used to optimize instrument designs. Corner-to-whisker spacing and antenna/beam orientation are found to be the most important coupling parameters. 12 references
Landsat 8 Data Modeled as DGGS Data Cubes
Sherlock, M. J.; Tripathi, G.; Samavati, F.
2016-12-01
In the context of tracking recent global changes in the Earth's landscape, Landsat 8 provides high-resolution multi-wavelength data with a temporal resolution of sixteen days. Such a live dataset can benefit novel applications in environmental monitoring. However, a temporal analysis of this dataset in its native format is a challenging task mostly due to the huge volume of geospatial images and imperfect overlay of different day Landsat 8 images. We propose the creation of data cubes derived from Landsat 8 data, through the use of a Discrete Global Grid System (DGGS). DGGS referencing of Landsat 8 data provides a cell-based representation of the pixel values for a fixed area on earth, indexed by keys. Having the calibrated cell-based Landsat 8 images can speed up temporal analysis and facilitate parallel processing using distributed systems. In our method, the Landsat 8 dataset hosted on Amazon Web Services (AWS) is downloaded using a web crawler and stored on a filesystem. We apply the cell-based DGGS referencing (using Pyxis SDK) to Landsat 8 images which provide a rhombus based tessellation of equal area cells for our use-case. After this step, the cell-images which overlay perfectly on different days, are stacked in the temporal dimension and stored into data cube units. The depth of the cube represents the number of temporal images of the same cell and can be updated when new images are received each day. Harnessing the regular spatio-temporal structure of data cubes, we want to compress, query, transmit and visualize big Landsat 8 data in an efficient way for temporal analysis.
Ho’ oponopono: A Radar Calibration CubeSat
2011-10-13
frequency-hopping spread -spectrum radio. The MHX2420 operates in the 2.4–2.4835 GHz range, and outputs 1 W of RF power with a required supplied...Doc/S71327_04.pdf 45. http://www.cubesat.org/images/LaunchProviders/ mkIII/p-pod%20mk%20iii%20icd.pdf 46. Pumpkin CubeSat Kit website, http
Cosmic Ray Physics with the IceCube Observatory
Kolanoski, H
2013-01-01
The IceCube Neutrino Observatory with its 1-km 3 in-ice detector and the 1-km 2 surface detector (IceTop) constitutes a three-dimensional cosmic ray detector well suited for general cosmic ray physics. Various measurements of cosmic ray properties, such as energy spectra, mass composition and anisotropies, have been obtained from analyses of air showers at the surface and/or atmospheric muons in the ice.
Thermal Effects on the "Ice-Cube Puzzle"
Lima, F. M. S.; Monteiro, F. F.
2012-01-01
When an ice cube floating on water in a container melts, it is said in some textbooks that the water level does not change. However, as pointed out by Lan in a recent work, when the buoyant force from a less dense fluid resting above the waterline is taken into account, one should expect a detectable "increase" in the volume of water. Here in this…
Demonstration of a Data Distribution System for ALMA Data Cubes
Eguchi, S.; Kawasaki, W.; Shirasaki, Y.; Komiya, Y.; Kosugi, G.; Ohishi, M.; Mizumoto, Y.; Kobayashi, T.
2014-05-01
The Atacama Large Millimeter / submillimeter Array (ALMA) is the world's largest radio telescope in Chile. As a part of Japanese Virtual Observatory (JVO) system, we have been constructing a prototype of data service to distribute ALMA data, which are three or four dimensional cubes and expected to exceed 2 TB in total size, corresponding to 75 days at world-averaged Internet bandwidth of 2.6 Mbps, in the next three years. To utilize the limited bandwidth, our system adopts a higher dimensional version of so-called "deep zoom": the system generates and stores lower resolution FITS data cubes with various binning parameters in directions of both space and frequency. Users of our portal site can easily visualize and cut out those data cubes by using ALMAWebQL, which is a web application built on customized GWT. Once the FITS files are downloaded via ALMAWebQL, one can visualize them in more detail using Vissage, a Java-based FITS cube browser. We exhibited our web and desktop viewer “fresh from the oven” at the last ADASS conference (Shirasaki et al. 2013). Improvement of their performance and functionality after that made the system nearly to a practical level. The performance problem of ALMAWebQL reported last year (Eguchi et al. 2013) was overcome by optimizing the network topology and applying the just-in-time endian conversion algorithm; the latest ALMAWebQL can follow up any user actions almost in real time for files smaller than 5 GB. It also enables users to define either a sub-region or sub-frequency range and move it freely on the graphical user interface, providing more detailed information of the FITS file. In addition, the latest Vissage now supports data from other telescopes including HST, Subaru, Chandra, etc. and overlaying two images. In this paper, we introduce the latest version of our VO system.
ASPECT CubeSat mission to a binary asteroid
Kohout, Tomáš; Näsilä, A.; Tikka, T.; Muinonen, K.; Penttilä, A.; Kestilä, A.; Kallio, E.
2016-01-01
Roč. 88, Special volume (2016), s. 283-283 ISSN 0367-5211. [ Nordic Geological Winter Meeting /32./. 13.01.2016-15.01.2016, Helsinki] Institutional support: RVO:67985831 Keywords : CubeSat * asteroid * AIDA * reflectance spectra ASPECT Subject RIV: DB - Geology ; Mineralogy http://www.geologinenseura.fi/bulletin/Special_Volume_1_2016/BGSF-NGWM2016_Abstract_Volume.pdf
How to improve your PubMed/MEDLINE searches: 3. advanced searching, MeSH and My NCBI.
Fatehi, Farhad; Gray, Leonard C; Wootton, Richard
2014-03-01
Although the basic PubMed search is often helpful, the results may sometimes be non-specific. For more control over the search process you can use the Advanced Search Builder interface. This allows a targeted search in specific fields, with the convenience of being able to select the intended search field from a list. It also provides a history of your previous searches. The search history is useful to develop a complex search query by combining several previous searches using Boolean operators. For indexing the articles in MEDLINE, the NLM uses a controlled vocabulary system called MeSH. This standardised vocabulary solves the problem of authors, researchers and librarians who may use different terms for the same concept. To be efficient in a PubMed search, you should start by identifying the most appropriate MeSH terms and use them in your search where possible. My NCBI is a personal workspace facility available through PubMed and makes it possible to customise the PubMed interface. It provides various capabilities that can enhance your search performance.
Lunar and Lagrangian Point L1 L2 CubeSat Communication and Navigation Considerations
Schaire, Scott; Wong, Yen F.; Altunc, Serhat; Bussey, George; Shelton, Marta; Folta, Dave; Gramling, Cheryl; Celeste, Peter; Anderson, Mile; Perrotto, Trish;
2017-01-01
CubeSats have grown in sophistication to the point that relatively low-cost mission solutions could be undertaken for planetary exploration. There are unique considerations for lunar and L1/L2 CubeSat communication and navigation compared with low earth orbit CubeSats. This paper explores those considerations as they relate to the Lunar IceCube Mission. The Lunar IceCube is a CubeSat mission led by Morehead State University with participation from NASA Goddard Space Flight Center, Jet Propulsion Laboratory, the Busek Company and Vermont Tech. It will search for surface water ice and other resources from a high inclination lunar orbit. Lunar IceCube is one of a select group of CubeSats designed to explore beyond low-earth orbit that will fly on NASA’s Space Launch System (SLS) as secondary payloads for Exploration Mission (EM) 1. Lunar IceCube and the EM-1 CubeSats will lay the groundwork for future lunar and L1/L2 CubeSat missions. This paper discusses communication and navigation needs for the Lunar IceCube mission and navigation and radiation tolerance requirements related to lunar and L1/L2 orbits. Potential CubeSat radios and antennas for such missions are investigated and compared. Ground station coverage, link analysis, and ground station solutions are also discussed. This paper will describe modifications in process for the Morehead ground station, as well as further enhancements of the Morehead ground station and NASA Near Earth Network (NEN) that are being considered. The potential NEN enhancements include upgrading current NEN Cortex receiver with Forward Error Correction (FEC) Turbo Code, providing X-band uplink capability, and adding ranging options. The benefits of ground station enhancements for CubeSats flown on NASA Exploration Missions (EM) are presented. This paper also describes how the NEN may support lunar and L1/L2 CubeSats without any enhancements. In addition, NEN is studying other initiatives to better support the CubeSat community
Obtuse triangle suppression in anisotropic meshes
Sun, Feng; Choi, Yi King; Wang, Wen Ping; Yan, Dongming; Liu, Yang; Lé vy, Bruno L.
2011-01-01
Anisotropic triangle meshes are used for efficient approximation of surfaces and flow data in finite element analysis, and in these applications it is desirable to have as few obtuse triangles as possible to reduce the discretization error. We present a variational approach to suppressing obtuse triangles in anisotropic meshes. Specifically, we introduce a hexagonal Minkowski metric, which is sensitive to triangle orientation, to give a new formulation of the centroidal Voronoi tessellation (CVT) method. Furthermore, we prove several relevant properties of the CVT method with the newly introduced metric. Experiments show that our algorithm produces anisotropic meshes with much fewer obtuse triangles than using existing methods while maintaining mesh anisotropy. © 2011 Elsevier B.V. All rights reserved.
Connectivity editing for quad-dominant meshes
Peng, Chihan; Wonka, Peter
2013-01-01
and illustrate the advantages and disadvantages of different strategies for quad-dominant mesh design. © 2013 The Author(s) Computer Graphics Forum © 2013 The Eurographics Association and John Wiley & Sons Ltd.
Grid adaptation using chimera composite overlapping meshes
Kao, Kai-Hsiung; Liou, Meng-Sing; Chow, Chuen-Yen
1994-01-01
The objective of this paper is to perform grid adaptation using composite overlapping meshes in regions of large gradient to accurately capture the salient features during computation. The chimera grid scheme, a multiple overset mesh technique, is used in combination with a Navier-Stokes solver. The numerical solution is first converged to a steady state based on an initial coarse mesh. Solution-adaptive enhancement is then performed by using a secondary fine grid system which oversets on top of the base grid in the high-gradient region, but without requiring the mesh boundaries to join in any special way. Communications through boundary interfaces between those separated grids are carried out using trilinear interpolation. Application to the Euler equations for shock reflections and to shock wave/boundary layer interaction problem are tested. With the present method, the salient features are well-resolved.
Grid adaption using Chimera composite overlapping meshes
Kao, Kai-Hsiung; Liou, Meng-Sing; Chow, Chuen-Yen
1993-01-01
The objective of this paper is to perform grid adaptation using composite over-lapping meshes in regions of large gradient to capture the salient features accurately during computation. The Chimera grid scheme, a multiple overset mesh technique, is used in combination with a Navier-Stokes solver. The numerical solution is first converged to a steady state based on an initial coarse mesh. Solution-adaptive enhancement is then performed by using a secondary fine grid system which oversets on top of the base grid in the high-gradient region, but without requiring the mesh boundaries to join in any special way. Communications through boundary interfaces between those separated grids are carried out using tri-linear interpolation. Applications to the Euler equations for shock reflections and to a shock wave/boundary layer interaction problem are tested. With the present method, the salient features are well resolved.
Shape space exploration of constrained meshes
Yang, Yongliang
2011-12-12
We present a general computational framework to locally characterize any shape space of meshes implicitly prescribed by a collection of non-linear constraints. We computationally access such manifolds, typically of high dimension and co-dimension, through first and second order approximants, namely tangent spaces and quadratically parameterized osculant surfaces. Exploration and navigation of desirable subspaces of the shape space with regard to application specific quality measures are enabled using approximants that are intrinsic to the underlying manifold and directly computable in the parameter space of the osculant surface. We demonstrate our framework on shape spaces of planar quad (PQ) meshes, where each mesh face is constrained to be (nearly) planar, and circular meshes, where each face has a circumcircle. We evaluate our framework for navigation and design exploration on a variety of inputs, while keeping context specific properties such as fairness, proximity to a reference surface, etc. © 2011 ACM.
Shape space exploration of constrained meshes
Yang, Yongliang; Yang, Yijun; Pottmann, Helmut; Mitra, Niloy J.
2011-01-01
We present a general computational framework to locally characterize any shape space of meshes implicitly prescribed by a collection of non-linear constraints. We computationally access such manifolds, typically of high dimension and co-dimension, through first and second order approximants, namely tangent spaces and quadratically parameterized osculant surfaces. Exploration and navigation of desirable subspaces of the shape space with regard to application specific quality measures are enabled using approximants that are intrinsic to the underlying manifold and directly computable in the parameter space of the osculant surface. We demonstrate our framework on shape spaces of planar quad (PQ) meshes, where each mesh face is constrained to be (nearly) planar, and circular meshes, where each face has a circumcircle. We evaluate our framework for navigation and design exploration on a variety of inputs, while keeping context specific properties such as fairness, proximity to a reference surface, etc. © 2011 ACM.
Obtuse triangle suppression in anisotropic meshes
Sun, Feng
2011-12-01
Anisotropic triangle meshes are used for efficient approximation of surfaces and flow data in finite element analysis, and in these applications it is desirable to have as few obtuse triangles as possible to reduce the discretization error. We present a variational approach to suppressing obtuse triangles in anisotropic meshes. Specifically, we introduce a hexagonal Minkowski metric, which is sensitive to triangle orientation, to give a new formulation of the centroidal Voronoi tessellation (CVT) method. Furthermore, we prove several relevant properties of the CVT method with the newly introduced metric. Experiments show that our algorithm produces anisotropic meshes with much fewer obtuse triangles than using existing methods while maintaining mesh anisotropy. © 2011 Elsevier B.V. All rights reserved.
Mesh Processing in Medical Image Analysis
The following topics are dealt with: mesh processing; medical image analysis; interactive freeform modeling; statistical shape analysis; clinical CT images; statistical surface recovery; automated segmentation; cerebral aneurysms; and real-time particle-based representation....
Capacity Analysis of Wireless Mesh Networks
M. I. Gumel
2012-06-01
Full Text Available The next generation wireless networks experienced a great development with emergence of wireless mesh networks (WMNs, which can be regarded as a realistic solution that provides wireless broadband access. The limited available bandwidth makes capacity analysis of the network very essential. While the network offers broadband wireless access to community and enterprise users, the problems that limit the network capacity must be addressed to exploit the optimum network performance. The wireless mesh network capacity analysis shows that the throughput of each mesh node degrades in order of l/n with increasing number of nodes (n in a linear topology. The degradation is found to be higher in a fully mesh network as a result of increase in interference and MAC layer contention in the network.
Energy-efficient wireless mesh networks
Ntlatlapa, N
2007-06-01
Full Text Available This paper outlines the objectives of a recently formed research group at Meraka Institute. The authors consider application of wireless mesh networks in rural infrastructure deficient parts of the African continent where nodes operate on batteries...
LR: Compact connectivity representation for triangle meshes
Gurung, T; Luffel, M; Lindstrom, P; Rossignac, J
2011-01-28
We propose LR (Laced Ring) - a simple data structure for representing the connectivity of manifold triangle meshes. LR provides the option to store on average either 1.08 references per triangle or 26.2 bits per triangle. Its construction, from an input mesh that supports constant-time adjacency queries, has linear space and time complexity, and involves ordering most vertices along a nearly-Hamiltonian cycle. LR is best suited for applications that process meshes with fixed connectivity, as any changes to the connectivity require the data structure to be rebuilt. We provide an implementation of the set of standard random-access, constant-time operators for traversing a mesh, and show that LR often saves both space and traversal time over competing representations.
Seeking new surgical predictors of mesh exposure after transvaginal mesh repair.
Wu, Pei-Ying; Chang, Chih-Hung; Shen, Meng-Ru; Chou, Cheng-Yang; Yang, Yi-Ching; Huang, Yu-Fang
2016-10-01
The purpose of this study was to explore new preventable risk factors for mesh exposure. A retrospective review of 92 consecutive patients treated with transvaginal mesh (TVM) in the urogynecological unit of our university hospital. An analysis of perioperative predictors was conducted in patients after vaginal repairs using a type 1 mesh. Mesh complications were recorded according to International Urogynecological Association (IUGA) definitions. Mesh-exposure-free durations were calculated by using the Kaplan-Meier method and compared between different closure techniques using log-rank test. Hazard ratios (HR) of predictors for mesh exposure were estimated by univariate and multivariate analyses using Cox proportional hazards regression models. The median surveillance interval was 24.1 months. Two late occurrences were found beyond 1 year post operation. No statistically significant correlation was observed between mesh exposure and concomitant hysterectomy. Exposure risks were significantly higher in patients with interrupted whole-layer closure in univariate analysis. In the multivariate analysis, hematoma [HR 5.42, 95 % confidence interval (CI) 1.26-23.35, P = 0.024), Prolift mesh (HR 5.52, 95 % CI 1.15-26.53, P = 0.033), and interrupted whole-layer closure (HR 7.02, 95 % CI 1.62-30.53, P = 0.009) were the strongest predictors of mesh exposure. Findings indicate the risks of mesh exposure and reoperation may be prevented by avoiding hematoma, large amount of mesh, or interrupted whole-layer closure in TVM surgeries. If these risk factors are prevented, hysterectomy may not be a relative contraindication for TVM use. We also provide evidence regarding mesh exposure and the necessity for more than 1 year of follow-up and preoperative counselling.
Mutagenicity potential of commercial broth cubes at varying concentrations
De Torres, Nelson Velasquez; Talain, Augusto Nicolas.
1997-01-01
Today, there has been a growing concern on the mutagenicity potential of environmental chemical systems. These environmental chemicals such as pesticides, food additives, synthetic drugs, water and atmospheric pollutants are possible causes of mutagenic activity. Meat products and some meat flavorings, were also reported to exhibit mutagenic activity. And since these products are normal part of the daily human diet, there is a need for extensive studies regarding the possible mutagenic activity associated with these products. This study aimed to evaluate the mutagenicity potential of commercial broth cubes at varying concentration. The researchers sought to answer the following questions: 1. Do beef, pork and chicken broth cubes exhibit mutagenic activity? 2. Are there significant differences in the mutagenic activity among the three samples? 3. Are these significant differences in the mutagenic activity exhibited by each of the samples compared to that of Mitomycin-C (positive control)? 4. Which of the sample of each specific concentration exhibit the greatest mutagenic activity? Three specific concentrations of beef, pork and chicken broth cubes were prepared and their mutagenicity potential was evaluated by using the Micronucleus test. The formation of micro nucleated polychromatic and micro nucleated normo chromatic erythrocytes in bone marrow cells of mice treated with these samples were detected using a Carl-Zeiss photo microscope. The statistical tool used to test the validity of the null hypothesis was analysis of variance using randomized complete block design and independent T- test. (author)
Mutagenicity potential of commercial broth cubes at varying concentrations
De Torres, Nelson Velasquez; Talain, Augusto Nicolas
1998-12-31
Today, there has been a growing concern on the mutagenicity potential of environmental chemical systems. These environmental chemicals such as pesticides, food additives, synthetic drugs, water and atmospheric pollutants are possible causes of mutagenic activity. Meat products and some meat flavorings, were also reported to exhibit mutagenic activity. And since these products are normal part of the daily human diet, there is a need for extensive studies regarding the possible mutagenic activity associated with these products. This study aimed to evaluate the mutagenicity potential of commercial broth cubes at varying concentration. The researchers sought to answer the following questions: 1. Do beef, pork and chicken broth cubes exhibit mutagenic activity? 2. Are there significant differences in the mutagenic activity among the three samples? 3. Are these significant differences in the mutagenic activity exhibited by each of the samples compared to that of Mitomycin-C (positive control)? 4. Which of the sample of each specific concentration exhibit the greatest mutagenic activity? Three specific concentrations of beef, pork and chicken broth cubes were prepared and their mutagenicity potential was evaluated by using the Micronucleus test. The formation of micro nucleated polychromatic and micro nucleated normo chromatic erythrocytes in bone marrow cells of mice treated with these samples were detected using a Carl-Zeiss photo microscope. The statistical tool used to test the validity of the null hypothesis was analysis of variance using randomized complete block design and independent T- test. (author). 28 refs., 9 figs., 26 tabs.
IceCube systematic errors investigation: Simulation of the ice
Resconi, Elisa; Wolf, Martin [Max-Planck-Institute for Nuclear Physics, Heidelberg (Germany); Schukraft, Anne [RWTH, Aachen University (Germany)
2010-07-01
IceCube is a neutrino observatory for astroparticle and astronomy research at the South Pole. It uses one cubic kilometer of Antartica's deepest ice (1500 m-2500 m in depth) to detect Cherenkov light, generated by charged particles traveling through the ice, with an array of phototubes encapsulated in glass pressure spheres. The arrival time as well as the charge deposited of the detected photons represent the base measurements that are used for track and energy reconstruction of those charged particles. The optical properties of the deep antarctic ice vary from layer to layer. Measurements of the ice properties and their correct modeling in Monte Carlo simulation is then of primary importance for the correct understanding of the IceCube telescope behavior. After a short summary about the different methods to investigate the ice properties and to calibrate the detector, we show how the simulation obtained by using this information compares to the measured data and how systematic errors due to uncertain ice properties are determined in IceCube.
Moon and Sun shadow observation with IceCube
Bos, Fabian; Tenholt, Frederik; Becker-Tjus, Julia [Theoretische Physik, Ruhr-Universitaet, Bochum (Germany); Westerhoff, Stefan [University of Wisconsin, Madison (United States); Collaboration: IceCube-Collaboration
2015-07-01
The analysis of the Moon shadow is a standard method in IceCube to determine the angular resolution and absolute pointing capabilities of the IceCube detector at the geographic South Pole. The Sun has not been used as a calibrator thus far, as its shadow is expected to be influenced by the solar magnetic field, which deflects the cosmic rays near the solar surface. This, on the other hand, provides indirect pieces of information on the magnetic field structure of the Sun. This talk shows a first analysis of the Sun shadow with IceCube data. The analysis is based on the data of the detector configurations with 79 (IC79) and 86 strings (IC86) from 2010 through 2012. To examine the shadows, a binned method is used to compare all events from one on-source with two off-source windows. For the IC40 and IC59 configuration a deficit with a statistical significance of more than 6σ was observed.
IceCube: An Instrument for Neutrino Astronomy
IceCube Collaboration; Halzen, F.; Klein, S.
2010-06-04
Neutrino astronomy beyond the Sun was first imagined in the late 1950s; by the 1970s, it was realized that kilometer-scale neutrino detectors were required. The first such instrument, IceCube, is near completion and taking data. The IceCube project transforms a cubic kilometer of deep and ultra-transparent Antarctic ice into a particle detector. A total of 5,160 optical sensors are embedded into a gigaton of Antarctic ice to detect the Cherenkov light emitted by secondary particles produced when neutrinos interact with nuclei in the ice. Each optical sensor is a complete data acquisition system, including a phototube, digitization electronics, control and trigger systems and LEDs for calibration. The light patterns reveal the type (flavor) of neutrino interaction and the energy and direction of the neutrino, making neutrino astronomy possible. The scientific missions of IceCube include such varied tasks as the search for sources of cosmic rays, the observation of Galactic supernova explosions, the search for dark matter, and the study of the neutrinos themselves. These reach energies well beyond those produced with accelerator beams.
Applying GRID Technologies to XML Based OLAP Cube Construction
Niemi, Tapio Petteri; Nummenmaa, J; Thanisch, P
2002-01-01
On-Line Analytical Processing (OLAP) is a powerful method for analysing large data warehouse data. Typically, the data for an OLAP database is collected from a set of data repositories such as e.g. operational databases. This data set is often huge, and it may not be known in advance what data is required and when to perform the desired data analysis tasks. Sometimes it may happen that some parts of the data are only needed occasionally. Therefore, storing all data to the OLAP database and keeping this database constantly up-to-date is not only a highly demanding task but it also may be overkill in practice. This suggests that in some applications it would be more feasible to form the OLAP cubes only when they are actually needed. However, the OLAP cube construction can be a slow process. Thus, we present a system that applies Grid technologies to distribute the computation. As the data sources may well be heterogeneous, we propose an XML language for data collection. The user's definition for a OLAP new cube...
MHD simulations on an unstructured mesh
Strauss, H.R.; Park, W.; Belova, E.; Fu, G.Y.; Sugiyama, L.E.
1998-01-01
Two reasons for using an unstructured computational mesh are adaptivity, and alignment with arbitrarily shaped boundaries. Two codes which use finite element discretization on an unstructured mesh are described. FEM3D solves 2D and 3D RMHD using an adaptive grid. MH3D++, which incorporates methods of FEM3D into the MH3D generalized MHD code, can be used with shaped boundaries, which might be 3D
Towards Blockchain-enabled Wireless Mesh Networks
Selimi, Mennan; Kabbinale, Aniruddh Rao; Ali, Anwaar; Navarro, Leandro; Sathiaseelan, Arjuna
2018-01-01
Recently, mesh networking and blockchain are two of the hottest technologies in the telecommunications industry. Combining both can reformulate internet access and make connecting to the Internet not only easy, but affordable too. Hyperledger Fabric (HLF) is a blockchain framework implementation and one of the Hyperledger projects hosted by The Linux Foundation. We evaluate HLF in a real production mesh network and in the laboratory, quantify its performance, bottlenecks and limitations of th...
Unstructured Mesh Movement and Viscous Mesh Generation for CFD-Based Design Optimization, Phase II
National Aeronautics and Space Administration — The innovations proposed are twofold: 1) a robust unstructured mesh movement method able to handle isotropic (Euler), anisotropic (viscous), mixed element (hybrid)...
MHD simulations on an unstructured mesh
Strauss, H.R.; Park, W.
1996-01-01
We describe work on a full MHD code using an unstructured mesh. MH3D++ is an extension of the PPPL MH3D resistive full MHD code. MH3D++ replaces the structured mesh and finite difference / fourier discretization of MH3D with an unstructured mesh and finite element / fourier discretization. Low level routines which perform differential operations, solution of PDEs such as Poisson's equation, and graphics, are encapsulated in C++ objects to isolate the finite element operations from the higher level code. The high level code is the same, whether it is run in structured or unstructured mesh versions. This allows the unstructured mesh version to be benchmarked against the structured mesh version. As a preliminary example, disruptions in DIIID reverse shear equilibria are studied numerically with the MH3D++ code. Numerical equilibria were first produced starting with an EQDSK file containing equilibrium data of a DIII-D L-mode negative central shear discharge. Using these equilibria, the linearized equations are time advanced to get the toroidal mode number n = 1 linear growth rate and eigenmode, which is resistively unstable. The equilibrium and linear mode are used to initialize 3D nonlinear runs. An example shows poloidal slices of 3D pressure surfaces: initially, on the left, and at an intermediate time, on the right
How to model wireless mesh networks topology
Sanni, M L; Hashim, A A; Anwar, F; Ali, S; Ahmed, G S M
2013-01-01
The specification of network connectivity model or topology is the beginning of design and analysis in Computer Network researches. Wireless Mesh Networks is an autonomic network that is dynamically self-organised, self-configured while the mesh nodes establish automatic connectivity with the adjacent nodes in the relay network of wireless backbone routers. Researches in Wireless Mesh Networks range from node deployment to internetworking issues with sensor, Internet and cellular networks. These researches require modelling of relationships and interactions among nodes including technical characteristics of the links while satisfying the architectural requirements of the physical network. However, the existing topology generators model geographic topologies which constitute different architectures, thus may not be suitable in Wireless Mesh Networks scenarios. The existing methods of topology generation are explored, analysed and parameters for their characterisation are identified. Furthermore, an algorithm for the design of Wireless Mesh Networks topology based on square grid model is proposed in this paper. The performance of the topology generated is also evaluated. This research is particularly important in the generation of a close-to-real topology for ensuring relevance of design to the intended network and validity of results obtained in Wireless Mesh Networks researches
[Implants for genital prolapse : Contra mesh surgery].
Hampel, C
2017-12-01
Alloplastic transvaginal meshes have become very popular in the surgery of pelvic organ prolapse (POP) as did alloplastic suburethral slings in female stress incontinence surgery, but without adequate supporting data. The simplicity of the mesh procedure facilitates its propagation with acceptance of higher revision and complication rates. Since attending physicians do more and more prolapse surgeries without practicing or teaching alternative techniques, expertise in these alternatives, which might be very useful in cases of recurrence, persistence or complications, is permanently lost. It is doubtful that proper and detailed information about alternatives, risks, and benefits of transvaginal alloplastic meshes is provided to every single prolapse patient according to the recommendations of the German POP guidelines, since the number of implanted meshes exceeds the number of properly indicated mesh candidates by far. Although there is no dissent internationally about the available mesh data, thousands of lawsuits in the USA, insolvency of companies due to claims for compensation and unambiguous warnings from foreign urological societies leave German urogynecologists still unimpressed. The existing literature in pelvic organ prolapse exclusively focusses on POP stage and improvement of that stage with surgical therapy. Instead, typical prolapse symptoms should trigger therapy and improvement of these symptoms should be the utmost treatment goal. It is strongly recommended for liability reasons to obtain specific written informed consent.
Choi, Michael K.
2015-01-01
The MLA and IFA of the instrument on the IceCube require a 20 C temperature and a thermal stability of +/-1 C. The thermal environment of the ISS orbit for the IceCube is very unstable due to solar beta angles in the -75deg to +75deg range. Additionally the instrument is powered off in every eclipse to conserve electrical power. These two factors cause thermal instability to the MLA and IFA. This paper presents a thermal design of using mini paraffin PCM packs to meet the thermal requirements of these instrument components. With a 31 g mass plus a 30% margin of n-hexadecane, the MLA and IFA are powered on for 32.3 minutes in sunlight at a 0deg beta angle to melt the paraffin. The powered-on time increases to 38 minutes at a 75deg (+/-) beta angle. When the MLA and IFA are powered off, the paraffin freezes.
Frolov, A. A.; Húsek, Dušan; Muraviev, I. P.; Polyakov, P.Y.
2010-01-01
Roč. 73, č. 7-9 (2010), s. 1394-1404 ISSN 0925-2312 R&D Projects: GA ČR GA205/09/1079; GA MŠk(CZ) 1M0567 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * Hopfield neural Network * unsupervised learning * dimension reduction * data mining Subject RIV: IN - Informatics, Computer Science Impact factor: 1.429, year: 2010
Fire performance of basalt FRP mesh reinforced HPC thin plates
Hulin, Thomas; Hodicky, Kamil; Schmidt, Jacob Wittrup
2013-01-01
An experimental program was carried out to investigate the influence of basalt FRP (BFRP) reinforcing mesh on the fire behaviour of thin high performance concrete (HPC) plates applied to sandwich elements. Samples with BFRP mesh were compared to samples with no mesh, samples with steel mesh...
Zhu, Zheng; Andresen, Juan Carlos; Janzen, Katharina; Katzgraber, Helmut G.
2013-03-01
We study the equilibrium and nonequilibrium properties of Boolean decision problems with competing interactions on scale-free graphs in a magnetic field. Previous studies at zero field have shown a remarkable equilibrium stability of Boolean variables (Ising spins) with competing interactions (spin glasses) on scale-free networks. When the exponent that describes the power-law decay of the connectivity of the network is strictly larger than 3, the system undergoes a spin-glass transition. However, when the exponent is equal to or less than 3, the glass phase is stable for all temperatures. First we perform finite-temperature Monte Carlo simulations in a field to test the robustness of the spin-glass phase and show, in agreement with analytical calculations, that the system exhibits a de Almeida-Thouless line. Furthermore, we study avalanches in the system at zero temperature to see if the system displays self-organized criticality. This would suggest that damage (avalanches) can spread across the whole system with nonzero probability, i.e., that Boolean decision problems on scale-free networks with competing interactions are fragile when not in thermal equilibrium.
Zhu, Zheng; Andresen, Juan Carlos; Moore, M. A.; Katzgraber, Helmut G.
2014-02-01
We study the equilibrium and nonequilibrium properties of Boolean decision problems with competing interactions on scale-free networks in an external bias (magnetic field). Previous studies at zero field have shown a remarkable equilibrium stability of Boolean variables (Ising spins) with competing interactions (spin glasses) on scale-free networks. When the exponent that describes the power-law decay of the connectivity of the network is strictly larger than 3, the system undergoes a spin-glass transition. However, when the exponent is equal to or less than 3, the glass phase is stable for all temperatures. First, we perform finite-temperature Monte Carlo simulations in a field to test the robustness of the spin-glass phase and show that the system has a spin-glass phase in a field, i.e., exhibits a de Almeida-Thouless line. Furthermore, we study avalanche distributions when the system is driven by a field at zero temperature to test if the system displays self-organized criticality. Numerical results suggest that avalanches (damage) can spread across the whole system with nonzero probability when the decay exponent of the interaction degree is less than or equal to 2, i.e., that Boolean decision problems on scale-free networks with competing interactions can be fragile when not in thermal equilibrium.
Johnson, Michael
2015-04-01
iCubeSat, the Interplanetary CubeSat Workshop, is an annual technical workshop for researchers working on an exciting new standardised platform and opportunity for planetary and space scientists. The first workshop was held in 2012 at MIT, 2013 at Cornell, 2014 at Caltech with the 2015 workshop scheduled to take place on the 26-27th May 2015 at Imperial College London. Mission concepts and flight projects presented since 2012 have included orbiters and landers targeting asteroids, the moon, Mars, Venus, Saturn and their satellites to perform science traditionally reserved for flagship missions at a fraction of their cost. Some of the first missions proposed are currently being readied for flight in Europe, taking advantage of multiple ride share launch opportunities and technology providers. A review of these and other interplanetary CubeSat projects will be presented, covering details of their science objectives, instrument capabilities, technology, team composition, budget, funding sources, and the other programattic elements required to implement this potentially revolutionary new class of mission.
Prolapse Recurrence after Transvaginal Mesh Removal.
Rawlings, Tanner; Lavelle, Rebecca S; Coskun, Burhan; Alhalabi, Feras; Zimmern, Philippe E
2015-11-01
We determined the rate of pelvic organ prolapse recurrence after transvaginal mesh removal. Following institutional review board approval a longitudinally collected database of women undergoing transvaginal mesh removal for complications after transvaginal mesh placement with at least 1 year minimum followup was queried for pelvic organ prolapse recurrence. Recurrent prolapse was defined as greater than stage 1 on examination or the need for reoperation at the site of transvaginal mesh removal. Outcome measures were based on POP-Q (Pelvic Organ Prolapse Quantification System) at the last visit. Patients were grouped into 3 groups, including group 1--recurrent prolapse in the same compartment as transvaginal mesh removal, 2--persistent prolapse and 3--prolapse in a compartment different than transvaginal mesh removal. Of 73 women 52 met study inclusion criteria from 2007 to 2013, including 73% who presented with multiple indications for transvaginal mesh removal. The mean interval between insertion and removal was 45 months (range 10 to 165). Overall mean followup after transvaginal mesh removal was 30 months (range 12 to 84). In group 1 (recurrent prolapse) the rate was 15% (6 of 40 patients). Four women underwent surgery for recurrent prolapse at a mean 7 of months (range 5 to 10). Two patients elected observation. The rate of persistent prolapse (group 2) was 23% (12 of 52 patients). Three women underwent prolapse reoperation at a mean of 10 months (range 8 to 12). In group 3 (de novo/different compartment prolapse) the rate was 6% (3 of 52 patients). One woman underwent surgical repair at 52 months. At a mean 2.5-year followup 62% of patients (32 of 52) did not have recurrent or persistent prolapse after transvaginal mesh removal and 85% (44 of 52) did not undergo any further procedure for prolapse. Specifically for pelvic organ prolapse in the same compartment as transvaginal mesh removal 12% of patients had recurrence, of whom 8% underwent prolapse repair
Feature-Sensitive Tetrahedral Mesh Generation with Guaranteed Quality
Wang, Jun; Yu, Zeyun
2012-01-01
Tetrahedral meshes are being extensively used in finite element methods (FEM). This paper proposes an algorithm to generate feature-sensitive and high-quality tetrahedral meshes from an arbitrary surface mesh model. A top-down octree subdivision is conducted on the surface mesh and a set of tetrahedra are constructed using adaptive body-centered cubic (BCC) lattices. Special treatments are given to the tetrahedra near the surface such that the quality of the resulting tetrahedral mesh is prov...
Proposal for nanoscale cascaded plasmonic majority gates for non-Boolean computation.
Dutta, Sourav; Zografos, Odysseas; Gurunarayanan, Surya; Radu, Iuliana; Soree, Bart; Catthoor, Francky; Naeemi, Azad
2017-12-19
Surface-plasmon-polariton waves propagating at the interface between a metal and a dielectric, hold the key to future high-bandwidth, dense on-chip integrated logic circuits overcoming the diffraction limitation of photonics. While recent advances in plasmonic logic have witnessed the demonstration of basic and universal logic gates, these CMOS oriented digital logic gates cannot fully utilize the expressive power of this novel technology. Here, we aim at unraveling the true potential of plasmonics by exploiting an enhanced native functionality - the majority voter. Contrary to the state-of-the-art plasmonic logic devices, we use the phase of the wave instead of the intensity as the state or computational variable. We propose and demonstrate, via numerical simulations, a comprehensive scheme for building a nanoscale cascadable plasmonic majority logic gate along with a novel referencing scheme that can directly translate the information encoded in the amplitude and phase of the wave into electric field intensity at the output. Our MIM-based 3-input majority gate displays a highly improved overall area of only 0.636 μm 2 for a single-stage compared with previous works on plasmonic logic. The proposed device demonstrates non-Boolean computational capability and can find direct utility in highly parallel real-time signal processing applications like pattern recognition.
Damage Spreading in Spatial and Small-world Random Boolean Networks
Lu, Qiming [Fermilab; Teuscher, Christof [Portland State U.
2014-02-18
The study of the response of complex dynamical social, biological, or technological networks to external perturbations has numerous applications. Random Boolean Networks (RBNs) are commonly used a simple generic model for certain dynamics of complex systems. Traditionally, RBNs are interconnected randomly and without considering any spatial extension and arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, power-law, small-world, or other non-random connections. Here we explore the RBN network topology between extreme local connections, random small-world, and pure random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the relevant component at very low connectivities ($\\bar{K} \\ll 1$) and that the critical connectivity of stability $K_s$ changes compared to random networks. At higher $\\bar{K}$, this scaling remains unchanged. We also show that the relevant component of spatially local networks scales with a power-law as the system size N increases, but with a different exponent for local and small-world networks. The scaling behaviors are obtained by finite-size scaling. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key design trade-offs between damage spreading (robustness), the network's wiring cost, and the network's communication characteristics.
An Improvement to a Multi-Client Searchable Encryption Scheme for Boolean Queries.
Jiang, Han; Li, Xue; Xu, Qiuliang
2016-12-01
The migration of e-health systems to the cloud computing brings huge benefits, as same as some security risks. Searchable Encryption(SE) is a cryptography encryption scheme that can protect the confidentiality of data and utilize the encrypted data at the same time. The SE scheme proposed by Cash et al. in Crypto2013 and its follow-up work in CCS2013 are most practical SE Scheme that support Boolean queries at present. In their scheme, the data user has to generate the search tokens by the counter number one by one and interact with server repeatedly, until he meets the correct one, or goes through plenty of tokens to illustrate that there is no search result. In this paper, we make an improvement to their scheme. We allow server to send back some information and help the user to generate exact search token in the search phase. In our scheme, there are only two round interaction between server and user, and the search token has [Formula: see text] elements, where n is the keywords number in query expression, and [Formula: see text] is the minimum documents number that contains one of keyword in query expression, and the computation cost of server is [Formula: see text] modular exponentiation operation.
Efficient Multi-Valued Bounded Model Checking for LTL over Quasi-Boolean Algebras
Andrade, Jefferson O.; Kameyama, Yukiyoshi
Multi-valued Model Checking extends classical, two-valued model checking to multi-valued logic such as Quasi-Boolean logic. The added expressivity is useful in dealing with such concepts as incompleteness and uncertainty in target systems, while it comes with the cost of time and space. Chechik and others proposed an efficient reduction from multi-valued model checking problems to two-valued ones, but to the authors' knowledge, no study was done for multi-valued bounded model checking. In this paper, we propose a novel, efficient algorithm for multi-valued bounded model checking. A notable feature of our algorithm is that it is not based on reduction of multi-values into two-values; instead, it generates a single formula which represents multi-valuedness by a suitable encoding, and asks a standard SAT solver to check its satisfiability. Our experimental results show a significant improvement in the number of variables and clauses and also in execution time compared with the reduction-based one.
The boolean algebra with restricted variables as a tool for fault tree modularization
Caldarola, L.; Wickenhaeuser, A.
1981-08-01
The number of minimal cut sets (m.c.s.) of very complex and highly interconnected fault trees can become extremely large (e.g. more than 10 7 ). In this case the usual analytical approach of dissecting the fault tree TOP variable into m.c.s. is not only computationally prohibitively expensive, but also meaningless because it does not offer any synthetic overview of system behavior. The method proposed in this paper overcomes the deficiencies of the analytical method. It is shown that, by applying boolean algebra with restricted variables (b.a.w.r.v.), the concept of fault tree modularization can be straightforwardly extended from a single gate to a set of gates. Thus, large fault trees are divided into smaller fault trees (modules), which are connected to each other according to a simple scheme. This scheme is represented by a block diagram in which each block is a module. The modules are analyzed separately by the m.c.s. method, and the results are combined according of the TOP event. The method allows the calculation of very large fault trees in a short time and offers a synthetic overview of systems behavior through the block diagram. Numerical examples are also included. Calculations have been carried out by using the computer code MUSTAMO, which is based on the theory developed in this paper. (orig.) [de
Attractor controllability of Boolean networks by flipping a subset of their nodes
Rafimanzelat, Mohammad Reza; Bahrami, Fariba
2018-04-01
The controllability analysis of Boolean networks (BNs), as models of biomolecular regulatory networks, has drawn the attention of researchers in recent years. In this paper, we aim at governing the steady-state behavior of BNs using an intervention method which can easily be applied to most real system, which can be modeled as BNs, particularly to biomolecular regulatory networks. To this end, we introduce the concept of attractor controllability of a BN by flipping a subset of its nodes, as the possibility of making a BN converge from any of its attractors to any other one, by one-time flipping members of a subset of BN nodes. Our approach is based on the algebraic state-space representation of BNs using semi-tensor product of matrices. After introducing some new matrix tools, we use them to derive necessary and sufficient conditions for the attractor controllability of BNs. A forward search algorithm is then suggested to identify the minimal perturbation set for attractor controllability of a BN. Next, a lower bound is derived for the cardinality of this set. Two new indices are also proposed for quantifying the attractor controllability of a BN and the influence of each network variable on the attractor controllability of the network and the relationship between them is revealed. Finally, we confirm the efficiency of the proposed approach by applying it to the BN models of some real biomolecular networks.
Prescribed burning impact on forest soil properties--a Fuzzy Boolean Nets approach.
Castro, Ana C Meira; Paulo Carvalho, Joao; Ribeiro, S
2011-02-01
The Portuguese northern forests are often and severely affected by wildfires during the Summer season. These occurrences significantly affect and negatively impact all ecosystems, namely soil, fauna and flora. In order to reduce the occurrences of natural wildfires, some measures to control the availability of fuel mass are regularly implemented. Those preventive actions concern mainly prescribed burnings and vegetation pruning. This work reports on the impact of a prescribed burning on several forest soil properties, namely pH, soil moisture, organic matter content and iron content, by monitoring the soil self-recovery capabilities during a one year span. The experiments were carried out in soil cover over a natural site of Andaluzitic schist, in Gramelas, Caminha, Portugal, which was kept intact from prescribed burnings during a period of four years. Soil samples were collected from five plots at three different layers (0-3, 3-6 and 6-18) 1 day before prescribed fire and at regular intervals after the prescribed fire. This paper presents an approach where Fuzzy Boolean Nets (FBN) and Fuzzy reasoning are used to extract qualitative knowledge regarding the effect of prescribed fire burning on soil properties. FBN were chosen due to the scarcity on available quantitative data. The results showed that soil properties were affected by prescribed burning practice and were unable to recover their initial values after one year. Copyright © 2010 Elsevier Inc. All rights reserved.
Roth, Ted M; Reight, Ian
2012-07-01
Sacral colpopexy may be complicated by mesh exposure, and the surgical treatment of mesh exposure typically results in minor postoperative morbidity and few delayed complications. A 75-year-old woman presented 7 years after a laparoscopic sacral colpopexy, with Mersilene mesh, with an apical mesh exposure. She underwent an uncomplicated transvaginal excision and was asymptomatic until 8 months later when she presented with vaginal drainage and a sacral abscess. This was successfully treated with laparoscopic enterolysis, drainage of the abscess, and explantation of the remaining mesh. Incomplete excision of exposed colpopexy mesh can lead to ascending infection and sacral abscess. Laparoscopic drainage and mesh removal may be considered in these patients.
IceCube-Gen2: A Vision for the Future of Neutrino Astronomy in Antarctica
Collaboration, IceCube-Gen2; :; Aartsen, M. G.; Ackermann, M.; Adams, J.; Aguilar, J. A.; Ahlers, M.; Ahrens, M.; Altmann, D.; Anderson, T.; Anton, G.; Arguelles, C.; Arlen, T. C.; Auffenberg, J.; Axani, S.
2014-01-01
The recent observation by the IceCube neutrino observatory of an astrophysical flux of neutrinos represents the "first light" in the nascent field of neutrino astronomy. The observed diffuse neutrino flux seems to suggest a much larger level of hadronic activity in the non-thermal universe than previously thought and suggests a rich discovery potential for a larger neutrino observatory. This document presents a vision for an substantial expansion of the current IceCube detector, IceCube-Gen2,...
IceCube-Gen2: A Vision for the Future of Neutrino Astronomy in Antarctica
Aartsen, M. G.; Ackermann, M.; Arlen, T. C.; Gretskov, P.; Groh, J. C.; Gross, A.; Ha, C.; Haack, C.; Ismail, A. Haj; Hallen, P.; Hallgren, A.; Halzen, F.; Hanson, K.; Auffenberg, J.; Haugen, J.
2014-01-01
The recent observation by the IceCube neutrino observatory of an astrophysical flux of neutrinos represents the 'first light' in the nascent field of neutrino astronomy. The observed diffuse neutrino flux seems to suggest a much larger level of hadronic activity in the non-thermal universe than previously thought and suggests a rich discovery potential for a larger neutrino observatory. This document presents a vision for an substantial expansion of the current IceCube detector, IceCube-Gen2,...
NPS-SCAT: A CubeSat Communications System Design, Test, and Integration
2009-06-01
markets the system as a CubeSat Kit. Microhard Systems Inc. manufactures products that are complementary to the Pumpkin structure and the FM430 Flight...NPS CubeSats and leverage COTS technology during that process. With that philosophy in mind, the program chose the Pumpkin Inc. 1U CubeSat...Skeletonized Structure and the FM430 Flight Module that is already integrated within the Pumpkin structure ( Pumpkin Incorporated, 2005, p. 2). Pumpkin
Ridgeway, Beri; Walters, Mark D; Paraiso, Marie Fidela R; Barber, Matthew D; McAchran, Sarah E; Goldman, Howard B; Jelovsek, J Eric
2008-12-01
The purpose of this study was to determine the complications, treatments, and outcomes in patients choosing to undergo removal of mesh previously placed with a mesh procedural kit. This was a retrospective review of all patients who underwent surgical removal of transvaginal mesh for mesh-related complications during a 3-year period at Cleveland Clinic. At last follow-up, patients reported degree of pain, level of improvement, sexual activity, and continued symptoms. Nineteen patients underwent removal of mesh during the study period. Indications for removal included chronic pain (6/19), dyspareunia (6/19), recurrent pelvic organ prolapse (8/19), mesh erosion (12/19), and vesicovaginal fistula (3/19), with most patients (16/19) citing more than 1 reason. There were few complications related to the mesh removal. Most patients reported significant relief of symptoms. Mesh removal can be technically difficult but appears to be safe with few complications and high relief of symptoms, although some symptoms can persist.
DRG-Based CubeSat Inertial Reference Unit (DCIRU), Phase II
National Aeronautics and Space Administration — CubeSats currently lack adequate inertial attitude knowledge and control required for future sophisticated science missions. Boeing's Disc Resonator Gyro (DRG)...
Expert cube development with SQL server analysis services 2012 multidimensional models
Ferrari, Alberto; Russo, Marco
2014-01-01
An easy-to-follow guide full of hands on examples of real-world Analysis Services cube development tasks. Each topic is explained and placed in context, and for the more inquisitive reader, there also more in-depth details of the concepts used.If you are an Analysis Services cube designer wishing to learn more advanced topic and best practices for cube design, this book is for you.You are expected to have some prior experience with Analysis Services cube development.
Cartesian anisotropic mesh adaptation for compressible flow
Keats, W.A.; Lien, F.-S.
2004-01-01
Simulating transient compressible flows involving shock waves presents challenges to the CFD practitioner in terms of the mesh quality required to resolve discontinuities and prevent smearing. This paper discusses a novel two-dimensional Cartesian anisotropic mesh adaptation technique implemented for compressible flow. This technique, developed for laminar flow by Ham, Lien and Strong, is efficient because it refines and coarsens cells using criteria that consider the solution in each of the cardinal directions separately. In this paper the method will be applied to compressible flow. The procedure shows promise in its ability to deliver good quality solutions while achieving computational savings. The convection scheme used is the Advective Upstream Splitting Method (Plus), and the refinement/ coarsening criteria are based on work done by Ham et al. Transient shock wave diffraction over a backward step and shock reflection over a forward step are considered as test cases because they demonstrate that the quality of the solution can be maintained as the mesh is refined and coarsened in time. The data structure is explained in relation to the computational mesh, and the object-oriented design and implementation of the code is presented. Refinement and coarsening algorithms are outlined. Computational savings over uniform and isotropic mesh approaches are shown to be significant. (author)
Mesh networks: an optimum solution for AMR
Mimno, G.
2003-12-01
Characteristics of mesh networks and the advantage of using them in automatic meter reading equipment (AMR) are discussed. Mesh networks are defined as being similar to a fishing net made of knots and links. In mesh networks the knots represent meter sites and the links are the radio paths between the meter sites and the neighbourhood concentrator. In mesh networks any knot in the communications chain can link to any other and the optimum path is calculated by the network by hopping from meter to meter until the radio message reaches a concentrator. This mesh communications architecture is said to be vastly superior to many older types of radio-based meter reading technologies; its main advantage is that it not only significantly improves the economics of fixed network deployment, but also supports time-of-use metering, remote disconnect services and advanced features, such as real-time pricing, demand response, and other efficiency measures, providing a better return on investment and reliability.
Mellano, Erin M; Nakamura, Leah Y; Choi, Judy M; Kang, Diana C; Grisales, Tamara; Raz, Shlomo; Rodriguez, Larissa V
2016-01-01
Vaginal mesh complications necessitating excision are increasingly prevalent. We aim to study whether subclinical chronically infected mesh contributes to the development of delayed-onset mesh complications or recurrent urinary tract infections (UTIs). Women undergoing mesh removal from August 2013 through May 2014 were identified by surgical code for vaginal mesh removal. Only women undergoing removal of anti-incontinence mesh were included. Exclusion criteria included any women undergoing simultaneous prolapse mesh removal. We abstracted preoperative and postoperative information from the medical record and compared mesh culture results from patients with and without mesh extrusion, de novo recurrent UTIs, and delayed-onset pain. One hundred seven women with only anti-incontinence mesh removed were included in the analysis. Onset of complications after mesh placement was within the first 6 months in 70 (65%) of 107 and delayed (≥6 months) in 37 (35%) of 107. A positive culture from the explanted mesh was obtained from 82 (77%) of 107 patients, and 40 (37%) of 107 were positive with potential pathogens. There were no significant differences in culture results when comparing patients with delayed-onset versus immediate pain, extrusion with no extrusion, and de novo recurrent UTIs with no infections. In this large cohort of patients with mesh removed for a diverse array of complications, cultures of the explanted vaginal mesh demonstrate frequent low-density bacterial colonization. We found no differences in culture results from women with delayed-onset pain versus acute pain, vaginal mesh extrusions versus no extrusions, or recurrent UTIs using standard culture methods. Chronic prosthetic infections in other areas of medicine are associated with bacterial biofilms, which are resistant to typical culture techniques. Further studies using culture-independent methods are needed to investigate the potential role of chronic bacterial infections in delayed vaginal mesh
Hydration of magnesia cubes: a helium ion microscopy study
Ruth Schwaiger
2016-02-01
Full Text Available Physisorbed water originating from exposure to the ambient can have a strong impact on the structure and chemistry of oxide nanomaterials. The effect can be particularly pronounced when these oxides are in physical contact with a solid substrate such as the ones used for immobilization to perform electron or ion microscopy imaging. We used helium ion microscopy (HIM and investigated morphological changes of vapor-phase-grown MgO cubes after vacuum annealing and pressing into foils of soft and high purity indium. The indium foils were either used as obtained or, for reference, subjected to vacuum drying. After four days of storage in the vacuum chamber of the microscope and at a base pressure of p −7 mbar, we observed on these cubic particles the attack of residual physisorbed water molecules from the indium substrate. As a result, thin magnesium hydroxide layers spontaneously grew, giving rise to characteristic volume expansion effects, which depended on the size of the particles. Rounding of the originally sharp cube edges leads to a significant loss of the morphological definition specific to the MgO cubes. Comparison of different regions within one sample before and after exposure to liquid water reveals different transformation processes, such as the formation of Mg(OH2 shells that act as diffusion barriers for MgO dissolution or the evolution of brucite nanosheets organized in characteristic flower-like microstructures. The findings underline the significant metastability of nanomaterials under both ambient and high-vacuum conditions and show the dramatic effect of ubiquitous water films during storage and characterization of oxide nanomaterials.
Artificial neural network model of pork meat cubes osmotic dehydration
Pezo, Lato L.; Ćurčić, Biljana Lj.; Filipović, Vladimir S.; Nićetin, Milica R.; Koprivica, Gordana B.; Mišljenović, Nevena M.; Lević, Ljubinko B.
2013-01-01
Mass transfer of pork meat cubes (M. triceps brachii), shaped as 1x1x1 cm, during osmotic dehydration (OD) and under atmospheric pressure was investigated in this paper. The effects of different parameters, such as concentration of sugar beet molasses (60-80%, w/w), temperature (20-50ºC), and immersion time (1-5 h) in terms of water loss (WL), solid gain (SG), final dry matter content (DM), and water activity (aw), were investigated using experimental results. Five artificial neural net...
A vision for, and progress towards EarthCube
Jacobs, C.
2012-04-01
The National Science Foundation (NSF), a US government agency, seeks to transform the conduct of research in geosciences by supporting innovative approaches to community-created cyberinfrastructure that integrates knowledge management across the Geosciences. Within the NSF organization, the Geosciences Directorate (GEO) and the Office of Cyberinfrastructure (OCI) are partnering to address the multifaceted challenges of modern, data-intensive science and education. NSF encourages the community to envision and create an environment where low adoption thresholds and new capabilities act together to greatly increase the productivity and capability of researchers and educators working at the frontiers of Earth system science. This initiative is EarthCube. NSF believes the geosciences community is well positioned to plan and prototype transformative approaches that use innovative technologies to integrate and make interoperable vast resources of heterogeneous data and knowledge within a knowledge management framework. This believe is founded on tsunami of technology development and application that has and continues to engulf science and investments geosciences has made in cyberinfrastructure (CI) to take advantage the technological developments. However, no master framework for geosciences was employed in the development of technology-enable capabilities required by various geosciences communities. It is time to develop an open, adaptable and sustainable framework (an "EarthCube") to enable transformative research and education of Earth system. This will involve, but limited to fostering common data models and data-focused methodologies; developing next generation search and data tools; and advancing application software to integrate data from various sources to expand the frontiers of knowledge. Also, NSF looks to the community to develop a robust and balanced paradigm to manage a collaborative effort and build community support. Such a paradigm must engage a diverse
Development of EarthCube Governance: An Agile Approach
Pearthree, G.; Allison, M. L.; Patten, K.
2013-12-01
Governance of geosciences cyberinfrastructure is a complex and essential undertaking, critical in enabling distributed knowledge communities to collaborate and communicate across disciplines, distances, and cultures. Advancing science with respect to 'grand challenges," such as global climate change, weather prediction, and core fundamental science, depends not just on technical cyber systems, but also on social systems for strategic planning, decision-making, project management, learning, teaching, and building a community of practice. Simply put, a robust, agile technical system depends on an equally robust and agile social system. Cyberinfrastructure development is wrapped in social, organizational and governance challenges, which may significantly impede progress. An agile development process is underway for governance of transformative investments in geosciences cyberinfrastructure through the NSF EarthCube initiative. Agile development is iterative and incremental, and promotes adaptive planning and rapid and flexible response. Such iterative deployment across a variety of EarthCube stakeholders encourages transparency, consensus, accountability, and inclusiveness. A project Secretariat acts as the coordinating body, carrying out duties for planning, organizing, communicating, and reporting. A broad coalition of stakeholder groups comprises an Assembly (Mainstream Scientists, Cyberinfrastructure Institutions, Information Technology/Computer Sciences, NSF EarthCube Investigators, Science Communities, EarthCube End-User Workshop Organizers, Professional Societies) to serve as a preliminary venue for identifying, evaluating, and testing potential governance models. To offer opportunity for broader end-user input, a crowd-source approach will engage stakeholders not involved otherwise. An Advisory Committee from the Earth, ocean, atmosphere, social, computer and library sciences is guiding the process from a high-level policy point of view. Developmental
Annotated trajectories and the Space-Time-Cube
Kveladze, Irma; Kraak, Menno-Jan
2012-01-01
too, because these have not been adopted to the purpose. A suitable solution to display and study movements is the Space-Time-Cube (STC), the graphic representation of Hägerstrand’s Time Geography. This paper answers the question of how suitable the STC is to display the above describe combination...... of trajectories and annotations to avoid the visual clutter. Although the STC will be described here as a stand-alone solution it is part of a wider geovisual analytics environment and is used next to maps and other graphics to be able to answer user questions. As a case study data set the travel log data...
Report and analysis of S-cube. Super science seminar
Isogai, Kentaro; Yasuhara, Yuko
2004-04-01
At the ITBL Promotion Office, the science seminar (S-cube: Super Science Seminar) which was held for the first time on Wed., October 30, 2002 has been held more than 50 times. Lectures have been invited from many universities and research organizations. Seminars have been held which are of interest to junior high school students and high school students. In this article, in addition to introducing the seminars that have been held, attention is paid to the theme of the seminars, and what management considerations are necessary in order to increase participants in the future. (author)
Connectivity editing for quad-dominant meshes
Peng, Chihan
2013-08-01
We propose a connectivity editing framework for quad-dominant meshes. In our framework, the user can edit the mesh connectivity to control the location, type, and number of irregular vertices (with more or fewer than four neighbors) and irregular faces (non-quads). We provide a theoretical analysis of the problem, discuss what edits are possible and impossible, and describe how to implement an editing framework that realizes all possible editing operations. In the results, we show example edits and illustrate the advantages and disadvantages of different strategies for quad-dominant mesh design. © 2013 The Author(s) Computer Graphics Forum © 2013 The Eurographics Association and John Wiley & Sons Ltd.
ZONE: a finite element mesh generator
Burger, M.J.
1976-05-01
The ZONE computer program is a finite-element mesh generator which produces the nodes and element description of any two-dimensional geometry. The geometry is subdivided into a mesh of quadrilateral and triangular zones arranged sequentially in an ordered march through the geometry. The order of march can be chosen so that the minimum bandwidth is obtained. The node points are defined in terms of the x and y coordinates in a global rectangular coordinate system. The zones generated are quadrilaterals or triangles defined by four node points in a counterclockwise sequence. Node points defining the outside boundary are generated to describe pressure boundary conditions. The mesh that is generated can be used as input to any two-dimensional as well as any axisymmetrical structure program. The output from ZONE is essentially the input file to NAOS, HONDO, and other axisymmetric finite element programs. 14 figures
Open preperitoneal groin hernia repair with mesh
Andresen, Kristoffer; Rosenberg, Jacob
2017-01-01
Background For the repair of inguinal hernias, several surgical methods have been presented where the purpose is to place a mesh in the preperitoneal plane through an open access. The aim of this systematic review was to describe preperitoneal repairs with emphasis on the technique. Data sources...... A systematic review was conducted and reported according to the PRISMA statement. PubMed, Cochrane library and Embase were searched systematically. Studies were included if they provided clinical data with more than 30 days follow up following repair of an inguinal hernia with an open preperitoneal mesh......-analysis. Open preperitoneal techniques with placement of a mesh through an open approach seem promising compared with the standard anterior techniques. This systematic review provides an overview of these techniques together with a description of surgical methods and clinical outcomes....
Open preperitoneal groin hernia repair with mesh
Andresen, Kristoffer; Rosenberg, Jacob
2017-01-01
BACKGROUND: For the repair of inguinal hernias, several surgical methods have been presented where the purpose is to place a mesh in the preperitoneal plane through an open access. The aim of this systematic review was to describe preperitoneal repairs with emphasis on the technique. DATA SOURCES......: A systematic review was conducted and reported according to the PRISMA statement. PubMed, Cochrane library and Embase were searched systematically. Studies were included if they provided clinical data with more than 30 days follow up following repair of an inguinal hernia with an open preperitoneal mesh......-analysis. Open preperitoneal techniques with placement of a mesh through an open approach seem promising compared with the standard anterior techniques. This systematic review provides an overview of these techniques together with a description of surgical methods and clinical outcomes....
EarthCube - A Community-led, Interdisciplinary Collaboration for Geoscience Cyberinfrastructure
Allison, M. L.; Keane, C. M.; Robinson, E.
2015-12-01
The EarthCube Test Enterprise Governance Project completed its initial two-year long process to engage the community and test a demonstration governing organization with the goal of facilitating a community-led process on designing and developing a geoscience cyberinfrastructure. Conclusions are that EarthCube is viable, has engaged a broad spectrum of end-users and contributors, and has begun to foster a sense of urgency around the importance of open and shared data. Levels of trust among participants are growing. At the same time, the active participants in EarthCube represent a very small sub-set of the larger population of geoscientists. Results from Stage I of this project have impacted NSF decisions on the direction of the EarthCube program. The overall tone of EarthCube events has had a constructive, problem-solving orientation. The technical and organizational elements of EarthCube are poised to support a functional infrastructure for the geosciences community. The process for establishing shared technological standards has notable progress but there is a continuing need to expand technological and cultural alignment. Increasing emphasis is being given to the interdependencies among EarthCube funded projects. The newly developed EarthCube Technology Plan highlights important progress in this area by five working groups focusing on: 1. Use cases; 2. Funded project gap analysis; 3. Testbed development; 4. Standards; and 5. Architecture. There is ample justification to continue running a community-led governance framework that facilitates agreement on a system architecture, guides EarthCube activities, and plays an increasing role in making the EarthCube vision of cyberinfrastructure for the geosciences operational. There is widespread community expectation for support of a multiyear EarthCube governing effort to put into practice the science, technical, and organizational plans that have and are continuing to emerge.
Unstructured Adaptive Meshes: Bad for Your Memory?
Biswas, Rupak; Feng, Hui-Yu; VanderWijngaart, Rob
2003-01-01
This viewgraph presentation explores the need for a NASA Advanced Supercomputing (NAS) parallel benchmark for problems with irregular dynamical memory access. This benchmark is important and necessary because: 1) Problems with localized error source benefit from adaptive nonuniform meshes; 2) Certain machines perform poorly on such problems; 3) Parallel implementation may provide further performance improvement but is difficult. Some examples of problems which use irregular dynamical memory access include: 1) Heat transfer problem; 2) Heat source term; 3) Spectral element method; 4) Base functions; 5) Elemental discrete equations; 6) Global discrete equations. Nonconforming Mesh and Mortar Element Method are covered in greater detail in this presentation.
Local adaptive mesh refinement for shock hydrodynamics
Berger, M.J.; Colella, P.; Lawrence Livermore Laboratory, Livermore, 94550 California)
1989-01-01
The aim of this work is the development of an automatic, adaptive mesh refinement strategy for solving hyperbolic conservation laws in two dimensions. There are two main difficulties in doing this. The first problem is due to the presence of discontinuities in the solution and the effect on them of discontinuities in the mesh. The second problem is how to organize the algorithm to minimize memory and CPU overhead. This is an important consideration and will continue to be important as more sophisticated algorithms that use data structures other than arrays are developed for use on vector and parallel computers. copyright 1989 Academic Press, Inc
Adaptive mesh refinement for storm surge
Mandli, Kyle T.; Dawson, Clint N.
2014-01-01
An approach to utilizing adaptive mesh refinement algorithms for storm surge modeling is proposed. Currently numerical models exist that can resolve the details of coastal regions but are often too costly to be run in an ensemble forecasting framework without significant computing resources. The application of adaptive mesh refinement algorithms substantially lowers the computational cost of a storm surge model run while retaining much of the desired coastal resolution. The approach presented is implemented in the GeoClaw framework and compared to ADCIRC for Hurricane Ike along with observed tide gauge data and the computational cost of each model run. © 2014 Elsevier Ltd.
MUSIC: a mesh-unrestricted simulation code
Bonalumi, R.A.; Rouben, B.; Dastur, A.R.; Dondale, C.S.; Li, H.Y.H.
1978-01-01
A general formalism to solve the G-group neutron diffusion equation is described. The G-group flux is represented by complementing an ''asymptotic'' mode with (G-1) ''transient'' modes. A particular reduction-to-one-group technique gives a high computational efficiency. MUSIC, a 2-group code using the above formalism, is presented. MUSIC is demonstrated on a fine-mesh calculation and on 2 coarse-mesh core calculations: a heavy-water reactor (HWR) problem and the 2-D lightwater reactor (LWR) IAEA benchmark. Comparison is made to finite-difference results
Adaptive mesh refinement for storm surge
Mandli, Kyle T.
2014-03-01
An approach to utilizing adaptive mesh refinement algorithms for storm surge modeling is proposed. Currently numerical models exist that can resolve the details of coastal regions but are often too costly to be run in an ensemble forecasting framework without significant computing resources. The application of adaptive mesh refinement algorithms substantially lowers the computational cost of a storm surge model run while retaining much of the desired coastal resolution. The approach presented is implemented in the GeoClaw framework and compared to ADCIRC for Hurricane Ike along with observed tide gauge data and the computational cost of each model run. © 2014 Elsevier Ltd.
Mesh removal following transvaginal mesh placement: a case series of 104 operations.
Marcus-Braun, Naama; von Theobald, Peter
2010-04-01
The objective of the study was to reveal the way we treat vaginal mesh complications in a trained referral center. This is a retrospective review of all patients who underwent surgical removal of transvaginal mesh for mesh-related complications during a 5-year period. Eighty-three patients underwent 104 operations including 61 complete mesh removal, 14 partial excision, 15 section of sub-urethral sling, and five laparoscopies. Main indications were erosion, infection, granuloma, incomplete voiding, and pain. Fifty-eight removals occurred more than 2 years after the primary mesh placement. Mean operation time was 21 min, and there were two intraoperative and ten minor postoperative complications. Stress urinary incontinence (SUI) recurred in 38% and cystocele in 19% of patients. In a trained center, mesh removal was found to be a quick and safe procedure. Mesh-related complications may frequently occur more than 2 years after the primary operation. Recurrence was mostly associated with SUI and less with genital prolapse.
Neutral space analysis for a Boolean network model of the fission yeast cell cycle network
Gonzalo A Ruz
2014-01-01
Full Text Available BACKGROUND: Interactions between genes and their products give rise to complex circuits known as gene regulatory networks (GRN that enable cells to process information and respond to external stimuli. Several important processes for life, depend of an accurate and context-specific regulation of gene expression, such as the cell cycle, which can be analyzed through its GRN, where deregulation can lead to cancer in animals or a directed regulation could be applied for biotechnological processes using yeast. An approach to study the robustness of GRN is through the neutral space. In this paper, we explore the neutral space of a Schizosaccharomyces pombe (fission yeast cell cycle network through an evolution strategy to generate a neutral graph, composed of Boolean regulatory networks that share the same state sequences of the fission yeast cell cycle. RESULTS: Through simulations it was found that in the generated neutral graph, the functional networks that are not in the wildtype connected component have in general a Hamming distance more than 3 with the wildtype, and more than 10 between the other disconnected functional networks. Significant differences were found between the functional networks in the connected component of the wildtype network and the rest of the network, not only at a topological level, but also at the state space level, where significant differences in the distribution of the basin of attraction for the G1 fixed point was found for deterministic updating schemes. CONCLUSIONS: In general, functional networks in the wildtype network connected component, can mutate up to no more than 3 times, then they reach a point of no return where the networks leave the connected component of the wildtype. The proposed method to construct a neutral graph is general and can be used to explore the neutral space of other biologically interesting networks, and also formulate new biological hypotheses studying the functional networks in the
Coded diffraction system in X-ray crystallography using a boolean phase coded aperture approximation
Pinilla, Samuel; Poveda, Juan; Arguello, Henry
2018-03-01
Phase retrieval is a problem present in many applications such as optics, astronomical imaging, computational biology and X-ray crystallography. Recent work has shown that the phase can be better recovered when the acquisition architecture includes a coded aperture, which modulates the signal before diffraction, such that the underlying signal is recovered from coded diffraction patterns. Moreover, this type of modulation effect, before the diffraction operation, can be obtained using a phase coded aperture, just after the sample under study. However, a practical implementation of a phase coded aperture in an X-ray application is not feasible, because it is computationally modeled as a matrix with complex entries which requires changing the phase of the diffracted beams. In fact, changing the phase implies finding a material that allows to deviate the direction of an X-ray beam, which can considerably increase the implementation costs. Hence, this paper describes a low cost coded X-ray diffraction system based on block-unblock coded apertures that enables phase reconstruction. The proposed system approximates the phase coded aperture with a block-unblock coded aperture by using the detour-phase method. Moreover, the SAXS/WAXS X-ray crystallography software was used to simulate the diffraction patterns of a real crystal structure called Rhombic Dodecahedron. Additionally, several simulations were carried out to analyze the performance of block-unblock approximations in recovering the phase, using the simulated diffraction patterns. Furthermore, the quality of the reconstructions was measured in terms of the Peak Signal to Noise Ratio (PSNR). Results show that the performance of the block-unblock phase coded apertures approximation decreases at most 12.5% compared with the phase coded apertures. Moreover, the quality of the reconstructions using the boolean approximations is up to 2.5 dB of PSNR less with respect to the phase coded aperture reconstructions.
Pure transvaginal excision of mesh erosion involving the bladder.
Firoozi, Farzeen; Goldman, Howard B
2013-06-01
We present a pure transvaginal approach to the removal of eroded mesh involving the bladder secondary to placement of transvaginal mesh for management of pelvic organ prolapse (POP) using a mesh kit. Although technically challenging, we demonstrate the feasibility of a purely transvaginal approach, avoiding a potentially more morbid transabdominal approach. The video presents the surgical technique of pure transvaginal excision of mesh erosion involving the bladder after mesh placement using a prolapse kit was performed. This video shows that purely transvaginal removal of mesh erosion involving the bladder can be done safely and is feasible.
Seker, D; Oztuna, D; Kulacoglu, H; Genc, Y; Akcil, M
2013-04-01
Small mesh size has been recognized as one of the factors responsible for recurrence after Lichtenstein hernia repair due to insufficient coverage or mesh shrinkage. The Lichtenstein Hernia Institute recommends a 7 × 15 cm mesh that can be trimmed up to 2 cm from the lateral side. We performed a systematic review to determine surgeons' mesh size preference for the Lichtenstein hernia repair and made a meta-analysis to determine the effect of mesh size, mesh type, and length of follow-up time on recurrence. Two medical databases, PubMed and ISI Web of Science, were systematically searched using the key word "Lichtenstein repair." All full text papers were selected. Publications mentioning mesh size were brought for further analysis. A mesh surface area of 90 cm(2) was accepted as the threshold for defining the mesh as small or large. Also, a subgroup analysis for recurrence pooled proportion according to the mesh size, mesh type, and follow-up period was done. In total, 514 papers were obtained. There were no prospective or retrospective clinical studies comparing mesh size and clinical outcome. A total of 141 papers were duplicated in both databases. As a result, 373 papers were obtained. The full text was available in over 95 % of papers. Only 41 (11.2 %) papers discussed mesh size. In 29 studies, a mesh larger than 90 cm(2) was used. The most frequently preferred commercial mesh size was 7.5 × 15 cm. No papers mentioned the size of the mesh after trimming. There was no information about the relationship between mesh size and patient BMI. The pooled proportion in recurrence for small meshes was 0.0019 (95 % confidence interval: 0.007-0.0036), favoring large meshes to decrease the chance of recurrence. Recurrence becomes more marked when follow-up period is longer than 1 year (p < 0.001). Heavy meshes also decreased recurrence (p = 0.015). This systematic review demonstrates that the size of the mesh used in Lichtenstein hernia repair is rarely
Properties of meshes used in hernia repair: a comprehensive review of synthetic and biologic meshes.
Ibrahim, Ahmed M S; Vargas, Christina R; Colakoglu, Salih; Nguyen, John T; Lin, Samuel J; Lee, Bernard T
2015-02-01
Data on the mechanical properties of the adult human abdominal wall have been difficult to obtain rendering manufacture of the ideal mesh for ventral hernia repair a challenge. An ideal mesh would need to exhibit greater biomechanical strength and elasticity than that of the abdominal wall. The aim of this study is to quantitatively compare the biomechanical properties of the most commonly used synthetic and biologic meshes in ventral hernia repair and presents a comprehensive literature review. A narrative review of the literature was performed using the PubMed database spanning articles from 1982 to 2012 including a review of company Web sites to identify all available information relating to the biomechanical properties of various synthetic and biologic meshes used in ventral hernia repair. There exist differences in the mechanical properties and the chemical nature of different meshes. In general, most synthetic materials have greater stiffness and elasticity than what is required for abdominal wall reconstruction; however, each exhibits unique properties that may be beneficial for clinical use. On the contrary, biologic meshes are more elastic but less stiff and with a lower tensile strength than their synthetic counterparts. The current standard of practice for the treatment of ventral hernias is the use of permanent synthetic mesh material. Recently, biologic meshes have become more frequently used. Most meshes exhibit biomechanical properties over the known abdominal wall thresholds. Augmenting strength requires increasing amounts of material contributing to more stiffness and foreign body reaction, which is not necessarily an advantage. Thieme Medical Publishers 333 Seventh Avenue, New York, NY 10001, USA.
IceCube and GRB neutrinos propagating in quantum spacetime
Giovanni Amelino-Camelia
2016-10-01
Full Text Available Two recent publications have reported intriguing analyses, tentatively suggesting that some aspects of IceCube data might be manifestations of quantum-gravity-modified laws of propagation for neutrinos. We here propose a strategy of data analysis which has the advantage of being applicable to several alternative possibilities for the laws of propagation of neutrinos in a quantum spacetime. In all scenarios here of interest one should find a correlation between the energy of an observed neutrino and the difference between the time of observation of that neutrino and the trigger time of a GRB. We select accordingly some GRB-neutrino candidates among IceCube events, and our data analysis finds a rather strong such correlation. This sort of study naturally lends itself to the introduction of a “false alarm probability”, which for our analysis we estimate conservatively to be of 1%. We therefore argue that our findings should motivate a vigorous program of investigation following the strategy here advocated.
Searches for magnetic monopoles with IceCube
Pollmann, Anna
2018-01-01
Particles that carry a magnetic monopole charge are proposed by various theories which go beyond the Standard Model of particle physics. The expected mass of magnetic monopoles varies depending on the theory describing its origin, generally the monopole mass far exceeds those which can be created at accelerators. Magnetic monopoles gain kinetic energy in large scale galactic magnetic fields and, depending on their mass, can obtain relativistic velocities. IceCube is a high energy neutrino detector using the clear ice at the South Pole as a detection medium. As monopoles pass through this ice they produce optical light by a variety of mechanisms. With increasing velocity, they produce light by catalysis of baryon decay, luminescence in the ice associated with electronic excitations, indirect and direct Cherenkov light from the monopole track, and Cherenkov light from cascades induced by pair creation and photonuclear reactions. By searching for this light, current best limits for the monopole flux over a broad range of velocities was achieved using the IceCube detector. A review of these magnetic monopole searches is presented.
Artificial neural network model of pork meat cubes osmotic dehydratation
Pezo Lato L.
2013-01-01
Full Text Available Mass transfer of pork meat cubes (M. triceps brachii, shaped as 1x1x1 cm, during osmotic dehydration (OD and under atmospheric pressure was investigated in this paper. The effects of different parameters, such as concentration of sugar beet molasses (60-80%, w/w, temperature (20-50ºC, and immersion time (1-5 h in terms of water loss (WL, solid gain (SG, final dry matter content (DM, and water activity (aw, were investigated using experimental results. Five artificial neural network (ANN models were developed for the prediction of WL, SG, DM, and aw in OD of pork meat cubes. These models were able to predict process outputs with coefficient of determination, r2, of 0.990 for SG, 0.985 for WL, 0.986 for aw, and 0.992 for DM compared to experimental measurements. The wide range of processing variables considered for the formulation of these models, and their easy implementation in a spreadsheet calculus make it very useful and practical for process design and control.
HydroCube: an entity-relationship hydrogeological data model
Wojda, Piotr; Brouyère, Serge; Derouane, Johan; Dassargues, Alain
2010-12-01
Managing, handling and accessing hydrogeological information depends heavily on the applied hydrogeological data models, which differ between institutions and countries. The effective dissemination of hydrogeological information requires the convergence of such models to make hydrogeological information accessible to multiple users such as universities, water suppliers, and administration and research organisations. Furthermore, because hydrogeological studies are complex, they require a wide variety of high-quality hydrogeological data with appropriate metadata in clearly designed and coherent structures. A need exists, therefore, to develop and implement hydrogeological data models that cover, as much as possible, the full hydrogeological domain. A new data model, called HydroCube, was developed for the Walloon Region in Belgium in 2005. The HydroCube model presents an innovative holistic project-based approach which covers a full set of hydrogeological concepts and features, allowing for effective hydrogeological project management. The model stores data relating to the project locality, hydrogeological equipment, and related observations and measurements. In particular, it focuses on specialized hydrogeological field experiments such as pumping and tracer tests. This logical data model uses entity-relationship diagrams and it has been implemented in the Microsoft Access environment. It has been enriched with a fully functional user interface.
Percolation of overlapping squares or cubes on a lattice
Koza, Zbigniew; Kondrat, Grzegorz; Suszczyński, Karol
2014-01-01
Porous media are often modeled as systems of overlapping obstacles, which leads to the problem of two percolation thresholds in such systems, one for the porous matrix and the other for the void space. Here we investigate these percolation thresholds in the model of overlapping squares or cubes of linear size k > 1 randomly distributed on a regular lattice. We find that the percolation threshold of obstacles is a nonmonotonic function of k, whereas the percolation threshold of the void space is well approximated by a function linear in 1/k. We propose a generalization of the excluded volume approximation to discrete systems and use it to investigate the transition between continuous and discrete percolation, finding a remarkable agreement between the theory and numerical results. We argue that the continuous percolation threshold of aligned squares on a plane is the same for the solid and void phases and estimate the continuous percolation threshold of the void space around aligned cubes in a 3D space as 0.036(1). We also discuss the connection of the model to the standard site percolation with complex neighborhood. (paper)
Five schools visit CERN and IceCube virtually
Abha Eli Phoboo
2014-01-01
The ATLAS and CMS experiments hosted a virtual visit together with the IceCube Experiment in the South Pole for students from five different European schools on 2 October. The visit allowed the students to interact with researchers from both the LHC experiments and the IceCube experiment. The virtual visit was the second event in the Open Discovery Space project’s “Bringing Frontier Science to Schools” series. Angelos Alexopoulos and Steve Goldfarb connect with the schools. The 380 students and 14 teachers and education specialists who took part in the virtual visit were from the John Atanasoff Sofia Vocational High School of Electronics in Bulgaria, Ellinogermaniki Agogi school in Greece, Leo Baeck High School in Israel, Grigore Moisil National College in Romania and Svetozar Marković Grammar School in Serbia. “It was breathtaking and a great opportunity to have our questions answered by the researchers, also live via chat,” said Marco I...
IceCube: Particle Astrophysics with High Energy Neutrinos
Université de Genève
2012-01-01
GENEVA UNIVERSITY École de physique Département de physique nucléaire et corspusculaire 24, quai Ernest-Ansermet 1211 Genève 4 Tél.: (022) 379 62 73 Fax: (022) 379 69 92 Monday 7 May 2012 17h. - Ecole de Physique, Auditoire Stueckelberg IceCube: Particle Astrophysics with High Energy Neutrinos Prof. Francis Halzen / University of Wisconsin, Madison Construction and commissioning of the cubic-kilometer IceCube neutrino detector and its low energy extension DeepCore have been completed. The instrument detects neutrinos over a wide energy range: from 10 GeV atmospheric neutrinos to 1010 GeV cosmogenic neutrinos. We will discuss initial results based on a subsample of the ~100,000 neutrino events recorded during construction. We will emphasize the first measurement of the high-energy atmospheric neutrino spectrum, the search for the still enigmatic sources of the Galactic and extragalactic cosmic rays and for the particle nature of dark matter. Une ve...
The IceProd (IceCube Production) Framework
Díaz-Vélez, J C
2014-01-01
IceProd is a data processing and management framework developed by the IceCube Neutrino Observatory for processing of Monte Carlo simulations and data. IceProd runs as a separate layer on top of middleware or cluster job schedulers and can take advantage of a variety of computing resources including grids such as EGI, OSG, and NorduGrid as well as local clusters running batch systems like HT Condor, PBS, and SGE. This is accomplished by a set of dedicated daemons which process job submission in a coordinated fashion through the use of middleware plug-ins that serve to abstract the details of job submission and job management. IceProd can also manage complex workflow DAGs across distributed computing grids in order to optimize usage of resources. We describe several aspects of IceProd's design and it's applications in collaborative computing environments. We also briefly discuss design aspects of a second generation IceProd, currently being tested in IceCube.
Elastic Cube Actuator with Six Degrees of Freedom Output
Pengchuan Wang
2015-09-01
Full Text Available Unlike conventional rigid actuators, soft robotic technologies possess inherent compliance, so they can stretch and twist along every axis without the need for articulated joints. This compliance is exploited here using dielectric elastomer membranes to develop a novel six degrees of freedom (6-DOF polymer actuator that unifies ordinarily separate components into a simple cubic structure. This cube actuator design incorporates elastic dielectric elastomer membranes on four faces which are coupled by a cross-shaped end effector. The inherent elasticity of each membrane greatly reduces kinematic constraint and enables a 6-DOF actuation output to be produced via the end effector. An electro-mechanical model of the cube actuator is presented that captures the non-linear hyperelastic behaviour of the active membranes. It is demonstrated that the model accurately predicts actuator displacement and blocking moment for a range of input voltages. Experimental testing of a prototype 60 mm device demonstrates 6-DOF operation. The prototype produces maximum linear and rotational displacements of ±2.6 mm (±4.3% and ±4.8° respectively and a maximum blocking moment of ±76 mNm. The capacity for full 6-DOF actuation from a compact, readily scalable and easily fabricated polymeric package enables implementation in a range of mechatronics and robotics applications.
Highly Symmetric and Congruently Tiled Meshes for Shells and Domes
Rasheed, Muhibur; Bajaj, Chandrajit
2016-01-01
We describe the generation of all possible shell and dome shapes that can be uniquely meshed (tiled) using a single type of mesh face (tile), and following a single meshing (tiling) rule that governs the mesh (tile) arrangement with maximal vertex, edge and face symmetries. Such tiling arrangements or congruently tiled meshed shapes, are frequently found in chemical forms (fullerenes or Bucky balls, crystals, quasi-crystals, virus nano shells or capsids), and synthetic shapes (cages, sports domes, modern architectural facades). Congruently tiled meshes are both aesthetic and complete, as they support maximal mesh symmetries with minimal complexity and possess simple generation rules. Here, we generate congruent tilings and meshed shape layouts that satisfy these optimality conditions. Further, the congruent meshes are uniquely mappable to an almost regular 3D polyhedron (or its dual polyhedron) and which exhibits face-transitive (and edge-transitive) congruency with at most two types of vertices (each type transitive to the other). The family of all such congruently meshed polyhedra create a new class of meshed shapes, beyond the well-studied regular, semi-regular and quasi-regular classes, and their duals (platonic, Catalan and Johnson). While our new mesh class is infinite, we prove that there exists a unique mesh parametrization, where each member of the class can be represented by two integer lattice variables, and moreover efficiently constructable. PMID:27563368
Modelling elasticity in solids using active cubes - application to simulated operations
Bro-Nielsen, Morten
1995-01-01
The paper describes an approach to elastic modelling of human tissue based on the use of 3D solid active models-active cubes (M. Bro-Nielsen, 1994)-and a shape description based on the metric tensor in a solid. Active cubes are used because they provide a natural parameterization of the surface a...
Analysis of temperature stresses in concrete breakwater elements : Hollow cubes and Tetrapods
Nooru-Mohamed, M.B.
1994-01-01
In this report, the results of a numerical parameter study on temperature stresses caused by hydration of cement in concrete breakwater elements are shown. Two different geometries were analysed namely hollow cubes and tetrapods. The problem encountered in solid cube breakwaters is the undesirable
InterCUBE: a study into merging action and interaction spaces
Salem, B.I.; Peeters, H.; Baranauskas, C.; Palanque, P.
2007-01-01
We describe the development of a novel tangible interface we call the InterCUBE, a cube-shaped device with no external buttons or widgets. We study the implications of such a shape in terms of interactions, notably the degrees of freedom available and the manipulations possible. We also explain and
A discrete spherical X-ray transform of orientation distribution functions using bounding cubes
Kazantsev, Ivan G; Schmidt, Søren; Poulsen, Henning Friis
2009-01-01
We investigate a cubed sphere parametrization of orientation space with the aim of constructing a discrete voxelized version of the spherical x-ray transform. For tracing the propagation of a unit great circle through the partition subsets, the frustums of the cubed sphere, a fast procedure...
Stability of cube armoured roundheads exposed to long crested and short crested waves
Maciñeira, Enrique G.; Burcharth, Hans Falk
2016-01-01
Highlights •A formula to estimate armour damage in cube armoured roundheads is presented •Damage limits for design limit states are proposed......Highlights •A formula to estimate armour damage in cube armoured roundheads is presented •Damage limits for design limit states are proposed...
Smith, Harrison Brodsky; Hu, Steven Hung Kee; Cockrell, James J.
2013-01-01
Operators of a constellation of CubeSats have to confront a number of daunting challenges that can be cost prohibitive, or operationally prohibitive, to missions that could otherwise be enabled by a satellite constellation. Challenges including operations complexity, intersatellite communication, intersatellite navigation, and time sharing tasks between satellites are all complicated by operating with the usual CubeSat size, power, and budget constraints. EDSN pioneers innovative solutions to these problems as they are presented on the nano-scale satellite platform.
Markov Random Fields on Triangle Meshes
Andersen, Vedrana; Aanæs, Henrik; Bærentzen, Jakob Andreas
2010-01-01
In this paper we propose a novel anisotropic smoothing scheme based on Markov Random Fields (MRF). Our scheme is formulated as two coupled processes. A vertex process is used to smooth the mesh by displacing the vertices according to a MRF smoothness prior, while an independent edge process label...
Performance Evaluation of Coded Meshed Networks
Krigslund, Jeppe; Hansen, Jonas; Pedersen, Morten Videbæk
2013-01-01
of the former to enhance the gains of the latter. We first motivate our work through measurements in WiFi mesh networks. Later, we compare state-of-the-art approaches, e.g., COPE, RLNC, to CORE. Our measurements show the higher reliability and throughput of CORE over other schemes, especially, for asymmetric...
Solid Mesh Registration for Radiotherapy Treatment Planning
Noe, Karsten Østergaard; Sørensen, Thomas Sangild
2010-01-01
We present an algorithm for solid organ registration of pre-segmented data represented as tetrahedral meshes. Registration of the organ surface is driven by force terms based on a distance field representation of the source and reference shapes. Registration of internal morphology is achieved usi...
A Genetic-Firefly Hybrid Algorithm to Find the Best Data Location in a Data Cube
M. Faridi Masouleh
2016-10-01
Full Text Available Decision-based programs include large-scale complex database queries. If the response time is short, query optimization is critical. Users usually observe data as a multi-dimensional data cube. Each data cube cell displays data as an aggregation in which the number of cells depends on the number of other cells in the cube. At any given time, a powerful query optimization method can visualize part of the cells instead of calculating results from raw data. Business systems use different approaches and positioning of data in the data cube. In the present study, the data is trained by a neural network and a genetic-firefly hybrid algorithm is proposed for finding the best position for the data in the cube.
First steps towards cube textured nickel profile wires for YBCO-coated conductors
Eickemeyer, J.; Gueth, A.; Freudenberger, J.; Holzapfel, B.; Schultz, L.
2011-01-01
The cube texture as a typical sheet texture can also be formed by cold drawing and recrystallization in profile wires. Cube textured Ni profile wires containing up to 96.2% cube oriented grains in the central region were obtained. Forthcoming investigations are promising to get a textured substrate wire for YBCO-coated conductors. Cube textured nickel alloy tapes prepared by cold rolling and annealing (RABiTS method) represent a standard metallic substrate for superconductor coatings of the YBa 2 Cu 3 O 7-δ (YBCO) type. These tapes have a width to thickness ratio of about 30-100. However, a value of close to one is optimal concerning low energetic losses under alternating current applications. First experiments on micro-alloyed nickel prove that the cube texture as a typical sheet texture can also be formed in profile wires with a rectangular cross-section after cold drawing and recrystallization treatment.
Vertex Normals and Face Curvatures of Triangle Meshes
Sun, Xiang; Jiang, Caigui; Wallner, Johannes; Pottmann, Helmut
2016-01-01
This study contributes to the discrete differential geometry of triangle meshes, in combination with discrete line congruences associated with such meshes. In particular we discuss when a congruence defined by linear interpolation of vertex normals
Recurrence and Pain after Mesh Repair of Inguinal Hernias
Abstract. Background: Surgery for inguinal hernias has ... repair. Methods: The study was conducted on all inguinal hernia patients operated between 1st. October ... bilateral (1.6%). Only 101 .... Open Mesh Versus Laparoscopic Mesh. Repair ...
Surgical Management of Pelvic floor Prolapse in women using Mesh
RAH
polytetrafluoroethylene) . This article reviews our experience with polypropylene mesh in pelvic floor repair at the. Southern General Hospital Glasgow. The objective was to determine the safety and effectiveness of the prolene mesh in the repair ...
VARIABLE MESH STIFFNESS OF SPUR GEAR TEETH USING ...
gear engagement. A gear mesh kinematic simulation ... model is appropnate for VMS of a spur gear tooth. The assumptions for ... This process has been continued until one complete tooth meshing cycle is ..... Element Method. Using MATLAB,.
To mesh or not to mesh: a review of pelvic organ reconstructive surgery
Dällenbach, Patrick
2015-01-01
Pelvic organ prolapse (POP) is a major health issue with a lifetime risk of undergoing at least one surgical intervention estimated at close to 10%. In the 1990s, the risk of reoperation after primary standard vaginal procedure was estimated to be as high as 30% to 50%. In order to reduce the risk of relapse, gynecological surgeons started to use mesh implants in pelvic organ reconstructive surgery with the emergence of new complications. Recent studies have nevertheless shown that the risk of POP recurrence requiring reoperation is lower than previously estimated, being closer to 10% rather than 30%. The development of mesh surgery – actively promoted by the marketing industry – was tremendous during the past decade, and preceded any studies supporting its benefit for our patients. Randomized trials comparing the use of mesh to native tissue repair in POP surgery have now shown better anatomical but similar functional outcomes, and meshes are associated with more complications, in particular for transvaginal mesh implants. POP is not a life-threatening condition, but a functional problem that impairs quality of life for women. The old adage “primum non nocere” is particularly appropriate when dealing with this condition which requires no treatment when asymptomatic. It is currently admitted that a certain degree of POP is physiological with aging when situated above the landmark of the hymen. Treatment should be individualized and the use of mesh needs to be selective and appropriate. Mesh implants are probably an important tool in pelvic reconstructive surgery, but the ideal implant has yet to be found. The indications for its use still require caution and discernment. This review explores the reasons behind the introduction of mesh augmentation in POP surgery, and aims to clarify the risks, benefits, and the recognized indications for its use. PMID:25848324
McCoy, Olugbemisola; Vaughan, Taylor; Nickles, S Walker; Ashley, Matt; MacLachlan, Lara S; Ginsberg, David; Rovner, Eric
2016-08-01
We reviewed the outcomes of the autologous fascial pubovaginal sling as a salvage procedure for recurrent stress incontinence after intervention for polypropylene mesh erosion/exposure and/or bladder outlet obstruction in patients treated with prior transvaginal synthetic mesh for stress urinary incontinence. In a review of surgical databases at 2 institutions between January 2007 and June 2013 we identified 46 patients who underwent autologous fascial pubovaginal sling following removal of transvaginal synthetic mesh in simultaneous or staged fashion. This cohort of patients was evaluated for outcomes, including subjective and objective success, change in quality of life and complications between those who underwent staged vs concomitant synthetic mesh removal with autologous fascial pubovaginal sling placement. All 46 patients had received at least 1 prior mesh sling for incontinence and 8 (17%) had received prior transvaginal polypropylene mesh for pelvic organ prolapse repair. A total of 30 patients underwent concomitant mesh incision with or without partial excision and autologous sling placement while 16 underwent staged autologous sling placement. Mean followup was 16 months. Of the patients 22% required a mean of 1.8 subsequent interventions an average of 6.5 months after autologous sling placement with no difference in median quality of life at final followup. At last followup 42 of 46 patients (91%) and 35 of 46 (76%) had achieved objective and subjective success, respectively. There was no difference in subjective success between patients treated with a staged vs a concomitant approach (69% vs 80%, p = 0.48). Autologous fascial pubovaginal sling placement after synthetic mesh removal can be performed successfully in patients with stress urinary incontinence as a single or staged procedure. Copyright © 2016 American Urological Association Education and Research, Inc. Published by Elsevier Inc. All rights reserved.
Persistent pelvic pain following transvaginal mesh surgery: a cause for mesh removal.
Marcus-Braun, Naama; Bourret, Antoine; von Theobald, Peter
2012-06-01
Persistent pelvic pain after vaginal mesh surgery is an uncommon but serious complication that greatly affects women's quality of life. Our aim was to evaluate various procedures for mesh removal performed at a tertiary referral center in cases of persistent pelvic pain, and to evaluate the ensuing complications and outcomes. A retrospective study was conducted at the University Hospital of Caen, France, including all patients treated for removal or section of vaginal mesh due to pelvic pain as a primary cause, between January 2004 and September 2009. Ten patients met the inclusion criteria. Patients were diagnosed between 10 months and 3 years after their primary operation. Eight cases followed suburethral sling procedures and two followed mesh surgery for pelvic organ prolapse. Patients presented with obturator neuralgia (6), pudendal neuralgia (2), dyspareunia (1), and non-specific pain (1). The surgical treatment to release the mesh included: three cases of extra-peritoneal laparoscopy, four cases of complete vaginal mesh removal, one case of partial mesh removal and two cases of section of the suburethral sling. In all patients with obturator neuralgia, symptoms were resolved or improved, whereas in both cases of pudendal neuralgia the symptoms continued. There were no intra-operative complications. Post-operative Retzius hematoma was observed in one patient after laparoscopy. Mesh removal in a tertiary center is a safe procedure, necessary in some cases of persistent pelvic pain. Obturator neuralgia seems to be easier to treat than pudendal neuralgia. Early diagnosis is the key to success in prevention of chronic disease. Copyright © 2012 Elsevier Ireland Ltd. All rights reserved.
Laparoscopic removal of mesh used in pelvic floor surgery.
Khong, Su-Yen; Lam, Alan
2009-01-01
Various meshes are being used widely in clinical practice for pelvic reconstructive surgery despite the lack of evidence of their long-term safety and efficacy. Management of complications such as mesh erosion and dyspareunia can be challenging. Most mesh-related complications can probably be managed successfully via the transvaginal route; however, this may be impossible if surgical access is poor. This case report demonstrates the successful laparoscopic removal of mesh after several failed attempts via the vaginal route.
Lutke, Nikolay; Lange-Kuttner, Christiane
2015-01-01
This study introduces the new Rotated Colour Cube Test (RCCT) as a measure of object identification and mental rotation using single 3D colour cube images in a matching-to-sample procedure. One hundred 7- to 11-year-old children were tested with aligned or rotated cube models, distracters and targets. While different orientations of distracters…
Hudson, Jennifer; Martinez, Andres; Petro, Andrew
2015-01-01
The Propulsion System and Orbit Maneuver Integration in CubeSats project aims to solve the challenges of integrating a micro electric propulsion system on a CubeSat in order to perform orbital maneuvers and control attitude. This represents a fundamentally new capability for CubeSats, which typically do not contain propulsion systems and cannot maneuver far beyond their initial orbits.
On Reducing Delay in Mesh-Based P2P Streaming: A Mesh-Push Approach
Liu, Zheng; Xue, Kaiping; Hong, Peilin
The peer-assisted streaming paradigm has been widely employed to distribute live video data on the internet recently. In general, the mesh-based pull approach is more robust and efficient than the tree-based push approach. However, pull protocol brings about longer streaming delay, which is caused by the handshaking process of advertising buffer map message, sending request message and scheduling of the data block. In this paper, we propose a new approach, mesh-push, to address this issue. Different from the traditional pull approach, mesh-push implements block scheduling algorithm at sender side, where the block transmission is initiated by the sender rather than by the receiver. We first formulate the optimal upload bandwidth utilization problem, then present the mesh-push approach, in which a token protocol is designed to avoid block redundancy; a min-cost flow model is employed to derive the optimal scheduling for the push peer; and a push peer selection algorithm is introduced to reduce control overhead. Finally, we evaluate mesh-push through simulation, the results of which show mesh-push outperforms the pull scheduling in streaming delay, and achieves comparable delivery ratio at the same time.
The Dark Cube: dark character profiles and OCEAN
Danilo Garcia
2017-09-01
Full Text Available Background The Big Five traits (i.e., openness, conscientiousness, extraversion, agreeableness, and neuroticism: OCEAN have been suggested to provide a meaningful taxonomy for studying the Dark Triad: Machiavellianism, narcissism, and psychopathy. Nevertheless, current research consists of mixed and inconsistent associations between the Dark Triad and OCEAN. Here we used the Dark Cube (Garcia & Rosenberg, 2016, a model of malevolent character theoretically based on Cloninger’s biopsychosocial model of personality and in the assumption of a ternary structure of malevolent character. We use the dark cube profiles to investigate differences in OCEAN between individuals who differ in one dark character trait while holding the other two constant (i.e., conditional relationships. Method Participants (N = 330 responded to the Short Dark Triad Inventory and the Big Five Inventory and were grouped according to the eight possible combinations using their dark trait scores (M, high Machiavellianism; m, low Machiavellianism; N, high narcissism; n, low narcissism; P, high psychopathy; p, low psychopathy: MNP “maleficent”, MNp “manipulative narcissistic”, MnP “anti-social”, Mnp “Machiavellian”, mNP “psychopathic narcissistic”, mNp “narcissistic”, mnP “psychopathic”, and mnp “benevolent”. Results High narcissism-high extraversion and high psychopathy-low agreeableness were consistently associated across comparisons. The rest of the comparisons showed a complex interaction. For example, high Machiavellianism-high neuroticism only when both narcissism and psychopathy were low (Mnp vs. mnp, high narcissism-high conscientiousness only when both Machiavellianism and psychopathy were also high (MNP vs. MnP, and high psychopathy-high neuroticism only when Machiavellianism was low and narcissism was high (mNP vs. mNp. Conclusions We suggest that the Dark Cube is a useful tool in the investigation of a consistent Dark Triad Theory
The Dark Cube: dark character profiles and OCEAN.
Garcia, Danilo; González Moraga, Fernando R
2017-01-01
The Big Five traits (i.e., openness, conscientiousness, extraversion, agreeableness, and neuroticism: OCEAN) have been suggested to provide a meaningful taxonomy for studying the Dark Triad: Machiavellianism, narcissism, and psychopathy. Nevertheless, current research consists of mixed and inconsistent associations between the Dark Triad and OCEAN. Here we used the Dark Cube (Garcia & Rosenberg, 2016), a model of malevolent character theoretically based on Cloninger's biopsychosocial model of personality and in the assumption of a ternary structure of malevolent character. We use the dark cube profiles to investigate differences in OCEAN between individuals who differ in one dark character trait while holding the other two constant (i.e., conditional relationships). Participants ( N = 330) responded to the Short Dark Triad Inventory and the Big Five Inventory and were grouped according to the eight possible combinations using their dark trait scores (M, high Machiavellianism; m, low Machiavellianism; N, high narcissism; n, low narcissism; P, high psychopathy; p, low psychopathy): MNP "maleficent", MNp "manipulative narcissistic", MnP "anti-social", Mnp "Machiavellian", mNP "psychopathic narcissistic", mNp "narcissistic", mnP "psychopathic", and mnp "benevolent". High narcissism-high extraversion and high psychopathy-low agreeableness were consistently associated across comparisons. The rest of the comparisons showed a complex interaction. For example, high Machiavellianism-high neuroticism only when both narcissism and psychopathy were low (Mnp vs. mnp), high narcissism-high conscientiousness only when both Machiavellianism and psychopathy were also high (MNP vs. MnP), and high psychopathy-high neuroticism only when Machiavellianism was low and narcissism was high (mNP vs. mNp). We suggest that the Dark Cube is a useful tool in the investigation of a consistent Dark Triad Theory. This approach suggests that the only clear relationships were narcissism
Calculation of local skin doses with ICRP adult mesh-type reference computational phantoms
Yeom, Yeon Soo; Han, Haegin; Choi, Chansoo; Nguyen, Thang Tat; Lee, Hanjin; Shin, Bangho; Kim, Chan Hyeong; Han, Min Cheol
2018-01-01
Recently, Task Group 103 of the International Commission on Radiological Protection (ICRP) developed new mesh-type reference computational phantoms (MRCPs) for adult males and females in order to address the limitations of the current voxel-type reference phantoms described in ICRP Publication 110 due to their limited voxel resolutions and the nature of the voxel geometry. One of the substantial advantages of the MRCPs over the ICRP-110 reference phantoms is the inclusion of a 50-μm-thick radiosensitive skin basal-cell layer; however, a methodology for calculating the local skin dose (LSD), i.e., the maximum dose to the basal layer averaged over a 1-cm2 area, has yet to be developed. In the present study, a dedicated program for the LSD calculation with the MRCPs was developed based on the mean shift algorithm and the Geant4 Monte Carlo code. The developed program was used to calculate local skin dose coefficients (LSDCs) for electrons and alpha particles, which were then compared with the values given in ICRP Publication 116 that were produced with a simple tissue-equivalent cube model. The results of the present study show that the LSDCs of the MRCPs are generally in good agreement with the ICRP-116 values for alpha particles, but for electrons, significant differences are found at energies higher than 0.15 MeV. The LSDCs of the MRCPs are greater than the ICRP-116 values by as much as 2.7 times at 10 MeV, which is due mainly to the different curvature between realistic MRCPs ( i.e., curved) and the simple cube model ( i.e., flat).
Shah, Ketul; Nikolavsky, Dmitriy; Gilsdorf, Daniel; Flynn, Brian J
2013-12-01
We present our management of lower urinary tract (LUT) mesh perforation after mid-urethral polypropylene mesh sling using a novel combination of surgical techniques including total or near total mesh excision, urinary tract reconstruction, and concomitant pubovaginal sling with autologous rectus fascia in a single operation. We retrospectively reviewed the medical records of 189 patients undergoing transvaginal removal of polypropylene mesh from the lower urinary tract or vagina. The focus of this study is 21 patients with LUT mesh perforation after mid-urethral polypropylene mesh sling. We excluded patients with LUT mesh perforation from prolapse kits (n = 4) or sutures (n = 11), or mesh that was removed because of isolated vaginal wall exposure without concomitant LUT perforation (n = 164). Twenty-one patients underwent surgical removal of mesh through a transvaginal approach or combined transvaginal/abdominal approaches. The location of the perforation was the urethra in 14 and the bladder in 7. The mean follow-up was 22 months. There were no major intraoperative complications. All patients had complete resolution of the mesh complication and the primary symptom. Of the patients with urethral perforation, continence was achieved in 10 out of 14 (71.5 %). Of the patients with bladder perforation, continence was achieved in all 7. Total or near total removal of lower urinary tract (LUT) mesh perforation after mid-urethral polypropylene mesh sling can completely resolve LUT mesh perforation in a single operation. A concomitant pubovaginal sling can be safely performed in efforts to treat existing SUI or avoid future surgery for SUI.