Search

Database tuples can be seen as players in the game of jointly realizing the answer to a query. Some tuples may contribute more than others to the outcome, which can be a binary value in the case of a Boolean query, a number for a numerical aggregate query, and so on. To quantify the contributions of tuples, we use the Shapley value that was introduced in cooperative game theory and has found applications in a plethora of domains. Specifically, the Shapley value of an individual tuple quantifies its contribution to the query. We investigate the applicability of the Shapley value in this setting, as well as the computational aspects of its calculation in terms of complexity, algorithms, and approximation.

Real-world optimisation problems often involve uncertainties. In the past decade, several rigorous analysis results for evolutionary algorithms (EAs) on discrete problems show that EAs can cope with low-level uncertainties, and sometimes benefit from uncertainties. Using non-elitist EAs with large population size is a promising approach to handle higher levels of uncertainties. However, the performance of non-elitist EAs in some common fitness-uncertainty scenarios is still unknown. We analyse the runtime of non-elitist EAs on OneMax and LeadingOnes under prior and posterior noise models, and the dynamic binary value problem (DynBV). Our analyses are more extensive and precise than previous analyses of non-elitist EAs. In several settings, we prove that the non-elitist EAs beat the current state of the art results. Previous work shows that the population size and mutation rate can dramatically impact the performance of non-elitist EAs. The optimal choices of these parameters depend on the level of uncertainties in the fitness functions. We provide more precise guidance on how to choose mutation rate and population size as a function of the level of uncertainties.

Electronic sow feeding (ESF) systems are used to control feed delivery to individual sows that are group-housed. Feeding levels for gestating sows are typically restricted to prevent excessive body weight gain. Any alteration of intake from the allocated feeding curve or unusual feeding behavior could indicate potential health issues. The objective of this study was to use data recorded by ESF to establish and characterize novel feed intake and feeding behavior traits and to estimate their heritabilities. Raw data were available from two farms with in-house manufactured (Farm A) or commercial (Farm B) ESF. The traits derived included feed intake, time spent eating, and rate of feed consumption, averaged across or within specific time periods of gestation. Additional phenotypes included average daily number of feeding events (AFE), along with the cumulative numbers of days where sows spent longer than 30 min in the ESF (ABOVE30), missed their daily intake (MISSF), or consumed below 1 kg of feed (BELOW1). The appetite of sows was represented by averages of score (APPETITE), a binary value for allocation eaten or not (DA_bin), or the standard deviation of the difference between feed intake and allocation (SDA-I). Gilts took longer to eat than sows (15.5 ± 0.13 vs. 14.1 ± 0.11 min/d) despite a lower feed allocation (2.13 ± 0.00 vs. 2.36 ± 0.01 kg/d). The lowest heritability estimates (below 0.10) occurred for feed intake traits, due to the restriction in feed allocation, although heritabilities were slightly higher for Farm B, with restriction in the eating time. The low heritability for AFE (0.05 ± 0.02) may have reflected the lack of recording of nonfeeding visits, but repeatability was moderate (0.26 ± 0.03, Farm A). Time-related traits were moderately to highly heritable and repeatable, demonstrating genetic variation between individuals in their feeding behaviors. Heritabilities for BELOW1 (Farm A: 0.16 ± 0.04 and Farm B: 0.15 ± 0.09) and SDA-I (Farm A: 0.17 ± 0.04 and Farm B: 0.10 ± 0.08) were similar across farms. In contrast, MISSF was moderately heritable in Farm A (0.19 ± 0.04) but lowly heritable in Farm B (0.05 ± 0.07). Heritabilities for DA_bin were dissimilar between farms (Farm A: 0.02 ± 0.02 and Farm B: 0.23 ± 0.10) despite similar incidence. Individual phenotypes constructed from ESF data could be useful for genetic evaluation purposes, but equivalent capabilities to generate phenotypes were not available for both ESF systems.

