Artykuły w czasopismach: „Binary input”

1

HOLDERBAUM, William. "Control of Binary Input Systems". IOSR Journal of Engineering 02, nr 12 (grudzień 2012): 01–15. http://dx.doi.org/10.9790/3021-021210115.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Vieira, M. A., M. Vieira, V. Silva, P. Louro i M. Barata. "Optoelectronic logic functions using optical bias controlled SiC multilayer devices". MRS Proceedings 1536 (2013): 91–96. http://dx.doi.org/10.1557/opl.2013.703.

Pełny tekst źródła

Streszczenie:

ABSTRACTThe purpose of this paper is the design of simple combinational optoelectronic circuit based on SiC technology, able to act simultaneously as a 4-bit binary encoder or a binary decoder in a 4-to-16 line configurations. The 4-bit binary encoder takes all the data inputs, one by one, and converts them to a single encoded output. The binary decoder decodes a binary input pattern to a decimal output code.The optoelectronic circuit is realized using a a-SiC:H double pin/pin photodetector with two front and back optical gates activated trough steady state violet background. Four red, green, blue and violet input channels impinge on the device at different bit sequences allowing 16 possible inputs. The device selects, through the violet background, one of the sixteen possible input logic signals and sends it to the output.Results show that the device acts as a reconfigurable active filter and allows optical switching and optoelectronic logic functions development. A relationship between the optical inputs and the corresponding digital output levels is established. A binary color weighted code that takes into account the specific weights assigned to each bit position establish the optoelectronic functions. A truth table of an encoder that performs 16-to-1 multiplexer (MUX) function is presented.

Style APA, Harvard, Vancouver, ISO itp.

3

Anashin, Vladimir. "Discreteness causes waves". Facta universitatis - series: Physics, Chemistry and Technology 14, nr 3 (2016): 143–96. http://dx.doi.org/10.2298/fupct1603143a.

Pełny tekst źródła

Streszczenie:

In the paper, we show that matter waves can be derived from discreteness and causality. Namely we show that matter waves can naturally be ascribed to finite discrete causal systems, the Mealy automata having binary input/output which are bit sequences. If assign real numerical values (?measured quantities?) to bit sequences, the waves arise as a correspondence between the numerical values of input sequences (?impacts?) and output sequences (?system-evoked responses?). We show that among all discrete causal systems with arbitrary (not necessarily binary) inputs/outputs, only the ones with binary input/output can be ascribed to matter waves ?(x,t) = ei(kx??t).

Style APA, Harvard, Vancouver, ISO itp.

4

Rakitin, Vladimir, Sergey Rusakov i Sergey Ulyanov. "The Coupled Reactance-Less Memristor Based Relaxation Oscillators for Binary Oscillator Networks". Micromachines 14, nr 2 (31.01.2023): 365. http://dx.doi.org/10.3390/mi14020365.

Pełny tekst źródła

Streszczenie:

This paper discusses the application of coupled reactance-less memristor-based oscillators (MBO) with binary output signals in oscillatory networks. A class of binary-coupled memristor oscillators provides simple integration with standard CMOS logic elements. Сombining MBOs with binary logic elements ensures the operation of complex information processing algorithms. The analysis of the simplest networks based on MBOs is performed. The typical reactance-less MBO with current and potential inputs is considered. The output responses for input control signals are analyzed. It is shown that the current input signal impacts primarily the rate of memristor resistance variation, while the potential input signal changes the thresholds. The exploit of the potential input for the synchronization of coupled MBOs and current control input in order to provide the necessary encoding of information is suggested. The example of the application of coupled MBOs in oscillatory networks is given, and results of simulation are presented.

Style APA, Harvard, Vancouver, ISO itp.

5

Xu, Luhang, Liangze Yin, Wei Dong, Weixi Jia i Yongjun Li. "Expediting Binary Fuzzing with Symbolic Analysis". International Journal of Software Engineering and Knowledge Engineering 28, nr 11n12 (listopad 2018): 1701–18. http://dx.doi.org/10.1142/s0218194018400247.

Pełny tekst źródła

Streszczenie:

