Binary Scheme Research Articles

EAST TRYPILLIA AND WEST TRYPILLIA CULTURES: MYTH OR REALITY?

Problems of culturogenesis and structure of the cultural complex of Trypillia-Сucuteni become relevant in the last decades of the XXth century. The emergence of new sources and methods encourages researchers to understand the phenomenon of Trypillia-Сucuteni on a new level. There is a noticeable tendency to single out individual archaeological cultures instead of structural subdivisions of the cultural community at the turn of the XX—XXIth centuries. The binary scheme of the division of the Trypillia culture into the «East Trypillia» and «West Trypillia» cultures became popular in the national Trypillia studies. However, such an «innovation» is not sufficiently substantiated both at the level of methodological principles and analysis of specific materials. Elucidation of the real structure of the cultural complex of Trypillia-Сucuteni shows its versatility and proves the artificiality of its division into two archaeological cultures, which is proposed by O. V. Tsvek and S. M. Ryzhov.
 The division of the Trypillia-Сucuteni cultural complex into separate archeological cultures (two or more) is impossible until its final stage CII, because almost all its structural units are selected on the basis of ceramic traditions, and the other parameters (character of house-building, tools producing, sacred tradition) are more or less the same. All structural units combine a genetic link with the Precucuteni-Trypillya A times, which demonstrates all the features of the Trypillia-Сucuteni cultural complex as a whole, with the exception of ceramic traditions. These traditions are the most dynamic, act as an indicator of the cultural identity of certain groups of the population and reflect the structure of the cultural complex.
 The structure of the cultural complex Trypillia-Сucuteni is a spatio-temporal continuum, its complexity is due to dynamic and multifaceted processes of internal transformations of individual units of the structure, the interaction of traditions and innovations, constant contacts between them, the movement of specific groups, their interaction with surrounding cultural complexes. The binary concept of the «East Trypillia» and the «West Trypillia» cultures, which became too popular today, is an artificial construction and does not reflect the real structure of Trypillia Culture.

Recursive Process for Constructing the Refinement Rules of New Combined Subdivision Schemes and Its Extended Form

In this article, we present a new method to construct a family of2N+2-point binary subdivision schemes with one tension parameter. The construction of the family of schemes is based on repeated local translation of points by certain displacement vectors. Therefore, refinement rules of the2N+2-point schemes are recursively obtained from refinement rules of the2N-point schemes. Thus, we get a new subdivision scheme at each iteration. Moreover, the complexity, polynomial reproduction, and polynomial generation of the schemes are increased by two at each iteration. Furthermore, a family of interproximate subdivision schemes with tension parameters is also introduced which is the extended form of the proposed family of schemes. This family of schemes allows a different tension value for each edge and vertex of the initial control polygon. These schemes generate curves and surfaces such that some initial control points are interpolated and others are approximated.

Method and Algorithm for Implementation of Decoding Operation in the Threshold Cryptomodule of Secret Separation Using a Minimally Redundant Modular Number System

The article presents a new development of method and algorithm for performing secret separation in a threshold cryptomodule with masking transformation of the decoding operation. To solve this problem a recursive binary exponent division scheme and computational technology on the ranges of large numbers of the table-adder type, based on minimally redundant modular arithmetic (MRMA) are applied. A distinctive feature of the developed approach is usage the secret-original domain of finite residue rings for modules that have the form of powers of the number 2. This significantly reduces the complexity of the resulting decoding MRMA-procedure. Decomposition of scalable residues into large modules allows you to efficiently map the computational process being implemented to sets of easily implemented data extraction operations from table memory and their summation, providing a high level of performance, uniformity, and unification of basic structures. In terms of speed, the created MIMA decoding algorithm surpasses non-redundant analogues by at least l(19l-3)/(22l-6) times (l is the number of subscribers restoring the secret original). When l = 7...40 a (6.15...34.65)-fold increase in productivity is achieved.

����� ��������� � ������� �������� ��������� ����� ���� ������������ �������.

In conditions of constant displays of aggression in various fields of activity, which is one of the most acute problems of our time, corresponding preventive measures are becoming increasingly important. In its turn, it requires the improvement of the methodological support for decision-making to ensure security and counter various kinds of attacks. At the present stage, the remaining slowness of identification of incidents and determining the scale of their devel-opment is a characteristic feature of security management. Methodological complexity of the procedures for assessing security risks and corresponding calculations is stipulated by the lack of appropriate methods, software and technologies on the market, which complicates the devel-opment of automated decision support tools. This paper offers a universal method based on a formalized model of the relationship between objects (resources), aimed at them threats and expected risks. This model is based on the �threat � object� binary scheme expressed in a bipar-tite graph and provides for the division of the graph into subgraphs. There is built another (third) set that corresponds to the safety model with full overlap and protection mechanisms as well. Simultaneous utilization of the elements of ontological descriptions increases the level of the method concreteness and a clearer understanding of the environment state. A matrix ap-proach, which is closely related to graph models, is proposed for computations. The article pro-vides some schemes of technological implementation of the obtained solutions based on office applications and designing a corresponding information and analytical system. The proposed method can be applied in automated systems in many fields of activity.

Gender, sexual diversity and field education: “in rural communities many people do not understand and treat it as a disease"

The present study aimed to discuss issues of gender, sexual diversity, gender diversity and Rural Education. The (auto) biographical narratives were used as the methodological path, and the narrative interview as an instrument of data collection, allowing the interviewees to narrate their life story, placing themselves as protagonists of the investigation process. Thus, we emphasize that the interviewees were two gay university students, who live in the countryside. From the study, the need to problematize the dialogue around issues of gender and sexual diversity in Rural Education was noticeable. It is necessary to break binary schemes around issues that involve sexuality, mature reflections around queer bodies, aiming in fact to know how these issues are addressed in the training processes of rural communities and how much, through these processes, can be done in the sense to contribute to acceptance, I respect the plurality that exists among society, in order to decolonize / deconstruct the rules imposed and taken as standards.

Death Stranding, Гоббс и проблема социального порядка: куда (и как) нести Суверена?

In this article I describe the implicit conceptualization of social order which exists in Death Stranding — localized in both the setting and the mechanics of the game — and compare it with the conceptualization of Thomas Hobbes’s “Leviathan”. First, the theoretical tension between Death Stranding and “Leviathan” is traced: the speculative conceptualization of the Leviathan and the procedural conceptualization of Death Stranding are compared by clarifying the role that the concepts of action, authorization, right and sovereignty play in Hobbesian theory and the video game. Sec­ondly, the theoretical tension between the political and natural capacities of the Sovereign according to Hobbes is explicated; with the help of mate­rial from Death Stranding, a variant of its resolution is proposed, suggest­ing the conceptualization of the Sovereign-without-a-body: an instance devoid of physical capacity and materiality, yet still capable of maintaining social order as a product of its activity. Subsequently, attention is paid to the mechanics of state expansion in Death Stranding: I describe and analyze how the Sovereign-without-a-body’s messenger — the protagonist of the video game — interacts with people outside the Sovereign’s zone of influ­ence, convincing them to consent to return to the commonwealth. This theoretical move makes it possible to supplement Hobbes’s binary scheme of the state of nature and commonwealth with a third concept — the state of memory, in which the memory of the Sovereign turns out to be a deci­sive factor influencing whether the commonwealth will be restored to its former boundaries. By explicating the Hobbesian theory of imagination, I demonstrate that — in the state of memory — the Sovereign is contingent, not fully defined, and virtual.

THz PAM-4 signal generation by a modulator driven by binary scheme with different driving voltages

Abstract We propose a novel method of THz 4-ary pulse amplitude modulation (PAM-4) signal generation by a modulator driven by binary scheme with different driving voltages without a digital-to-analog converter (DAC). We experimentally demonstrate the transmission over 1-m wireless link employing 4-GBaud PAM-4 signal at 400–450-GHz in the photonics aided wireless terahertz-wave system. A cost-effective solution to THz PAM-4 signal generation is proposed with both low power consumption and simple configuration.

A two-stage approach to the optimization design of multi-cell square tubal structures

Multi-cell tubal structures have widely been used in the automobile industry due to proven superior crashworthiness performance than single-cell and foam-filled tubes. This superior performance is attributed to the number of corners within the cross-sectional profile of the tube. In this paper, a two-stage optimization design of a multi-cell tubal structure is presented to address an important design problem by combining a discrete and continuous optimization process into a sequential optimization that generates an overall optimum. The first stage entails a configurational optimization which is realized by formulating a discrete topological optimization problem where the webs within the tube configuration are taken as the topological design variables. Each topological configuration is represented using a binary scheme that shows the presence or not of an edge to create different combinations of the corners. The constraints in the first stage are connectivity, mass ratio, and peak crushing force (PCF). The binary genetic algorithm (BGA) is utilized in searching for the optimal configuration in the first stage. The second stage entails parameter optimization where the cell sizes are the design variables. The objective functions in the second stage are defined using meta-models. Multi-objective particle swarm optimization (MOPSO) is employed for Pareto searching and Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) is used to find the optimal point for each of the mass ratios considered. Compared with the baseline configuration, the optimized tubal structures demonstrated superior crashworthiness performance. The two-stage discrete and continuous optimization approach has demonstrated that it not only provides a systematic approach to searching optimal structure but also creates a series of novel multi-cell topological configurations with enhanced crashworthiness.

"Cuéntame tus testosteronas": Un análisis sobre las regulaciones para jugadorxs transgénero e hiperandrógenas

In this work we will problematize the speeches of truth that operate in modern sports institutions in the case of transgender and hyper-androgynous people. For this purpose, we will use as a source the latest resolution of the International Olympic Committee (2015) referring to these types of athletes. We are interested in investigating what is hidden about the speeches that are raised in the name of the fair competition, "fear competition". Through a discursive analysis, and through the contributions of queer theory, we will seek to analyze the truth discourses that circulate in the regulation, which bodies and subjects do you enable? Which ones are denied? In a second moment, we will focus on the effective application of the resolution in argentinean cases of hockey players who are not highly competitive, how is the operalization in the regulations of amateur sports? What negotiations and resistance are possible? Is there a violation of rights? We believe that while the resolution considered makes visible for the first time, situations of athletes who compete in high performance and break with the male / female dichotomy; It does not end up overcoming the dominant senses with which sports were built. It maintains a biomedical look to think bodies and although it explicitly recognizes the diversity of generic identities, the proposed measures are far from getting out of the binary scheme. Each recommendation suggests that athletes conform to a female or male category. If the focal point was on genitality before, it is currently focused on hormonal control, in both situations under the application of body control technologies whose purpose is to discipline it. All in all, we consider that being able to review what happens in our local contexts with the demands of dissident groups allows us to rethink our institutions and provide a critical look at the deconstruction and reconstruction of sports for all.

Adaptive Secure Nearest Neighbor Query Processing Over Encrypted Data

Nearest neighbor query processing is a fundamental problem that arises in many fields such as spatial databases and machine learning. This article aims to address the Secure Nearest Neighbor (SNN) problem in cloud computing. Prior SNN schemes are both insecure and inefficient. In this article, we formally prove and experimentally demonstrate that the SNN scheme ASPE is actually insecure against even ciphertext only attacks. Although prior work proved that it is impossible to construct an SNN scheme even in much relaxed standard security models, we point out the flaws of the hardness proof. We propose an SNN scheme and prove that it is secure against adaptive chosen keyword attacks. Our scheme is efficient as its query processing complexity is logarithmic. To evaluate the efficiency of our SNN scheme, we implemented our scheme in C++ and compared its performance with a plain text scheme, binary scheme, and a PIR scheme on a large set of over 10 million real-world data points. Experimental results show that our scheme is fast (0.124 millisecond per query when data set size is 10 million) and scalable in terms of the number of data points.

Finger Forwarding Scheme to Reduce Lookup Cost in Structured P2P Networks

Peer-to-peer (P2P) networks are distributed systems where each user shares his resources and cooperates with other users. These networks are designed over IP-based infrastructure. The resources of each user in these networks are shared in a distributed way on a trust based mechanism. P2P networks have some unique characteristics like scalability and cost efficiency, which separate these networks from other distributed networks. These networks are mainly used for resource sharing. However, resource searching in this type of networks is not centrally controlled in nature. Further poor search scalability is another limitation of these networks. Chord like or chord-based protocols used in the search operations in P2P networks utilize a finger table to shorten the query search length. We exploit the finger forwarding mechanism in our proposed scheme which further reduces the resource’s search path length. We propose a last finger search table in addition to finger table to enhance the file lookup performance in the structured P2P networks. The proposed scheme reduces the lookup path and increases search efficiency as compared to the existing chord and binary search routing equivalent schemes.

Mimo System using16 Psk and Bpsk Modulation Schemes

Current technology will build on signals mutual independent recurrence Technique(Orthogonal frequency divison multiplexing) and we don’t know the quality of it altogether expanded in numerous inputs numerous yields like Multi Input Multi output , Taking a shot at the same objective we use the LDPC based MIMO-OFDM with 16PSK and Binary modulation schemes. The bit error rate is checked so that we identify the which scheme is best.

W-band PAM4 signal generation by a modulator driven by binary scheme with different driving voltage

We propose a novel W-band pulse amplitude modulation-4 (PAM4) signal generation to simplify the complexity of central office (CO), remote access unit (RAU) and wireless terminals. Only one dual-polarization Mach–Zehnder Modulator (DP-MZM) is used and no extra optical link is occupied. Moreover, multi-level digital-to analog converter (DAC) is not necessary. In this paper, we theoretically analyze and experimentally demonstrate the proposed method. After 1 m wireless propagation, the 84 GHz W-band signal can carry up 10 G baud data with a bit error rate (BER) less than the hard-decision forward error correction (HD-FEC) threshold of 3.8×10-3 with the photodiode (PD) input power of 0 dBm.

Harmonic Index t-Designs in the Hamming Scheme for Arbitrary q

The notion of T-design in a symmetric association scheme was introduced by Delsarte. A harmonic index t-design is the particular case in which the index set T consists of a single index $$\{t\}$$. Zhu et al. studied a harmonic index t-design in the binary Hamming scheme and gave a Fisher type lower bound on the cardinality. Also they defined the notion of a tight harmonic index design using the bound, and considered the classification problem. In this paper, we extend their results to the general Hamming scheme and improve their Fisher type lower bound slightly. Also using the improved Fisher type lower bound, we redefine the notion of a tight harmonic index design and consider the classification problem. Furthermore, we give a natural characterization for a harmonic index t-design and an analogue in the Hamming scheme for the construction of spherical harmonic index t-designs which was given by Bannai–Okuda–Tagami.

Eigen-based binary feature amalgamation in multimodal biometrics

In this paper, a quantised eigen analysis (QEA) for the extracted features is proposed and an associated eigen-based binary feature amalgamation (EBFA) based on QEA is developed for feature fusion in multimodal biometrics. As opposed to feature combination, EBFA projects heterogeneous features onto the projection kernel and uses only the sign parts to encode the features as bit strings to maximise its expression rather than directly combine them. Thus, the feature codes can be simply concatenated or compared by XOR bit-wise operation into a serial or parallel amalgamated feature vector. To evaluate the performance of EBFA, a series of experiments are performed on multiple biometric modalities, including face, palm-print and iris. The experimental results show that the proposed binary feature amalgamation scheme at feature-level is superior to some other feature fusion methods and score-level methods in terms of multimodal recognition accuracy performance.

McLeish Distribution: Performance of Digital Communications Over Additive White McLeish Noise (AWMN) Channels

The objective of this article is to propose and statistically validate a more general additive non-Gaussian noise distribution, which we term McLeish distribution, whose random nature can model different impulsive noise environments commonly encountered in practice and provides a robust alternative to Gaussian noise distribution. In particular, for the first time in the literature, we establish the laws of McLeish distribution and therefrom derive the laws of the sum of McLeish distributions by obtaining closed-form expressions for their probability density function (PDF), cumulative distribution function (CDF), complementary CDF (C2DF), moment-generating function (MGF) and higher-order moments. Further, for certain problems related to the envelope of complex random signals, we extend McLeish distribution to complex McLeish distribution and thereby propose circularly/elliptically symmetric (CS/ES) complex McLeish distributions with closed-form PDF, CDF, MGF and higher-order moments. For generalization of one-dimensional distribution to multi-dimensional distribution, we develop and propose both multivariate McLeish distribution and multivariate complex CS/ES (CCS/CES) McLeish distribution with analytically tractable and closed-form PDF, CDF, C2DF and MGF. In addition to the proposed McLeish distribution framework and for its practical illustration, we theoretically investigate and prove the existence of McLeish distribution as additive noise in communication systems. Accordingly, we introduce additive white McLeish noise (AWMN) channels. For coherent/non-coherent signaling over AWMN channels, we propose novel expressions for maximum a priori (MAP) and maximum likelihood (ML) symbol decisions and thereby obtain closed-form expressions for both bit error rate (BER) of binary modulation schemes and symbol error rate (SER) of various M-ary modulation schemes. Further, we verify the validity and accuracy of our novel BER/SER expressions with some selected numerical examples and some computer-based simulations.

A Novel Numerical Algorithm to Estimate the Subdivision Depth of Binary Subdivision Schemes

Subdivision schemes are extensively used in scientific and practical applications to produce continuous geometrical shapes in an iterative manner. We construct a numerical algorithm to estimate subdivision depth between the limit curves/surfaces and their control polygons after k-fold subdivisions. In this paper, the proposed numerical algorithm for subdivision depths of binary subdivision curves and surfaces are obtained after some modification of the results given by Mustafa et al in 2006. This algorithm is very useful for implementation of the parametrization.

DIVERSITY SIGNAL PROCESSING OVER WEIBULL FADING CHANNELS

We present a moments-based approach to the performance analysis of L-branch equal-gain combining and maximal-ratio combining receivers, operating in independent or correlated, not necessarily identically distributed, Weibull fading. For both equal-gain combining and maximal-ratio combining receivers the moments of the output signal-to-noise ratio are obtained in closed-form. An accurate approximate expression is derived for the moment-generating function of the output signal-to-noise ratio of the equal-gain combining receiver utilizing the Padé approximants theory, while a closed-form expression for the corresponding MGF of the maximal-ratio combining receiver, is obtained. Significant performance criteria, such as average output signal-to-noise ratio, amount of fading and spectral efficiency at the low power regime, are extracted in closed-forms, using the moments of the output signal-to-noise ratio for both independent and correlative fading. Moreover, using the well-known moment-generating function approach, the outage and the average symbol error probability for several coherent, non-coherent, binary, and multilevel modulation schemes, are studied. The average symbol error probability of dual-branch equal-gain combining and maximal-ratio combining receivers is also obtained when correlative fading is considered in the diversity input branches. The proposed mathematical analysis is illustrated by various numerical results and validated by computer simulations.

Data-Driven Tool Uses Amplitude-Based Statistics To Identify Seismic Fractures