In order to realize sugarcane bud orientation and positioning seeding, a sugarcane bud tracking and positioning method based on improved GOTURN algorithm is proposed. This method takes the segmented image of sugarcane in natural environment as the object, and uses YCbCr color space to convert the image into binary value. After a series of morphological treatments of expansion and corrosion, the area of the cane bud is obtained by frame selection. Finally, the sugarcane bud is tracked by the GOTURN algorithm, and the width of the frame of the cane bud frame is compared at different angles to define the minimum width of the cane bud For qualified positioning. In this way, the continuous and dynamic intelligent recognition of sugarcane seed characteristics by the sugarcane seeding device is realized.

In her essay on the involvement of photography in the system of racial division, Tanya Sheehan (“Comical Conflations: Racial Identity and Science of Photography,” Photography & Culture, vol. 4, no. 2, 2011: 133-156) focused her attention on common comparisons of the photographic negative to the Negroid race. Such a tendency may imply a claim that the negative is racist; once connected, just as African Americans, with pejorative features. The negative picture, different from reality as such but above all negating a realistic (positive) tradition in art, because of being different (other) can be considered wrong or inferior to the positive so that it must be hidden or even destroyed. In such a context, the present paper focuses on the relationship between the photographic negative and the question of race. Although apparently the reversal of the color of skin might result in a racial transformation of the photographed whites, the artistic practice of the 20th and 21st centuries demonstrates that quite often the reversed color does not necessarily mean a change of race. What is more, the negative has been used to oppose by artistic means the simplifying polarization of society. Such avant-garde photographers as Hans Bellmer, Man Ray, and Alexandr Rodchenko used the inversion of tone in their works critiquing colonial and racist stereotypes. Contemporary artists use the negative convention to subvert the dominant positive, realism, light, day, the white male, and other concepts associated with one of the poles constituting the binary value system. Painting one’s face black, in the 19th century used in evidently racist performances called “minstrel shows,” may now convey a positive message.

In this chapter we will look at using the PIC to measure real-world signals such as signals from pressure, temperature, and speed. It will cover using the three registers that control the ADC and receiving an analogue input and displaying it as a binary value.

In this paper, we propose using phonemic information in addition to acoustic features to improve the intelligibility of speech uttered by patients with articulation disorders caused by a wide glossectomy. Our previous studies showed that voice conversion algorithm improves the quality of glossectomy patients' speech. However, losses in acoustic features of glossectomy patients' speech are so large that the quality of the reconstructed speech is low. To solve this problem, we explored potentials of several additional information to improve speech intelligibility. One of the candidates is phonemic information, more specifically Phoneme Labels as Auxiliary input (PLA). To combine both acoustic features and PLA, we employed a DNN-based algorithm. PLA is represented by a kind of one-of-k vector, i.e., PLA has a weight value (

The binary value function, or BinVal, has appeared in several studies in theory of evolutionary computation as one of the extreme examples of linear pseudo-Boolean functions. Its unbiased black-box complexity was previously shown to be at most $\lceil \log_2 n \rceil + 2$, where $n$ is the problem size. We augment it with an upper bound of $\log_2 n + 2.42141558 - o(1)$, which is more precise for many values of $n$. We also present a lower bound of $\log_2 n + 1.1186406 - o(1)$. Additionally, we prove that BinVal is an easiest function among all unimodal pseudo-Boolean functions at least for unbiased algorithms., 24 pages, one figure. An extended two-page abstract of this work will appear in proceedings of the Genetic and Evolutionary Computation Conference, GECCO'19

Ternary content-addressable memory gives an address at the output after searching for the word that is provided at the input. The word ternary means that the said memory is capable of storing ‘X’ which represents the presence of ‘1’ as well as ‘0’. Gate-based area efficient TCAM (G-AETCAM) uses flip-flops as storing media in the form of storing as well as masking element. These flip-flops are millions in number in the latest FPGA devices and are used only 1% in implementing G-AETCAM of size 64×36. In this paper, we have initialized the flip-flops to some binary value (‘1’ or ‘0’). Technically, these flip-flops are made SET when we want to initialize it by ‘1’ and are made CLEAR if we need to store ‘0’ in the corresponding storing or masking element. The said algorithm of initialization is implemented successfully on Xilinx Virtex-6 FPGA for 64×36 configuration which resulted in 3.45% decrease in power consumption and 0.83% increase in speed of the whole architecture.

This paper presents a new and fast binary descriptor for image matching learned from Haar features. The training uses AdaBoost; the weak learner is built on response function for Haar features, instead of histogram-type features. The weak classifier is selected from a large weak feature pool. The selected features have different feature type, scale and position within the patch, having correspond threshold value for weak classifiers. Besides, to cope with the fact in real matching that dissimilar matches are encountered much more often than similar matches, cascaded classifiers are trained to motivate training algorithms see a large number of dissimilar patch pairs. The final trained output are binary value vectors, namely descriptors, with corresponding weight and perceptron threshold for a strong classifier in every stage. We present preliminary results which serve as a proof-of-concept of the work.

Steganography is a fundamental and foremost approach used to ensure confidentiality of secret data. It is an art which ensures invisible communication by concealing secret information in cover media through scientific techniques. The text steganography faces a great challenge in security, robustness and size of stego text. In current studies, an improved, lightweight, secure, robust and size efficient technique is proposed for text steganography that also enhances the performance of existing approaches. To achieve the objectives, the algorithm applies a conditional bitcomplement function on binary value of confidential information. Moreover, start and end bits are also inserted during embedding secret information in cover text, confirming the integrity and confidentiality of secret data. Experimental results reveal that projected approach is more robust and secure without any stego key overhead. Furthermore, it has successfully achieved a size efficient stego text. Therefore, the secret information is harder to track.

Objective: It is necessary to improve the predictive accuracy of binary logistic regression analysis. This study aimed to clarify whether binary logistic regression analysis using Functional Independence Measure (FIM) gain (a 0/1 binary value) as a dependent variable increases the predictive accuracy when FIM at admission (FIMa) is categorized or when multiple predictive formulae are created. Methods: The study population consisted of 2,542 stroke patients admitted to convalescent rehabilitation wards in Japan. We compared the predictive accuracy of FIM gain between a formula using FIMa as quantitative data (A), a formula that categorized FIMa into 4 groups (B), and two predictive formulae (C). Result: The predictive accuracy of these formulae, in descending order, was found to be C (76.3%), B (76.0%), and A (68. 4%). Conclusion: Even more than using FIMa as quantitative data, the predictive accuracy of FIM gain was heightened by either categorizing FIMa into 4 groups or by creating two predictive formulae.

This paper presents a solution to design and implement a hardware error detection and correction circuit using associative memories. This type of memory allows search of a binary value stored, having input data a partial (or modified) amount of this value. This property can be used in communication, for detection and correction of errors. In our analysis, the obtained experimental results were compared with performances of other hardware systems.

This paper presents a relaxation labeling technique with newly defined compatibility measures for solving a general non-rigid point matching problem. In the literature, there exists a point matching method using relaxation labeling, however, the compatibility coefficients always take a binary value zero or one depending on whether a point and a neighboring point have corresponding points. Our approach generalizes this relaxation labeling approach. The compatibility coefficients take n-discrete values which measures the correlation between edges. We use log-polar diagram to compute correlations. Through simulations, we show that this topology preserving relaxation method improves the matching performance significantly compared to other state-of-the-art algorithms such as shape context, thin plate spline-robust point matching, robust point matching by preserving local neighborhood structures and coherent point drift.

To find an appropriate feature representation in the biclustering of symptom-herb relationship in Chinese medicine (CM). Four different representation schemes were tested in identifying the complex relationship between symptoms and herbs using a biclustering algorithm on an insomnia data set. These representation schemes were effective count, binary value, relative success ratio, or modified relative success ratio. The comparison of the schemes was made on the number and size of biclusters with respect to different threshold values. The modified relative success ratio scheme was the most appropriate feature representation among the four tested. Some of the biclusters selected from this representation scheme were known to follow the therapeutic principles of CM, while others may offer clues for further clinical investigations.

Submitted by Guilherme Lemeszenski (guilherme@nead.unesp.br) on 2013-08-22T18:50:18Z No. of bitstreams: 1 S0100-69162011000100004.pdf: 154998 bytes, checksum: 96ede81f57f30c02484ef989b3649bc5 (MD5) Made available in DSpace on 2013-08-22T18:50:18Z (GMT). No. of bitstreams: 1 S0100-69162011000100004.pdf: 154998 bytes, checksum: 96ede81f57f30c02484ef989b3649bc5 (MD5) Previous issue date: 2011-02-01 Made available in DSpace on 2013-09-30T19:41:14Z (GMT). No. of bitstreams: 2 S0100-69162011000100004.pdf: 154998 bytes, checksum: 96ede81f57f30c02484ef989b3649bc5 (MD5) S0100-69162011000100004.pdf.txt: 28821 bytes, checksum: 4927bf55fdca1503dd7fced886c9cc91 (MD5) Previous issue date: 2011-02-01 Submitted by Vitor Silverio Rodrigues (vitorsrodrigues@reitoria.unesp.br) on 2014-05-20T15:10:53Z No. of bitstreams: 2 S0100-69162011000100004.pdf: 154998 bytes, checksum: 96ede81f57f30c02484ef989b3649bc5 (MD5) S0100-69162011000100004.pdf.txt: 28821 bytes, checksum: 4927bf55fdca1503dd7fced886c9cc91 (MD5) Made available in DSpace on 2014-05-20T15:10:53Z (GMT). No. of bitstreams: 2 S0100-69162011000100004.pdf: 154998 bytes, checksum: 96ede81f57f30c02484ef989b3649bc5 (MD5) S0100-69162011000100004.pdf.txt: 28821 bytes, checksum: 4927bf55fdca1503dd7fced886c9cc91 (MD5) Previous issue date: 2011-02-01 Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) As crescentes demandas e exigências dos mercados consumidores pelo bem-estar das aves nos aviários têm motivado diversas pesquisas científicas a monitorar e a classificar o bem-estar em função do ambiente de criação. Diante da complexidade com que as aves interagem com o ambiente do aviário, a correta interpretação dos comportamentos torna-se uma importante maneira para estimar o bem-estar dessas aves. Este trabalho criou modelos de regressão logística múltipla capazes de estimar o bem-estar de matrizes pesadas em função do ambiente do aviário e dos comportamentos expressos pelas aves. No experimento, foram observados diversos comportamentos expressos por matrizes pesadas alojadas em câmara climática sob três temperaturas controladas e diferentes concentrações de amônia do ar monitoradas diariamente. A partir da análise dos dados, foram obtidos dois modelos de regressão logística, dos quais, o primeiro modelo utiliza um valor de concentração de amônia medida por equipamento, e o segundo modelo utiliza um valor binário para classificar a concentração de amônia, que é atribuída por uma pessoa através da sua percepção olfativa. As análises dos modelos mostraram que ambos classificaram satisfatoriamente o bem-estar. The increasing demand of consumer markets for the welfare of birds in poultry house has motivated many scientific researches to monitor and classify the welfare according to the production environment. Given the complexity between the birds and the environment of the aviary, the correct interpretation of the conduct becomes an important way to estimate the welfare of these birds. This study obtained multiple logistic regression models with capacity of estimating the welfare of broiler breeders in relation to the environment of the aviaries and behaviors expressed by the birds. In the experiment, were observed several behaviors expressed by breeders housed in a climatic chamber under controlled temperatures and three different ammonia concentrations from the air monitored daily. From the analysis of the data it was obtained two logistic regression models, of which the first model uses a value of ammonia concentration measured by unit and the second model uses a binary value to classify the ammonia concentration that is assigned by a person through his olfactory perception. The analysis showed that both models classified the broiler breeder's welfare successfully. Universidade Estadual Paulista Universidade Estadual Paulista

Background: National surveys in public health nutrition commonly record the weight of every food consumed by an individual. However, if the goal is to identify whether individuals are in compliance with the 5 main national nutritional guidelines (sodium, saturated fats, sugars, fruit and vegetables, and fats), much less information may be needed. A previous study showed that tracking only 2.89% of all foods (113/3911) was sufficient to accurately identify compliance. Further reducing the data needs could lower participation burden, thus decreasing the costs for monitoring national compliance with key guidelines. Objective: This study aimed to assess whether national public health nutrition surveys can be further simplified by only recording whether a food was consumed, rather than having to weigh it. Methods: Our dataset came from a generalized sample of inhabitants in the United Kingdom, more specifically from the National Diet and Nutrition Survey 2008-2012. After simplifying food consumptions to a binary value (1 if an individual consumed a food and 0 otherwise), we built and optimized decision trees to find whether the foods could accurately predict compliance with the major 5 nutritional guidelines. Results: When using decision trees of a similar size to previous studies (ie, involving as many foods), we were able to correctly infer compliance for the 5 guidelines with an average accuracy of 80.1%. This is an average increase of 2.5 percentage points over a previous study, showing that further simplifying the surveys can actually yield more robust estimates. When we allowed the new decision trees to use slightly more foods than in previous studies, we were able to optimize the performance with an average increase of 3.1 percentage points. Conclusions: Although one may expect a further simplification of surveys to decrease accuracy, our study found that public health dietary surveys can be simplified (from accurately weighing items to simply checking whether they were consumed) while improving accuracy. One possibility is that the simplification reduced noise and made it easier for patterns to emerge. Using simplified surveys will allow to monitor public health nutrition in a more cost-effective manner and possibly decrease the number of errors as participation burden is reduced.

This paper studies a new modification of the anti-synchronization chaos shift keying scheme for the secure encryption and decryption of data. A new concept of the detection of the correct/incorect binary value in the receiver is used. The method proposed here requires very reasonable amount of data to encrypt and time to decrypt a single bit. Basically, to encrypt a single bit, only one iteration is needed. Moreover, the security of this method is systematically investigated showing its good resistance to typical decryption attacks. Theoretical results are supported by the numerical simulations.

In this paper, the parallel COrdinate Rotation DIgital Computer (CORDIC) rotation algorithm in circular and hyperbolic coordinate is proposed. The most critical path of the conventional CORDIC rotation lies in the determination of rotation directions, which depends on the sign of the remaining angle after each iteration. Using the binary-to-bipolar recoding (BBR) and microrotation angle recoding techniques, the rotation directions can be predicted directly from the binary value of the initial input angle. The original sequential CORDIC rotations can be divided into two phases where the rotations in each phase can be executed in parallel. Our proposed architectures have a more regular and simpler prediction scheme compared to previous approaches. The critical path delay is reduced since the concurrently predicted rotations can be combined using multioperand carry-save addition structures.

Background: Auditory verbal hallucinations (AVH) do not have uniform pathological significance. They affect patients with different brain disorders, and vary along multiple phenomenological dimensions. Evidence indicates that some of the phenomenological variables have specific neural substrates. Therefore, a comprehensive characterization of the phenomenological variations of AVH and the interrelationship between these variables was undertaken. Method: Twenty phenomenological variables were identified; on each AVH had a binary value (present or absent). Information about 11 of these variables were obtained from 30 patients. Hierarchical cluster (HC) and multidimensional scaling (MDS) analyses were performed to investigate the hidden structure and dimensions of these variables. Results: HC yielded two main clusters with further sub-clusters in each. The first cluster included hallucinations with low linguistic complexity, repetitive content, attributed to self, located in outer space, and associated with different kinds of control strategies. The second cluster included hallucinations with high linguistic complexity, systematized content, multiple voices, attributed to others, and located in inner space. In MDS, three dimensions were identified: linguistic complexity, self-other attribution, and inner-outer space location. Conclusion: The patterns of clustering and dimensional configuration of AVH characteristics were in accord with intuitive expectation and validated the patients' descriptions of their experiences. These findings could reflect aspects of the neural mechanisms of AVH. For example, the presence of neural specificity for each phenomenological variable, intermediate neural commonality for groups of variables, and a final common pathway for all subtypes of AVH. Another example is a differential level of language dysfunction according to the linguistic complexity of AVH.

Thresholding is a very important labeling operation on a gray-scale image. It refers to setting all the gray levels below a certain level to binary value 0; above that certain level to binary value 1. Given the histogram of one N × N image, this paper presents a constant-time thresholding on a reconfigurable mesh (RM). Suppose h ≤ N, where h is the number of observed gray levels in the image; then the thresholding can be performed in O(1) time on an N × N RM, and it meets the real-time demand.

This paper discusses the forgery detection problem in meteorological facsimile maps via the intrinsic features of these maps. Meteorological facsimile maps are of much importance to navigation in ocean. Once the meteorological facsimile maps are tampered, the safety of ships will be possibly greatly decreased because of possible disaster by execrable weather. We exploited the problem to detect the possible forgeries by the intrinsic features of meteorological facsimile maps such as binary value, fixed form, sparseness and rationally- developing weather system and so on. Experiments show that the forgeries can be detected effectively in meteorological facsimile maps via the proposed intrinsic features.

Tracking the object of interest within a camera's view is essential for crime prevention. This study focuses on analyzing video surveillance in public places. It presents a novel approach to track moving objects across non-overlapping cameras' views that is able to give a consistent label to the objects throughout the whole multi-camera system in real-time. The proposed algorithm is also expected to be able to handle common problems in multiple-camera object tracking including variation of poses, object appearances and occlusion problems. The proposed algorithm was formulated based on visual and temporal cues for multiple cameras using entering/exiting and merging/splitting cases to deal with appearance changes and occlusion problems. Spatial cues are adopted in single-camera object tracking for real-time performance. A novel object segmentation technique based on the observed mask binary value is presented to deal with pose variation across different cameras. In the result section, the comparison between past works and the proposed tracking algorithm are presented. The experimental results show that the algorithm is able to give an optimal trade-off between accuracy and speed.

How do we make decisions when confronted with several alternatives (e.g., on a supermarket shelf)? Previous work has shown that accumulator models, such as the drift-diffusion model, can provide accurate descriptions of the psychometric data for binary value-based choices, and that the choice process is guided by visual attention. However, the computational processes used to make choices in more complicated situations involving three or more options are unknown. We propose a model of trinary value-based choice that generalizes what is known about binary choice, and test it using an eye-tracking experiment. We find that the model provides a quantitatively accurate description of the relationship between choice, reaction time, and visual fixation data using the same parameters that were estimated in previous work on binary choice. Our findings suggest that the brain uses similar computational processes to make binary and trinary choices.

An enhancement algorithm for weather fax map with zero-mean Gaussian noise is proposed based on BEMD and self features of meteorological facsimile maps. First decompose the noised meteorological facsimile map to IMF 1 and a residue, then estimate the variance of the noise via BEMD and IMF 1 through the intrinsic relation between the variances of IMF 1 and the noise. According to the current time and location of the ship and the frequency loaded in the meteorologic electrograph, the type and the geographic information of the meteorological facsimile map is obtained. Then the noised map subtracts the geographic information after map matching. Last perform non-local mean filtering and binary value optimization on key words and marks to obtain the refined map. Experiments prove that the proposed algorithm has better performance for the enhancement of meteorological facsimile maps.

Mining weighted based association rules has received a great attention and consider as one of the important area in data mining. Most of the items in transactional databases are not always carried with the same binary value. Some of them might associate with different level of important such as the profit margins, weights, etc. However, the study in this area is quite complex and thus required an appropriate scheme for rules detection. Therefore, this paper proposes a new measure called Weighted Support Association Rules (WSAR*) measure to discover the significant association rules and Weighted Least Association Rules (WELAR) framework. Experiment results shows that the significant association rules are successfully mined and the unimportant rules are easily differentiated. Our algorithm in WELAR framework also outperforms the benchmarked FP-Growth algorithm.

TheDistributed Consensus problem involvesn processors each of which holds an initial binary value. At mostt processors may be faulty and ignore any protocol (even behaving maliciously), yet it is required that the nonfaulty processors eventually agree on a value that was initially held by one of them. We measure the quality of a consensus protocol using the following parameters; total number of processorsn, number of rounds of message exchanger, and maximal message sizem. The known lower bounds are respectively 3t + 1,t + 1, and 1.

Byzantine Agreement is important both in the theory and practice of distributed computing. However, protocols to reach Byzantine Agreement are usually expensive both in the time required as well as in the number of messages exchanged. In this paper, we present a self-adjusting approach to the problem. The Mostly Byzantine Agreement is proposed as a more restrictive agreement problem that requires that in the consecutive attempts to reach agreement, the number of disagreements (i.e., failures to reach Byzantine Agreement) is finite. For t faulty processes, we give an algorithm that has at most t disagreements for 4t or more processes. Another algorithm is given for n ≥ 3t + 1 processes with the number of disagreements below t2/2. Both algorithms use O(n3) message bits for binary value agreement.

The respondents of this study were the workers of the three big malls in Davao City: NCC, Gaisano Mall and SM City. The respondents were then grouped as frontliners (baggers, checkers and cashiers) and office staff. The dummy variables were used to represent groupings of the respondents such as catholics and non catholics, for male and female, for married and those who were not. Also, the dependent variable used a binary value to represent the likelihood of the respondents as gender sensitive or otherwise given the respondents characteristics. The empirical estimation showed that education affects the gender sensitivity of an employee at the workplace.Two of the factors showed an estimated sign of the coefficient contrary to expectations: sex (male or female), and occupation. Surprisingly, when education was used to forecast the probability of a respondent’s sensitivity, it resulted into a decline in the gender awareness.

In this work we consider a distributed system formed by a master processor and a collection of n processors (workers) that can execute tasks worker processors are untrusted and might act maliciously. The master assigns tasks to workers to be executed. Each task returns a binary value, and we want the master to accept only correct values with high probability. Furthermore, we assume that the service provided by the workers is not free for each task that a worker is assigned, the master is charged with a work-unit. Therefore, considering a single task assigned to several workers, our goal is to have the master computer to accept the correct value of the task with high probability, with the smallest possible amount of work (number of workers the master assigns the task). We explore two ways of bounding the number of faulty processors: (a) we consider a fixed bound f < n/2 on the maximum number of workers that may fail, and (b) a probability p < 1/2 of any processor to be faulty (all processors are faulty with probability p, independently of the rest of processors). Our work demonstrates that it is possible to obtain high probability of correct acceptance with low work. In particular, by considering both mechanisms of bounding the number of malicious workers, we first show lower bounds on the minimum amount of (expected) work required, so that any algorithm accepts the correct value with probability of success 1 - ε, where ε ≪ 1 (e.g., 1/n). Then we develop and analyze two algorithms, each using a different decision strategy, and show that both algorithms obtain the same probability of success 1 - ε, and in doing so, they require similar upper bounds on the (expected) work. Furthermore, under certain conditions, these upper bounds are asymptotically optimal with respect to our lower bounds. © 2006 IEEE. 39 48 Sponsors: IEEE Comput. Soc. Technical Committee on Distributed Processing Conference code: 71348 Cited By :20

This chapter focuses on the programs that are designed to enable the user to gain experience and confidence in using a few of the more easily understandable advanced programming instructions. A simple counting system, in which a push button simulates pulses coming from a transducer, will be produced. In an industrial application, the transducer could be monitoring the rotation of a toothed gear wheel connected to, for example, a conveyor system. It illustrates a diagram to show, pulses being fed into the PLC, to be counted, and displayed as an incrementing binary value on the Y Outputs, Y0-Y7. The chapter monitors and examines the industrial application of COUNT4, MIXER1, and RPM- counter REV1A.

In this chapter we apply communication complexity to obtain methods for proving lower bounds on the complexity measures of VLSI circuits. A VLSI circuit is a more powerful computing model than the Boolean circuit model. While the gates (processors) of VLSI circuits are as simple as the gates of Boolean circuits, the communication structure (the graph describing the connections between processors) of VLSI circuits may contain cycles. This requires that a computation of a VLSI circuit be considered as an alternating sequence of synchronized steps C1, D1, C2, D2 ..., where Ci are communication steps and Di are working steps. In every communication step each directed edge (p 1, p 2) (communication link) transfers a binary value as the output of the processor pl to the processor p2. In every working step each node (processor) of the VLSI circuit computes outputs according to the values of its inputs. This contrasts to the Boolean circuits, where each processor and each directed edge were at most once active in the whole computation on an input. The main complexity measures of the VLSI circuit model are layout area A and time T (the number of working steps) . Since many computing problems may be solved with small area A if one allows a large time T and with small T if one allows relatively large A, one prefers to consider tradeoffs of complexity measures like A. T, A• T2 in order to objectify the measurement of the hardness of computing problems.