Fuzzing is an important method for binary vulnerability mining. It can analyze binary programs without their source codes, which is not easy to do by other technologies. But due to the blindness of input generation, binary fuzzing often falls into traps for a long time when the new mutated inputs cannot generate unexplored paths. In this paper, we propose an efficient and flexible fuzzing framework named Tinker. It defines the growth rate of path coverage to measure the current state of fuzzing. If the fuzzing falls into low-speed or blocked states, a symbolic analysis procedure is invoked to generate a new input which can help the fuzzing jump out of the trap. In the symbolic analysis procedure, we employ dynamic execution to track the traversed nodes. The untraversed branches are then identified according to the recorded data of American Fuzzy Lop (AFL) [M. Zalewski, American Fuzzy Lop (2014), http://lcamtuf.coredump.cx/afl/ ]. At last, we employ control flow graph (CFG) to construct complete paths to these branches and a new input is generated using symbolic execution. Moreover, to expedite the detection of vulnerabilities, we generate inputs which trigger more high-risk system calls first, such that the possibility of finding vulnerabilities can be improved. Tinker has been implemented and the experiments on DARPA CGC benchmark show that Tinker is more efficient in vulnerability mining than state-of-the-art binary vulnerability mining tools.

Style APA, Harvard, Vancouver, ISO itp.

6

Yum, Bong-Jin, i Seong-Jun Kim. "On parameter design of binary-input-and-binary-output dynamic systems". Quality and Reliability Engineering International 9, nr 6 (listopad 1993): 471–76. http://dx.doi.org/10.1002/qre.4680090603.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Gurevich, Yuri, i Saharon Shelah. "Time polynomial in input or output". Journal of Symbolic Logic 54, nr 3 (wrzesień 1989): 1083–88. http://dx.doi.org/10.2307/2274767.

Pełny tekst źródła

Streszczenie:

AbstractWe introduce the class PIO of functions computable in time that is polynomial in max {the length of input, the length of output}, observe that there is no notation system for total PIO functions but there are notation systems for partial PIO functions, and give an algebra of partial PIO functions from binary strings to binary strings.

Style APA, Harvard, Vancouver, ISO itp.

8

LEPORATI, ALBERTO, CLAUDIO ZANDRON i MIGUEL A. GUTIÉRREZ-NARANJO. "P SYSTEMS WITH INPUT IN BINARY FORM". International Journal of Foundations of Computer Science 17, nr 01 (luty 2006): 127–46. http://dx.doi.org/10.1142/s0129054106003735.

Pełny tekst źródła

Streszczenie:

Current P systems which solve NP–complete numerical problems represent the instances of the problems in unary notation. However, in classical complexity theory, based upon Turing machines, switching from binary to unary encoded instances generally corresponds to simplify the problem. In this paper we show that, when working with P systems, we can assume without loss of generality that instances are expressed in binary notation. More precisely, we propose a simple method to encode binary numbers using multisets, and a family of P systems which transforms such multisets into the usual unary notation. Such a family could thus be composed with the unary P systems currently proposed in the literature to obtain (uniform) families of P systems which solve NP–complete numerical problems with instances encoded in binary notation. We introduce also a framework which can be used to design uniform families of P systems which solve NP–complete problems (both numerical and non-numerical) working directly on binary encoded instances, i.e., without first transforming them to unary notation. We illustrate our framework by designing a family of P systems which solves the 3-SAT problem. Next, we discuss the modifications needed to obtain a family of P systems which solves the PARTITION numerical problem.

Style APA, Harvard, Vancouver, ISO itp.

9

Kurkoski, Brian M., i Hideki Yagi. "Quantization of Binary-Input Discrete Memoryless Channels". IEEE Transactions on Information Theory 60, nr 8 (sierpień 2014): 4544–52. http://dx.doi.org/10.1109/tit.2014.2327016.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Horn, D. "Frustrated spin Hamiltonians with binary input vectors". Physical Review A 33, nr 4 (1.04.1986): 2595–601. http://dx.doi.org/10.1103/physreva.33.2595.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

Chen, Jiun-Kai, i Cheng-Ching Yu. "Optimal input design using generalized binary sequence". Automatica 33, nr 11 (listopad 1997): 2081–84. http://dx.doi.org/10.1016/s0005-1098(97)00122-2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

Zhao, Yujie, Zhanyong Tang, Guixin Ye, Xiaoqing Gong i Dingyi Fang. "Input-Output Example-Guided Data Deobfuscation on Binary". Security and Communication Networks 2021 (13.12.2021): 1–16. http://dx.doi.org/10.1155/2021/4646048.

Pełny tekst źródła

Streszczenie:

Data obfuscation is usually used by malicious software to avoid detection and reverse analysis. When analyzing the malware, such obfuscations have to be removed to restore the program into an easier understandable form (deobfuscation). The deobfuscation based on program synthesis provides a good solution for treating the target program as a black box. Thus, deobfuscation becomes a problem of finding the shortest instruction sequence to synthesize a program with the same input-output behavior as the target program. Existing work has two limitations: assuming that obfuscated code snippets in the target program are known and using a stochastic search algorithm resulting in low efficiency. In this paper, we propose fine-grained obfuscation detection for locating obfuscated code snippets by machine learning. Besides, we also combine the program synthesis and a heuristic search algorithm of Nested Monte Carlo Search. We have applied a prototype implementation of our ideas to data obfuscation in different tools, including OLLVM and Tigress. Our experimental results suggest that this approach is highly effective in locating and deobfuscating the binaries with data obfuscation, with an accuracy of at least 90.34%. Compared with the state-of-the-art deobfuscation technique, our approach’s efficiency has increased by 75%, with the success rate increasing by 5%.

Style APA, Harvard, Vancouver, ISO itp.

13

Zhang, Qiaosheng, i Vincent Y. F. Tan. "Covert Identification Over Binary-Input Discrete Memoryless Channels". IEEE Transactions on Information Theory 67, nr 8 (sierpień 2021): 5387–403. http://dx.doi.org/10.1109/tit.2021.3089245.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

14

Sharon, E., A. Ashikhmin i S. Litsyn. "EXIT functions for binary input memoryless symmetric channels". IEEE Transactions on Communications 54, nr 7 (lipiec 2006): 1207–14. http://dx.doi.org/10.1109/tcomm.2006.877956.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

Subr, Kartic, Sylvain Paris, Cyril Soler i Jan Kautz. "Accurate Binary Image Selection from Inaccurate User Input". Computer Graphics Forum 32, nr 2pt1 (maj 2013): 41–50. http://dx.doi.org/10.1111/cgf.12024.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

Han, Guangyue, i Brian Marcus. "Asymptotics of input-constrained binary symmetric channel capacity". Annals of Applied Probability 19, nr 3 (czerwiec 2009): 1063–91. http://dx.doi.org/10.1214/08-aap570.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

Pouliquen, Mathieu, Eric Pigeon, Olivier Gehan, Abdelhak Goudjil i Romain Auber. "Impulse response identification from input/output binary measurements". Automatica 123 (styczeń 2021): 109307. http://dx.doi.org/10.1016/j.automatica.2020.109307.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

Silva, Carla, Ana Aguiar i Inês Dutra. "Quantum Binary Classification (Student Abstract)". Proceedings of the AAAI Conference on Artificial Intelligence 35, nr 18 (18.05.2021): 15889–90. http://dx.doi.org/10.1609/aaai.v35i18.17941.

Pełny tekst źródła

Streszczenie:

We implement a quantum binary classifier where given a dataset of pairs of training inputs and target outputs our goal is to predict the output of a new input. The script is based in a hybrid scheme inspired in an existing PennyLane's variational classifier and to encode the classical data we resort to PennyLane's amplitude encoding embedding template. We use the quantum binary classifier applied to the well known Iris dataset and to a car traffic dataset. Our results show that the quantum approach is capable of performing the task using as few as 2 qubits. Accuracies are similar to other quantum machine learning research studies, and as good as the ones produced by classical classifiers.

Style APA, Harvard, Vancouver, ISO itp.

19

Awwal, Abdul Ahad S., i Mohammad A. Karim. "Design of polarization-encoded optical shadow-casting logic units using truth-table partitioning". Canadian Journal of Physics 66, nr 10 (1.10.1988): 841–43. http://dx.doi.org/10.1139/p88-137.

Pełny tekst źródła

Streszczenie:

The input pixel size of a polarization-encoded optical shadow-casting logic system is reduced by means of truth-table partitioning. The proposed design algorithm is used to encode the inputs of a three-input, two-output binary full adder. A comparison with alternative designs proves that the technique leads to an improved memory-efficient optical computing unit.

Style APA, Harvard, Vancouver, ISO itp.

20

Hyde, Brett. "The odd-parity input problem in metrical stress theory". Phonology 29, nr 3 (grudzień 2012): 383–431. http://dx.doi.org/10.1017/s0952675712000218.

Pełny tekst źródła

Streszczenie:

Under the weak layering approach to prosodic structure (Itô & Mester 1992), the requirement that output forms be exhaustively parsed into binary feet, even when the input contains an odd-number of syllables, results in the odd-parity input problem, which consists of two sub-problems. The odd heavy problem is a pathological type of quantity-sensitivity where a single odd-numbered heavy syllable in an odd-parity output is parsed as a monosyllabic foot. The even output problem is the systematic conversion of odd-parity inputs to even-parity outputs. The article examines the typology of binary stress patterns predicted by two approaches, symmetrical alignment (McCarthy & Prince 1993) and iterative foot optimisation (Pruitt 2008, 2010), to demonstrate that the odd-parity input problem is pervasive in weak layering accounts. It then demonstrates that the odd-parity input problem can be avoided altogether under the alternative structural assumptions of weak bracketing (Hyde 2002).

Style APA, Harvard, Vancouver, ISO itp.

21

Wu, Bo, Bin Zhang, Sha Meng Wen, Meng Jun Li, Quan Zhang i Chao Jing Tang. "Directed Fuzzing Based on Dynamic Taint Analysis for Binary Software". Applied Mechanics and Materials 571-572 (czerwiec 2014): 539–45. http://dx.doi.org/10.4028/www.scientific.net/amm.571-572.539.

Pełny tekst źródła

Streszczenie:

Traditional Fuzzing is simple and easy to deploy but inefficient due to different inputs usually execute the redundant path. In this paper, we put forward a binary-oriented Fuzzing technique based on input format analysis and dynamic taint analysis, which can detect vulnerability more efficient than traditional Fuzzing method. We implemented a prototype system called Smart and Directed Fuzz (SDFuzz), which first searches the locations where interested functions are called, then uses dynamic taint analysis technique to classify input data into safety-related data and safety-unrelated data, finally mutates safety-related data to direct the test procedure. The evaluation shows that our method can be used to detect vulnerabilities in binary software efficiently.

Style APA, Harvard, Vancouver, ISO itp.

22

Bialkowski, Stephen E. "Binary‐coded decimal to binary digital input modification of a popular digital delay module". Review of Scientific Instruments 57, nr 7 (lipiec 1986): 1431–32. http://dx.doi.org/10.1063/1.1138616.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

23

SUZUKI, SATOSHI, NAONORI UEDA i JACK SKLANSKY. "GRAPH-BASED THINNING FOR BINARY IMAGES". International Journal of Pattern Recognition and Artificial Intelligence 07, nr 05 (październik 1993): 1009–30. http://dx.doi.org/10.1142/s0218001493000510.

Pełny tekst źródła

Streszczenie:

A thinning method for binary images is proposed which converts digital binary images into line patterns. The proposed method suppresses shape distortion as well as false feature points, thereby producing more natural line patterns than existing methods. In addition, this method guarantees that the produced line patterns are one pixel in width everywhere. In this method, an input binary image is transformed into a graph in which 1-pixels correspond to nodes and neighboring nodes are connected by edges. Next, nodes unnecessary for preserving the topology of the input image and the edges connecting them are deleted symmetrically. Then, edges that do not contribute to the preservation of the topology of the input image are deleted. The advantages of this graph-based thinning method are confirmed by applying it to ideal line patterns and geographical maps.

Style APA, Harvard, Vancouver, ISO itp.

24

Singh, Gajendra Pratap, i Sujit Kumar Singh. "Petri Net Recommender System for Generating of Perfect Binary Tree". International Journal of Knowledge and Systems Science 10, nr 2 (kwiecień 2019): 1–12. http://dx.doi.org/10.4018/ijkss.2019040101.

Pełny tekst źródła

Streszczenie:

In modeling a discrete event driven system, Petri net recommender systems can play a very important role in describing the structural and behavioral properties of complex and tricky networks. The finite and infinite perfect binary tree forms a predictive model which can map the input information to output information based on the inputs' attributes. A perfect binary tree can be used for three types of recommender systems such as: collaborative filtering, a content-based approach, and a hybrid approach. In this article, the authors show the existence of a Petri net whose reachability tree is a Perfect Infinite Binary Tree (PIBT).

Style APA, Harvard, Vancouver, ISO itp.

25

Shamai, S., i S. Verdu. "Worst-case power-constrained noise for binary-input channels". IEEE Transactions on Information Theory 38, nr 5 (wrzesień 1992): 1494–511. http://dx.doi.org/10.1109/18.149501.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

Pereg, Uzi, i Ido Tal. "Channel Upgradation for Non-Binary Input Alphabets and MACs". IEEE Transactions on Information Theory 63, nr 3 (marzec 2017): 1410–24. http://dx.doi.org/10.1109/tit.2017.2652483.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

27

Nguang, Sing Kiong, i Xiao Dong Chen. "Robust stabilization of binary distillation columns with input constraints". International Journal of Systems Science 33, nr 9 (styczeń 2002): 759–65. http://dx.doi.org/10.1080/00207720210161731.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Binshtok, N., i S. Shamai. "Integer metrics for binary input symmetric output memoryless channels". IEEE Transactions on Communications 47, nr 11 (1999): 1636–45. http://dx.doi.org/10.1109/26.803498.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

29

Fosson, Sophie M. "Binary input reconstruction for linear systems: A performance analysis". Nonlinear Analysis: Hybrid Systems 7, nr 1 (luty 2013): 54–67. http://dx.doi.org/10.1016/j.nahs.2012.07.007.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

30

Kliewer, J., i A. Mertins. "Soft-Input Reconstruction of Binary Transmitted Quantized Overcomplete Expansions". IEEE Signal Processing Letters 11, nr 11 (listopad 2004): 899–903. http://dx.doi.org/10.1109/lsp.2004.836941.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Loskot, Pavel, i Norman C. Beaulieu. "The input–output weight enumeration of binary Hamming codes". European Transactions on Telecommunications 17, nr 4 (2006): 483–88. http://dx.doi.org/10.1002/ett.1133.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

Kusuma, Indra Bayu, Arida Kartika, Tjokorda Agung Budi W, Kurniawan Nur Ramadhani i Febryanti Sthevanie. "Image Spoofing Detection Using Local Binary Pattern and Local Binary Pattern Variance". International Journal on Information and Communication Technology (IJoICT) 4, nr 2 (2.04.2019): 11. http://dx.doi.org/10.21108/ijoict.2018.42.134.

Pełny tekst źródła

Streszczenie:

Particularly in the field of biometric security using human face has been widely implemented in the real world. Currently the human face is one of the guidelines in the security system. Nowadays the challenge is how to detect data falsification; such an attack is called spoofing. Spoofing occurs when someone is trying to pretend to be someone else by falsifying the original data and then that person may gain illegal access and benefit him. For example one can falsify the face recognition system using photographs, video, masks or 3D models. In this paper image spoofing human face detection using texture analysis on input image is proposed. Texture analysis used in this paper is the Local Binary Pattern (LBP) and Local Binary Pattern Variance (LBPV). To classified input as original or spoof K-Nearest Neighbor (KNN) used. Experiment used 5761 spoofs and 3362 original from NUAA Imposter dataset. The experimental result yielded a best success rate of 87.22% in term of accuracy with configuration of the system using LBPV and histogram equalization with ratio 𝑅 = 7 and 𝑃 = 8.

Style APA, Harvard, Vancouver, ISO itp.

33

Subha, S., i . "An Improved Multiplication Algorithm". International Journal of Engineering & Technology 7, nr 4.10 (2.10.2018): 1027. http://dx.doi.org/10.14419/ijet.v7i4.10.26666.

Pełny tekst źródła

Streszczenie:

Multiplication is commonly used arithmetic operation in computers. An algorithm is proposed to perform multiplication of positive numbers using law of indices. The two inputs A and B are represented as binary numbers. Iteratively, the number A is multiplied with the bits in B. The coefficients of the partial products are accumulated. These coefficients are represented as binary numbers, the result coefficients are calculated. The proposed algorithm is simulated using Quartus 2 tool for two four bit inputs. An improvement in timing by 18% with comparable power consumption and increased area is observed for input of four bits. The proposed algorithm can be extended for n-bit inputs.

Style APA, Harvard, Vancouver, ISO itp.

34

Moreno, J. Manuel Torres, i Mirta B. Gordon. "Efficient Adaptive Learning for Classification Tasks with Binary Units". Neural Computation 10, nr 4 (1.05.1998): 1007–30. http://dx.doi.org/10.1162/089976698300017601.

Pełny tekst źródła

Streszczenie:

This article presents a new incremental learning algorithm for classification tasks, called Net Lines, which is well adapted for both binary and real-valued input patterns. It generates small, compact feedforward neural networks with one hidden layer of binary units and binary output units. A convergence theorem ensures that solutions with a finite number of hidden units exist for both binary and real-valued input patterns. An implementation for problems with more than two classes, valid for any binary classifier, is proposed. The generalization error and the size of the resulting networks are compared to the best published results on well-known classification benchmarks. Early stopping is shown to decrease overfitting, without improving the generalization performance.

Style APA, Harvard, Vancouver, ISO itp.

35

Sivasubramaniyan, S. B., R. Seshasayanan i N. Ramadass. "Development of Combinational Circuits by Encoding on the Basis of Developmental Biology". Computational Intelligence and Neuroscience 2020 (1.07.2020): 1–14. http://dx.doi.org/10.1155/2020/7696398.

Pełny tekst źródła

Streszczenie:

The present work visualizes the evolution of primitive digital circuits as a development problem. The development of the digital circuit is implemented similar to the development of a human embryo from a single cell to the complete organism. The constituent parts making up a primitive digital circuit are encoded into binary strings. Each binary string is viewed as a cell, and several such cells are allowed to adhere and multiply before culminating into a developed organism. The binary string of the cell is further mapped to a particular attribute which defines the constituent of the complete digital circuit implemented. The present work illustrates the development of a 4-input combinational digital circuit. The development of 2-input majority function is illustrated, and the results are shown for the 2-input Ex-OR gate, 2-input majority function with 4 input variables, and a 2-to-1 multiplexer circuit. The development of the digital circuit resembles the development of an embryo in a living organism.

Style APA, Harvard, Vancouver, ISO itp.

36

Zhao, Shuai, Yuan Liu, Xiaokang Zhang, Rui Qin, Bin Wang i Qiang Zhang. "Mapping Temporally Ordered Inputs to Binary Message Outputs with a DNA Temporal Logic Circuit". Nanomaterials 13, nr 5 (27.02.2023): 903. http://dx.doi.org/10.3390/nano13050903.

Pełny tekst źródła

Streszczenie:

Molecular circuits and devices with temporal signal processing capability are of great significance for the analysis of complex biological processes. Mapping temporal inputs to binary messages is a process of history-dependent signal responses, which can help understand the signal-processing behavior of organisms. Here, we propose a DNA temporal logic circuit based on DNA strand displacement reactions, which can map temporally ordered inputs to corresponding binary message outputs. The presence or absence of the output signal is determined by the type of substrate reaction with the input so that different orders of inputs correspond to different binary outputs. We demonstrate that a circuit can be generalized to more complex temporal logic circuits by increasing or decreasing the number of substrates or inputs. We also show that our circuit had excellent responsiveness to temporally ordered inputs, flexibility, and expansibility in the case of symmetrically encrypted communications. We envision that our scheme can provide some new ideas for future molecular encryption, information processing, and neural networks.

Style APA, Harvard, Vancouver, ISO itp.

37

Pokhilko, Alexandra, Oliver Ebenhöh, W. Marshall Stark i Sean D. Colloms. "Mathematical model of a serine integrase-controlled toggle switch with a single input". Journal of The Royal Society Interface 15, nr 143 (czerwiec 2018): 20180160. http://dx.doi.org/10.1098/rsif.2018.0160.

Pełny tekst źródła

Streszczenie:

Dual-state genetic switches that can change their state in response to input signals can be used in synthetic biology to encode memory and control gene expression. A transcriptional toggle switch (TTS), with two mutually repressing transcription regulators, was previously used for switching between two expression states. In other studies, serine integrases have been used to control DNA inversion switches that can alternate between two different states. Both of these switches use two different inputs to switch ON or OFF. Here, we use mathematical modelling to design a robust one-input binary switch, which combines a TTS with a DNA inversion switch. This combined circuit switches between the two states every time it receives a pulse of a single-input signal. The robustness of the switch is based on the bistability of its TTS, while integrase recombination allows single-input control. Unidirectional integrase-RDF-mediated recombination is provided by a recently developed integrase-RDF fusion protein. We show that the switch is stable against parameter variations and molecular noise, making it a promising candidate for further use as a basic element of binary counting devices.

Style APA, Harvard, Vancouver, ISO itp.

38

Romaneckas, Kęstutis, Austėja Švereikaitė, Rasa Kimbirauskienė, Aušra Sinkevičienė i Jovita Balandaitė. "The Energy and Environmental Evaluation of Maize, Hemp and Faba Bean Multi-Crops". Agronomy 13, nr 9 (4.09.2023): 2316. http://dx.doi.org/10.3390/agronomy13092316.

Pełny tekst źródła

Streszczenie:

Agriculture uses a lot of fuel, fertilizers, pesticides and other substances, while emitting large amounts of GHGs. It is important to optimize these inputs and outputs. One such way is by increasing crop biodiversity. For this reason, single crops and mixtures of maize, hemp and faba bean as binary and ternary crops were investigated at the Experimental Station of Vytautas Magnus University, Lithuania. The results showed that consumption of diesel fuel was 31–46% higher than in single and 22–35% higher than in binary cultivations was found in a ternary crop. This had influence on the highest energy input of near twice higher than in maize and hemp single crops and maize+hemp binary crop, but similar with binary crops with faba bean. Despite this, the productivity of the ternary crop and, at the same time, the energy output were 2–5 times higher than in other treatments. This compensated for higher energy inputs and the energy efficiency ratio. In the ternary crop, energy productivity was from 1.1 to 2.8 times higher and net energy was 1.9–5.3 times higher than in other tested cultivations. The highest total GHG emissions were obtained in binary maize+hemp and maize+faba bean cultivations (1729.84 and 2067.33 CO2eq ha−1). Ternary cultivation with the highest energy inputs initiated average GHG emissions of 1541.90 kg ha−1 CO2eq. For higher efficiency, the ternary crop could be sown and harvested in one machine pass. Faba beans should be included in ternary crops, as their biomass makes up a significant part of the total biomass produced. We recommend reviewing the intercropped faba bean seeding rates, as faba bean seeds have a high energy input equivalent.

Style APA, Harvard, Vancouver, ISO itp.

39

Griot, Miguel, Andres I. Vila Casado, Wen-Yen Weng, Herwin Chan, Jiadong Wang i Richard D. Wesel. "Nonlinear Trellis Codes for Binary-Input Binary-Output Multiple-Access Channels with Single-User Decoding". IEEE Transactions on Communications 60, nr 2 (luty 2012): 364–74. http://dx.doi.org/10.1109/tcomm.2012.010512.070116.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

BLATT, MARCELO, EYTAN DOMANY i IDO KANTER. "ON THE EQUIVALENCE OF TWO-LAYERED PERCEPTRONS WITH BINARY NEURONS". International Journal of Neural Systems 06, nr 03 (wrzesień 1995): 225–31. http://dx.doi.org/10.1142/s0129065795000160.

Pełny tekst źródła

Streszczenie:

We consider two-layered perceptrons consisting of N binary input units, K binary hidden units and one binary output unit, in the limit N≫K≥1. We prove that the weights of a regular irreducible network are uniquely determined by its input-output map up to some obvious global symmetries. A network is regular if its K weight vectors from the input layer to the K hidden units are linearly independent. A (single layered) perceptron is said to be irreducible if its output depends on every one of its input units; and a two-layered perceptron is irreducible if the K+1 perceptrons that constitute such network are irreducible. By global symmetries we mean, for instance, permuting the labels of the hidden units. Hence, two irreducible regular two-layered perceptrons that implement the same Boolean function must have the same number of hidden units, and must be composed of equivalent perceptrons.

Style APA, Harvard, Vancouver, ISO itp.

41

Yasmin, Romena, Joshua T. Grassel, Md Mahmudulla Hassan, Olac Fuentes i Adolfo R. Escobedo. "Enhancing Image Classification Capabilities of Crowdsourcing-Based Methods through Expanded Input Elicitation". Proceedings of the AAAI Conference on Human Computation and Crowdsourcing 9 (4.10.2021): 166–78. http://dx.doi.org/10.1609/hcomp.v9i1.18949.

Pełny tekst źródła

Streszczenie:

This study investigates how different forms of input elicitation obtained from crowdsourcing can be utilized to improve the quality of inferred labels for image classification tasks, where an image must be labeled as either positive or negative depending on the presence/absence of a specified object. Three types of input elicitation methods are tested: binary classification (positive or negative); level of confidence in binary response (on a scale from 0-100%); and what participants believe the majority of the other participants' binary classification is. We design a crowdsourcing experiment to test the performance of the proposed input elicitation methods and use data from over 200 participants. Various existing voting and machine learning (ML) methods are applied and others developed to make the best use of these inputs. In an effort to assess their performance on classification tasks of varying difficulty, a systematic synthetic image generation process is developed. Each generated image combines items from the MPEG-7 Core Experiment CE-Shape-1 Test Set into a single image using multiple parameters (e.g., density, transparency, etc.) and may or may not contain a target object. The difficulty of these images is validated by the performance of an automated image classification method. Experimental results suggest that more accurate classifications can be achieved when using the average of the self-reported confidence values as an additional attribute for ML algorithms relative to what is achieved with more traditional approaches. Additionally, they demonstrate that other performance metrics of interest, namely reduced false-negative rates, can be prioritized through special modifications of the proposed aggregation methods that leverage the variety of elicited inputs.

Style APA, Harvard, Vancouver, ISO itp.

42

Oualla, Hicham, Rachid Fateh, Anouar Darif, Said Safi, Mathieu Pouliquen i Miloud Frikel. "Channel Identification Based on Cumulants, Binary Measurements, and Kernels". Systems 9, nr 2 (18.06.2021): 46. http://dx.doi.org/10.3390/systems9020046.

Pełny tekst źródła

Streszczenie:

In this paper, we discuss the problem of channel identification by using eight algorithms. The first three algorithms are based on higher-order cumulants, the next three algorithms are based on binary output measurement, and the last two algorithms are based on reproducing kernels. The principal objective of this paper is to study the performance of the presented algorithms in different situations, such as with different sizes of the data input or different signal-to-noise ratios. The presented algorithms are applied to the estimation of the channel parameters of the broadband radio access network (BRAN). The simulation results confirm that the presented algorithms are able to estimate the channel parameters with different accuracies, and each algorithm has its advantages and disadvantages for a given situation, such as for a given SNR and data input. Finally, this study provides an idea of which algorithms can be selected in a given situation. The study presented in this paper demonstrates that the cumulant-based algorithms are more adequate if the data inputs are not available (blind identification), but the kernel- and binary-measurement-based methods are more adequate if the noise is not important (SNR≥16 dB).

Style APA, Harvard, Vancouver, ISO itp.

43

Mandal, Dhoumendra, Sumana Mandal, Mrinal Kanti Mandal i Sisir Kumar Garai. "Alternative Approach of Developing Optical Binary Adder Using Reversible Peres Gates". International Journal of Optics 2018 (2018): 1–13. http://dx.doi.org/10.1155/2018/8541371.

Pełny tekst źródła

Streszczenie:

All-optical devices will play a very significant and crucial role in the modern all-optical network by eliminating the bottleneck of opto-electro-opto- (O-E-O-) conversion. Unfortunately, the conventional logic gates lose information at the output, and the states of the outputs cannot give any credible impressions of the states of the inputs. In this article, at first, the authors have proposed a method of designing an optical three-input-three-output reversible Peres gate. Authors have deployed polarization switching characteristic of Semiconductor Optical Amplifier (SOA) for designing this circuit. The authors have also proposed a method of designing an optical reversible full adder, using two such Peres gates and subsequently a data recovery circuit which can recover the input data of the adder. The authors have chosen frequency encoded data for processing the operation. The proposed scheme has been verified by simulation results.

Style APA, Harvard, Vancouver, ISO itp.

44

Oualla, Hicham, Mathieu Pouliquen, Miloud Frikel i Said Safi. "Recursive identification of IIR system using binary input/output measurements". International Journal of Modelling, Identification and Control 40, nr 4 (2022): 327. http://dx.doi.org/10.1504/ijmic.2022.125549.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

Safi, Said, Miloud Frikel, Hicham Oualla i Mathieu Pouliquen. "Recursive identification of IIR system using binary input/output measurements". International Journal of Modelling, Identification and Control 40, nr 4 (2022): 327. http://dx.doi.org/10.1504/ijmic.2022.10050542.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

Casini, Marco, Andrea Garulli i Antonio Vicino. "Input Design in Worst-Case System Identification Using Binary Sensors". IEEE Transactions on Automatic Control 56, nr 5 (maj 2011): 1186–91. http://dx.doi.org/10.1109/tac.2011.2107091.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

McKellips, A. L., i S. Verdu. "Maximin performance of binary-input channels with uncertain noise distributions". IEEE Transactions on Information Theory 44, nr 3 (maj 1998): 947–72. http://dx.doi.org/10.1109/18.669127.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

48

Wang, Min, Jun Wu, Sai Feng Shi, Chong Luo i Feng Wu. "Fast Decoding and Hardware Design for Binary-Input Compressive Sensing". IEEE Journal on Emerging and Selected Topics in Circuits and Systems 2, nr 3 (wrzesień 2012): 591–603. http://dx.doi.org/10.1109/jetcas.2012.2220291.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

49

Diamantaras, Konstantinos, Gabriela Vranou i Theophilos Papadimitriou. "Multi-Input Single-Output Nonlinear Blind Separation of Binary Sources". IEEE Transactions on Signal Processing 61, nr 11 (czerwiec 2013): 2866–73. http://dx.doi.org/10.1109/tsp.2013.2255046.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

Zhao, Ruilian, Zheng Li i Qian Wang. "Test Generation for Programs with Binary Tree Structure as Input". International Journal of Software Engineering and Knowledge Engineering 25, nr 07 (wrzesień 2015): 1129–51. http://dx.doi.org/10.1142/s0218194015500205.

Pełny tekst źródła

Streszczenie:

Test data generation is a process of creating program inputs that satisfy specific testing criteria. Many works have been focused on test generation with respect to numeric and string data. Dynamic data structures, such as trees and linked lists, have been widely used in modern programming, but on which there are few studies presented. In general, generating a dynamic data structure is associated with a proper shape and valid values generation. It would be difficult to generate such dynamic data structures, as both shapes and values are necessary to be valid simultaneously. This paper focuses on binary tree structures and proposes a novel test generation approach that combines search based testing with constraint solving techniques. The approach creates the shapes of binary tree structures by using GA, and generates the values in their data fields by using constraint solving techniques. The experimental results show that the presented approach is promising and effective. Moreover, the studies investigate factors affecting the performance of the approach, and arrive at a conclusion that the test generation cost is cubic growing as the number of pointer constraints increases.

Style APA, Harvard, Vancouver, ISO itp.

Artykuły w czasopismach na temat „Binary input”

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych