Search

Your search keyword '"Binary number"' showing total 1,994 results
Start Over Descriptor "Binary number" Publisher springer berlin heidelberg

Refine your results

more »

more »

1,994 results on '"Binary number"'

2. Computer Science Unplugged and Related Projects in Math and Computer Science Popularization

Author

Bell, Tim, Rosamond, Frances, Casey, Nancy, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Bodlaender, Hans L., editor, Downey, Rod, editor, Fomin, Fedor V., editor, and Marx, Dániel, editor

Published
2012
Full Text
View/download PDF

3. Hesitant fuzzy multi-attribute decision making based on binary connection number of set pair analysis

Author

Qing Shen, Yong Liu, Jungang Lou, and Yunliang Jiang

Subjects
Hesitant fuzzy sets, Mathematical optimization, Soft Computing in Decision Making and in Modeling in Economics, Computer science, Mathematics::General Mathematics, Multi-attribute decision making, Fuzzy set, Probabilistic logic, Binary number, Computational intelligence, Fuzzy logic, Physics::History of Physics, Theoretical Computer Science, Binary connection number, Conditional decision making, Set (abstract data type), Probabilistic hesitant fuzzy sets, Ranking, Geometry and Topology, Software, Decision-making models
Abstract

To objectively evaluate the influence of hesitant fuzziness on the ranking of alternatives in multi-attribute decision making with hesitant fuzzy or probabilistic hesitant fuzzy information, the binary connection number of set pair analysis is applied to hesitant fuzzy multi-attribute decision making. The hesitant or probabilistic hesitant fuzzy set is transformed to the binary connection number. A hesitant fuzzy multi-attribute decision making model based on binary connection number is then established. Binary connection number theory is utilized to obtain the hesitant fuzzy center and decision-making suggestions about the alternative ranking under different hesitant fuzzy conditions. Experimental examples show that the hesitant fuzzy multi-attribute decision making model based on binary connection number has a certain versatility. It can determine the optimal scheme under the influence of hesitant fuzziness on the alternative ranking and contains the results of the same hesitant fuzzy decision-making problem using other methods, which helps in targeted decision making according to different hesitant fuzzy conditions.

Published
2021

4. Index to Constant Weight Codeword Converter

Author

Butler, Jon T., Sasao, Tsutomu, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Koch, Andreas, editor, Krishnamurthy, Ram, editor, McAllister, John, editor, Woods, Roger, editor, and El-Ghazawi, Tarek, editor

Published
2011
Full Text
View/download PDF

5. Reasoning about Codata

Author

Hinze, Ralf, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Horváth, Zoltán, editor, Plasmeijer, Rinus, editor, and Zsók, Viktória, editor

Published
2010
Full Text
View/download PDF

9. A Link-Load Balanced Low Energy Mapping and Routing for NoC

Author

Wenbiao, Zhou, Yan, Zhang, Zhigang, Mao, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Rangan, C. Pandu, editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Lee, Yann-Hang, editor, Kim, Heung-Nam, editor, Kim, Jong, editor, Park, Yongwan, editor, Yang, Laurence T., editor, and Kim, Sung Won, editor

Published
2007
Full Text
View/download PDF

10. Improving the Average Delay of Sorting

Author

Jakoby, Andreas, Liśkiewicz, Maciej, Reischuk, Rüdiger, Schindelhauer, Christian, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Cai, Jin-Yi, editor, Cooper, S. Barry, editor, and Zhu, Hong, editor

Published
2007
Full Text
View/download PDF

11. Reconfigurable Computing for Accelerating Protein Folding Simulations

Author

Armstrong, Nilton B., Jr., Lopes, Heitor S., Lima, Carlos R. Erig, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Rangan, C. Pandu, editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Diniz, Pedro C., editor, Marques, Eduardo, editor, Bertels, Koen, editor, Fernandes, Marcio Merino, editor, and Cardoso, João M. P., editor

Published
2007
Full Text
View/download PDF

12. Exploiting Single-Cycle Symmetries in Branch-and-Prune algorithms

Author

Ruiz de Angulo, Vicente, Torras, Carme, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Bessière, Christian, editor

Published
2007
Full Text
View/download PDF

15. A Classification Based Approach for Root Unknown Phylogenetic Networks Under Constrained Recombination

Author

Zahid, M. A. H., Mittal, Ankush, Joshi, R. C., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Dough, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Chakraborty, Goutam, editor

Published
2005
Full Text
View/download PDF

16. A Logarithmic Time Method for Two’s Complementation

Author

Kang, Jung-Yup, Gaudiot, Jean-Luc, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Sunderam, Vaidy S., editor, van Albada, Geert Dick, editor, Sloot, Peter M. A., editor, and Dongarra, Jack J., editor

Published
2005
Full Text
View/download PDF

17. It’s Elementary, My Dear Watson: Time-Optimal Sorting Algorithms on a Completely Overlapping Network

Author

Kantabutra, Sanpawat, Jindaluang, Wattana, Techa-angkoon, Prapaporn, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Pan, Yi, editor, Chen, Daoxu, editor, Guo, Minyi, editor, Cao, Jiannong, editor, and Dongarra, Jack, editor

Published
2005
Full Text
View/download PDF

18. Towards an Optimal CNF Encoding of Boolean Cardinality Constraints

Author

Sinz, Carsten, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and van Beek, Peter, editor

Published
2005
Full Text
View/download PDF

23. Limited-view binary tomography reconstruction assisted by shape centroid

Author

Péter Balázs and Tibor Lukić

Subjects
Inverse problems, Tomographic reconstruction, Computer science, ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, Binary number, Centroid, 020207 software engineering, 02 engineering and technology, Inverse problem, Computer Graphics and Computer-Aided Design, Regularization (mathematics), Term (time), Energy minimization, Center of gravity, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Original Article, Computer Vision and Pattern Recognition, Binary tomography, Reconstruction, Projection (set theory), Algorithm, Software
Abstract

In this paper, the binary tomographic reconstruction problem for very limited projection data availability is considered. Being this inverse problem highly ill-posed, we propose a new reconstruction model that uses a shape centroid-based regularization term, i.e., we assume that the center of gravity of the object of interest is known, at least approximately, in advance. Motivation for this regularization is found in the close connection between the projection data and the object centroid, as we will show. Experimental evaluation underpins that reasonable results can be obtained from practically minimal amount of projection data, gathered from just one projection direction.

Published
2021

26. Uncertainty quantification on a spatial Markov-chain model for the progression of skin cancer

Author

Fred J. Vermolen and Ilkka Pölönen

Subjects
65C05, Skin Neoplasms, Computer science, Quantitative Biology::Tissues and Organs, Markovin ketjut, 0206 medical engineering, Monte Carlo method, Physics::Medical Physics, Binary number, 02 engineering and technology, Article, ihosyöpä, 03 medical and health sciences, Mice, medicine, Animals, Humans, Computer Simulation, Statistical physics, Uncertainty quantification, 60J20, stokastiset prosessit, 030304 developmental biology, Probability, 0303 health sciences, Markov chain, Applied Mathematics, Probabilistic logic, Uncertainty, State (functional analysis), medicine.disease, 020601 biomedical engineering, Agricultural and Biological Sciences (miscellaneous), Markov Chains, Cardinal point, Modeling and Simulation, 65C40, Disease Progression, matemaattiset mallit, Skin cancer, Monte Carlo Method
Abstract

A spatial Markov-chain model is formulated for the progression of skin cancer. The model is based on the division of the computational domain into nodal points, that can be in a binary state: either in ‘cancer state’ or in ‘non-cancer state’. The model assigns probabilities for the non-reversible transition from ‘non-cancer’ state to the ‘cancer state’ that depend on the states of the neighbouring nodes. The likelihood of transition further depends on the life burden intensity of the UV-rays that the skin is exposed to. The probabilistic nature of the process and the uncertainty in the input data is assessed by the use of Monte Carlo simulations. A good fit between experiments on mice and our model has been obtained.

Published
2019

30. Performance and Hardware Requirements of Parallel Addition Algorithms for Optical Implementation Using SEEDs

Author

Rhein, D., Aigrain, P., editor, Aldana, F., editor, Danielmeyer, H. G., editor, Faugeras, O., editor, Gallaire, H., editor, Kowalski, R. A., editor, Lehn, J. M., editor, Levi, G., editor, Metakides, G., editor, Oakley, B., editor, Rasmussen, J., editor, Tribolet, J., editor, Tsichritzis, D., editor, Van Overstraeten, R., editor, Wrixon, G., editor, Smith, S. Desmond, editor, and Neale, Roderick F., editor

Published
1993
Full Text
View/download PDF

31. A universal Turing machine

Author

Aanderaa, Stål, Goos, G., editor, Hartmanis, J., editor, Börger, E., editor, Jäger, G., editor, Kleine Büning, H., editor, Martini, S., editor, and Richter, M. M., editor

Published
1993
Full Text
View/download PDF

36. A Single Chip 1024 Bits RSA Processor

Author

Vandemeulebroecke, André, Vanzieleghem, Etienne, Denayer, Tony, Jespers, Paul G. A., Goos, G., editor, Hartmanis, J., editor, Barstow, D., editor, Brauer, W., editor, Brinch Hansen, P., editor, Gries, D., editor, Luckham, D., editor, Moler, C., editor, Pnueli, A., editor, Seegmüller, G., editor, Stoer, J., editor, Wirth, N., editor, Quisquater, Jean-Jacques, editor, and Vandewalle, Joos, editor

Published
1990
Full Text
View/download PDF

37. Relevant Parameters: Insightful Roadmaps

Author

Jorge Ojeda-Castaneda

Subjects
Wavefront, Point spread function, Optics, business.industry, Computer science, Irradiance, Binary number, business, Impulse response, Optical path length
Abstract

In this chapter, we introduce the concept of wavefront engineering by discussing the use binary masks, which generate irradiance distributions capable of displaying the variations of the impulse response with changes of optical path difference (OPD). In this way, one has a visual guide for engineering the influence of wavefront variations on the irradiance impulse response, if you will on the irradiance point spread function (PSF).

Published
2021
Full Text
View/download PDF

38. Timing Neutron Stars: Pulsations, Oscillations and Explosions

Author

Mariano Mendez, Cheng-Min Zhang, Tomaso Belloni, and Astronomy

Subjects
Physics, Solar System, Inertial frame of reference, 010308 nuclear & particles physics, General relativity, Astrophysics::High Energy Astrophysical Phenomena, Binary number, Astrophysics, Compact star, 01 natural sciences, Accretion (astrophysics), Neutron star, Gravitational field, 0103 physical sciences, Astrophysics::Solar and Stellar Astrophysics, Astrophysics::Earth and Planetary Astrophysics, 010303 astronomy & astrophysics
Abstract

Binary systems with a neutron-star primary accreting from a companion star display variability in the X-ray band on time scales ranging from years to milliseconds. With frequencies of up to ~1300 Hz, the kilohertz quasi-periodic oscillations (kHz QPOs) represent the fastest variability observed from any astronomical object. The sub-millisecond time scale of this variability implies that the kHz QPOs are produced in the accretion flow very close to the surface of the neutron star, providing a unique view of the dynamics of matter under the influence of some of the strongest gravitational fields in the Universe. This offers the possibility to probe some of the most extreme predictions of General Relativity, such as dragging of inertial frames and periastron precession at rates that are sixteen orders of magnitude faster than those observed in the solar system and, ultimately, the existence of a minimum distance at which a stable orbit around a compact object is possible. Here we review the last twenty years of research on kHz QPOs, and we discuss the prospects for future developments in this field.

Published
2021
Full Text
View/download PDF

39. General Relativity Measurements from Pulsars

Author

Delphine Perrodin, Marta Burgay, and Andrea Possenti

Subjects
Physics, Gravity (chemistry), Field (physics), 010308 nuclear & particles physics, General relativity, Astrophysics::High Energy Astrophysical Phenomena, White dwarf, Binary number, Astrophysics::Cosmology and Extragalactic Astrophysics, Astrophysics, 01 natural sciences, Orbit, Neutron star, Pulsar, 0103 physical sciences, Astrophysics::Solar and Stellar Astrophysics, Astrophysics::Earth and Planetary Astrophysics, 010303 astronomy & astrophysics
Abstract

In this chapter, after a brief description of radio pulsars and their different manifestations, we illustrate the case of the so-called relativistic binary pulsars, which are fast-spinning neutron stars in orbit with a compact companion star, either a white dwarf or a second neutron star. Thanks to the clock-like nature of their radio signals, some of these binary pulsars can be used as test beds for General Relativity and other theories of gravity. We describe the methodology used to exploit these sources as laboratories for relativistic gravity and review some of the most important recent results in this field of research.

Published
2020
Full Text
View/download PDF

40. A Neutral Temporal Deontic STIT Logic

Author

Tim Lyon and Kees van Berkel

Subjects
Computer science, Deontic logic, 010102 general mathematics, Modal logic, Binary number, 06 humanities and the arts, Function (mathematics), 16. Peace & justice, 0603 philosophy, ethics and religion, 01 natural sciences, Tense logic, 060302 philosophy, Utilitarianism, Calculus, Temporal logic, 0101 mathematics
Abstract

In this work we answer a long standing request for temporal embeddings of deontic STIT logics by introducing the multi-agent STIT logic \(\mathsf {TDS}\). The logic is based upon atemporal utilitarian STIT logic. Yet, the logic presented here will be neutral: instead of committing ourselves to utilitarian theories, we prove the logic \(\mathsf {TDS}\) sound and complete with respect to relational frames not employing any utilitarian function. We demonstrate how these neutral frames can be transformed into utilitarian temporal frames, while preserving validity. Last, we discuss problems that arise from employing binary utility functions in a temporal setting.

Published
2019
Full Text
View/download PDF

42. Methods of Spiking Neural Networks

Author

Nikola Kasabov

Subjects
Rest (physics), Spiking neural network, Background information, business.industry, Computer science, Binary number, 02 engineering and technology, 03 medical and health sciences, 0302 clinical medicine, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Artificial intelligence, business, 030217 neurology & neurosurgery, Event (probability theory)
Abstract

Spiking neural networks (SNN) are biologically inspired ANN where information is represented as binary events (spikes), similar to the event potentials in the brain, and learning is also inspired by principles in the brain. SNN are also universal computational mechanisms (Maass in Math Found Comput Sci 1998, 72–83, 1998 [1]). These and many other reasons that are discussed in this chapter make SNN a preferred computational paradigm for modelling temporal and spatio-temporal data and for building brain-inspired AI. This chapter gives the background information for SNN that is further used in the rest of the book.

Published
2018
Full Text
View/download PDF

44. Structure of domain boundaries: binary oxides: Al2O3

Author

J. Wollschläger

Subjects
chemistry.chemical_compound, Materials science, chemistry, Mathematical analysis, Structure (category theory), Oxide, Binary number, Boundary (topology), Domain (software engineering)
Abstract

This chapter discusses the structure of domain boundary in Al2O3 binary oxide measured using various experimental techniques.

Published
2018
Full Text
View/download PDF

45. Enable learning of Hybrid Timed Automata in Absence of Discrete Events through Self-Organizing Maps

Author

Alexander von Birgelen and Oliver Niggemann

Subjects
Self-organizing map, 0209 industrial biotechnology, Root (linguistics), Computer science, business.industry, SIGNAL (programming language), Binary number, Condition monitoring, 02 engineering and technology, Machine learning, computer.software_genre, Automaton, 020901 industrial engineering & automation, Hybrid system, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, State (computer science), Artificial intelligence, business, computer
Abstract

Model-based diagnosis is a commonly used approach to identify anomalies and root causes within cyber-physical production systems (CPPS) through the use of models, which are often times manually created by experts. However, manual modelling takes a lot of effort and is not suitable for today’s fast-changing systems. Today, the large amount of sensor data provided by modern plants enables data-driven solutions where models are learned from the systems data, significantly reducing the manual modelling efforts. This enables tasks such as condition monitoring where anomalies are detected automatically, giving operators the chance to restore the plant to a working state before production losses occur. The choice of the model depends on a couple of factors, one of which is the type of the available signals. Modern CPPS are usually hybrid systems containing both binary and real-valued signals. Hybrid timed automata are one type of model which separate the systems behaviour into different modes through discrete events which are for example created from binary signals of the plant or through real-valued signal thresholds, defined by experts. However, binary signals or expert knowledge to generate the much needed discrete events are not always available from the plant and automata cannot be learned. The unsupervised, non-parametric approach presented and evaluated in this paper uses self-organizing maps and watershed transformations to allow the use of hybrid timed automata on data where learning of automata was not possible before. Furthermore, the results of the algorithm are tested on several data sets.

Published
2018
Full Text
View/download PDF

48. Structure of domain boundaries: binary oxides: TiO2 (anatase)

Author

J. Wollschläger

Subjects
Anatase, Materials science, Chemical physics, Structure (category theory), Binary number, Boundary (topology), Domain (software engineering)
Abstract

This chapter discusses the structure of domain boundary in TiO2 (anatase) measured using various experimental techniques.

Published
2018
Full Text
View/download PDF

50. Introduction to hydrides of binary and pseudo-binary intermetallic compounds

Author

V. Paul-Boncour

Subjects
010302 applied physics, Crystallography, Materials science, 0103 physical sciences, Intermetallic, Binary number, 02 engineering and technology, 021001 nanoscience & nanotechnology, 0210 nano-technology, 01 natural sciences
Abstract

This chapter provides an introduction to hydrides of binary and pseudo-binary intermetallic compounds.

Published
2018
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results