This article, written by JPT Technology Editor Chris Carpenter, contains highlights of paper SPE 191668, “Big Data Analytics for Seismic Fracture Identification Using Amplitude-Based Statistics,” by Egbadon Udegbe, SPE, Eugene Morgan, SPE, and Sanjay Srinivasan, SPE, Pennsylvania State University, prepared for the 2018 SPE Annual Technical Conference and Exhibition, Dallas, 24–26 September. The paper has not been peer reviewed. Data-analysis tools for extracting information about critical subsurface features such as fractures are still evolving. Traditional methods rely on time-consuming iterative work flows, which involve computing seismic attributes, denoising, and expert interpretation. Additionally, the increasingly widespread acquisition of time-lapse seismic surveys has led to heightened demand for reliable automated work flows to assist in deriving feature interpretation from seismic data. The authors present a novel data-driven tool for fast fracture identification in post-stack seismic data•sets. Introduction The paper develops an automated work flow for fast and robust fracture identification that directly uses seismic amplitude data as input. Adapted from real-time face-detection methods, the proposed algorithm computes spatiotemporal amplitude statistics using Haar-like bases to characterize the seismic amplitude properties that correspond to fracture occurrence in a unit window. In this approach, the amplitude data are decomposed into a lower-dimensional collection of simple-to-calculate mini-attributes, which contain gradient and curvature characteristics at varying locations and scales. These features serve as inputs to a cascade of boosted classification trees, which select and combine the most-discriminative features to develop a probabilistic binary classification model. This approach helps to eliminate the computationally intensive and subjective use of seismic attributes in existing approaches. Approach The proposed methodology uses a supervised learning approach. This involves specifying examples of seismic amplitude regions that either contain or do not contain fractures and subsequently presenting these examples to a binary classification scheme that develops a set of rules to distinguish between both fracture and nonfracture windows. Finally, using this trained classification model, any arbitrary amplitude section or volume can be scanned to determine the location of fractures on the basis of the rules defined within the specified window. Training-Window Selection. Careful consideration is required in defining the dimensions of the unit window. In 2D, this unit window is a rectangular region parallel to time and space axes. In 3D, the unit window refers to a cuboidal region with one time and two space axes. The dimensions of the window in the vertical (time) direction are influenced by the time-sampling interval and the source wavelet frequency. In the lateral directions, window dimensions are influenced by the spatial sampling interval, which is a result of the survey acquisition geometry. Overall, smaller unit windows lead to higher resolution in identifying fracture presence. This, however, is achieved at the expense of fewer amplitude features to characterize the window, as well as slower scan speeds, because more regions must be visited to make predictions. Once a seismic amplitude data set with known fracture locations and a unit window with specified dimensions has been established, multiple locations within the data set may be visited and amplitude samples extracted from both fractured and nonfractured regions.

Union Bound Analysis and Code Design for Multilevel Flash Memory Channels

Multilevel flash memories enable multiple bits to be stored in a single memory cell and hence a significant increase of the storage capacity. The multiple bits that are used for labeling the threshold voltage level of a memory cell belong to different pages. A multilevel flash memory channel resembles a multi-user channel with asymmetric noise, while the data of different pages, which are encoded independently, resembles data of multiple users. In this paper, performance analyses are proposed for this channel by using the union bound technique. In particular, we investigated two different binary labeling schemes of a cell level, the Gray labeling and non-Gray labeling with three maximum-likelihood (ML)-based decoding schemes, which are the joint multi-page ML decoding, page-separate ML decoding, and default setting ML decoding. Our analysis reveals an asymptotic diminishing rate of decoding errors as the channel noise approaches zero, based on which the code design criteria are proposed. It is shown theoretically that the Gray mapping has no joint (i.e., multi-page) decoding gain. The corresponding diminishing decoding error rate is dominated by the weakest code in each page and hence a separate decoding scheme is adequate. On the other hand, the non-Gray mapping has a joint decoding gain which means the weak code can exploit the decoding of the strong code and the diminishing rate of its decoding errors is not subject to the cask effect. Therefore, for Gray mapping, a symmetric coding scheme using equal-strength code for each page achieves better error performance, while for non-Gray mapping with joint decoding, the symmetric coding is not necessary. Moreover, by using the asymmetric coding scheme through assigning different code rates to different pages, the non-Gray mapping can achieve higher overall sum rate than Gray mapping with a similar decoding error rate performance.