The Distributed Consensus problem involves n processors each of which holds an initial binary value. At most t processors may be faulty and ignore any protocol (even behaving maliciously), yet it is required that the non-faulty processors eventually agree on a value that was initially held by one of them. This paper presents consensus protocols that tolerate arbitrary faults, are early-stopping (i.e., run for a number of rounds proportional to the number of faults f that actually occur during their execution), and are optimal in various measures.

This paper describes a systematic construction method of Run Length Limited (RLL) codes for the purpose of getting higher recording density realized. The continuous number of a binary value in the RLL code is restricted to not less than d and not greater than k in NRZL notation by converting a data word of m-bit to a codeword of n-bit. This method comprises; a) equations for calculating the number of the codewords; b) rules for selecting codewords; c) rules for concatenating the codewords. Various kinds of fixed length or variable length RLL codes have been gotten under the conditions of d= 1, 2, ···, 6, k= d+1, ···, 15 in NRZL expression, and n= d+1, ···, 32.

The focus of the present paper is on the relations between the set D of optimal solutions of a maximum weighted stable set problem, and the set C of optimal solutions of its continuous relaxation. The main result is that if a variable takes a constant binary value in all$\hat X \in C$, then it takes the same value in all$\hat X \in D$ (this may be contrasted with a well-known result of Nemhauser and Trotter, stating that if a variable takes a binary value in some$\hat X \in C$, then it takes the same value in some$X \in D$). For any graph G, the set P of the vertices j such that $\hat X_j $ has a constant binary value in all$\hat X \in C$, can be efficiently detected; moreover, the results in this paper imply that in the unweighted case, the subgraph induced by P has the “strong” Konig–Egervary property and that the subgraph induced by the complement of P has a perfect 2-matching: actually, the maximum stable sets of G are in a 1-to-1 correspondence with those of the latter subgraph.

It is proved that the Toeplitz binary value matrix inversion associated with mth-order B-spline interpolation can be implemented using only 2(m+1) additions. Pipelined architectures are developed for real-time B-spline interpolation based on simple running average filters. It is shown that an ideal interpolating function, which is approximated by a truncated sinc function with M half cycles, can be implemented using B-splines with M+2 multiplies. With insignificant loss of performance, the coefficients at the knots of the truncated sinc function can be approximated using coefficients which are powers of two. The resulting implementation requires only M+4m+6 additions. It is believed that the truncated sinc function approximated by zero-order B-spline functions actually achieves the best visual performance. >

Byzantine Agreement involves a system of n processes, of which some t may be faulty. The problem is for the correct processes to agree on a binary value sent by a transmitter that may itself be one of the n processes. If the transmitter sends the same value to each process, then all correct processes must agree on that value, but in any case, they must agree on some value. An explicit solution not using authentication for n = 3t + 1 processes is given, using 2t + 3 rounds and O(t3 log t) message bits. This solution is easily extended to the general case of n ⩾ 3t + 1 to give a solution using 2t + 3 rounds and O(nt + t3 log t) message bits.

The Byzantine generals problem involves a system of n processes, t of which may be unreliable. The problem is for the reliable processes to agree on a binary value sent by a general which may itself be one of the n processes. If the general sends the same value to each process, then all reliable processes must agree on that value, but in any case, they must agree on the same value. An explicit solution is given for a binary value among n=3t+1 processes, using 2t+4 rounds and o(t/sup 3/ log t) message bits, where t bounds the number of faulty processes. This solution is easily extended to the general case of n>3t+1 to give a solution using 2t+5 rounds and o(tn+t/sup 3/ log t) message bits. 5 references.

As has already been mentioned in Section 4.8, the digits of decimal numbers can be separately represented in binary form. The highest binary value occurring in this presentation is 1 0 0 1 (9). The values 1 0 1 0 to 1 1 1 1 are thus not used.