Search

As the scale of distributed generations connecting to the power system increases continuously, communication system considering the requirements of real-time control is becoming much more important in active distribution system. Therefore, in order to improve the responsiveness of the distribution network during the communication interruption, an offline backup strategy is proposed considering the combined output of distributed generations and energy storage systems involving the characteristics of the active distribution system. Based on a typical set of clusters which describe the features of wind turbines and photovoltaics, the strategy analyses operational vulnerability combining structural characteristics of the active distribution system and solves the output level of each distributed generation according to the improved algorithm. A numerical case study is presented to demonstrate the effectiveness of this model.

A significant body of research in the data sciences considers unfair discrimination against social categories such as race or gender that could occur or be amplified as a result of algorithmic decisions. Simultaneously, real-world disparities continue to exist, even before algorithmic decisions are made. In this work, we draw on insights from the social sciences brought into the realm of causal modeling and constrained optimization, and develop a novel algorithmic framework for tackling pre-existing real-world disparities. The purpose of our framework, which we call the “impact remediation framework,” is to measure real-world disparities and discover the optimal intervention policies that could help improve equity or access to opportunity for those who are underserved with respect to an outcome of interest. We develop a disaggregated approach to tackling pre-existing disparities that relaxes the typical set of assumptions required for the use of social categories in structural causal models. Our approach flexibly incorporates counterfactuals and is compatible with various ontological assumptions about the nature of social categories. We demonstrate impact remediation with a hypothetical case study and compare our disaggregated approach to an existing state-of-the-art approach, comparing its structure and resulting policy recommendations. In contrast to most work on optimal policy learning, we explore disparity reduction itself as an objective, explicitly focusing the power of algorithms on reducing inequality.

Data Analytics is rapidly expanding within the healthcare domain to help develop strategies for improving the quality of care and curbing costs as well. Natural Language Processing (NLP) solutions have received particular attention whereas a large part of clinical data is stockpiled into unstructured physician or nursing notes. In this respect, we attempt to employ NLP to provide an early prediction of the medical specialties at hospital admission. The study uses a large-scale dataset including more than 260K ED records provided by the Amiens-Picardy University Hospital in France. Our approach aims to integrate structured data with unstructured textual notes recorded at the triage stage. On one hand, a standard MLP model is used against the typical set of features. On the other hand, a Convolutional Neural Network is used to operate over the textual data. While both learning components are conducted independently in parallel. The empirical results demonstrated a promising accuracy in general. It is conceived that the study could be an additional contribution to the mounting efforts of applying NLP methods in the healthcare domain.

A new class of structured codes called quasi group codes (QGCs) is introduced. A QGC is a subset of a group code. In contrast with the group codes, QGCs are not closed under group addition. The parameters of the QGC can be chosen, such that the size of $\mathcal {C}+\mathcal {C}$ is equal to any number between $|\mathcal {C}|$ and $|\mathcal {C}|^{2}$ . We analyze the performance of a specific class of QGCs. This class of QGCs is constructed by assigning single-letter distributions to the indices of the codewords in a group code. Then, the QGC is defined as the set of codewords whose index is in the typical set corresponding to these single-letter distributions. The asymptotic performance limits of this class of QGCs are characterized using single-letter information quantities. Corresponding covering and packing bounds are derived. It is shown that the point-to-point channel capacity and optimal rate-distortion function are achievable using QGCs. Coding strategies based on QGCs are introduced for three fundamental multi-terminal problems: the Korner-Marton problem for modulo prime-power sums, computation over the multiple access channel (MAC), and MAC with distributed states. For each problem, a single-letter achievable rate-region is derived. It is shown, through examples, that the coding strategies improve upon the previous strategies based on the unstructured codes, linear codes, and group codes.

Whereas Shannon entropy is related to the growth rate of multinomial coefficients, we show that the quadratic entropy (Tsallis 2-entropy) is connected to their $q$-deformation; when $q$ is a prime power, these $q$-multinomial coefficients count flags of finite vector spaces with prescribed length and dimensions. In particular, the $q$-binomial coefficients count vector subspaces of given dimension. We obtain this way a combinatorial explanation for the nonadditivity of the quadratic entropy, which arises from a recursive counting of flags. We show that statistical systems whose configurations are described by flags provide a frequentist justification for the maximum entropy principle with Tsallis statistics. We introduce then a discrete-time stochastic process associated to the $q$-binomial probability distribution, that generates at time $n$ a vector subspace of $\mathbb{F}_q^n$ (here $\mathbb{F}_q$ is the finite field of order $q$). The concentration of measure on certain "typical subspaces" allows us to extend the asymptotic equipartition property to this setting. The size of the typical set is quantified by the quadratic entropy. We discuss the applications to Shannon theory, particularly to source coding, when messages correspond to vector spaces., Comment: Presented in part at the Latin American Week on Coding and Information 2018 (Campinas, Brazil)

Distributed detection with multiple sensors and a fusion center over binary symmetric channels has been investigated. The fusion center receives noisy observations of the local binary decisions. A fundamental tradeoff between achievable information rate and the error exponent of the missing probability exists. The tradeoff is well characterized by the rate-exponent region. The paper first derived a closed-form analytic expression for the error exponent and information rate by means of the theory of relative entropy typical set. Second, the properties of the optimal error exponent and information rate are discussed in detail. It was demonstrated that they are monotonically decreasing in the bit error probability of the binary symmetric channel. Simulation results validated the conclusions.

In this paper, we propose a practical low delay digital scheme for lossy transmission of a Gaussian source over Gaussian broadcast channel when there is correlated side information at the receivers. Focusing on two receivers scenario, a bit-filling criterion is applied at the transmitter, to establish a connection between the common layer and refinement layer data. Then, we complete the dirty paper coding according to jointly typicality and finally superimpose the two layers for transmission. At the receiver, we propose a modified log-likelihood ratio-belief propagation decoding algorithm to utilize side information. And a typical-set based decoding algorithm is introduced to be an effective supplement if the decoding decision of the successive canceling method fails. Simulated results show that the proposed typical set decoding algorithm plays an excellent part in refinement layer recovery, and on the whole, the proposed digital scheme renders better reconstruction accuracy than the corresponding low delay separate source channel coding.

The existence of the {\em typical set} is key for data compression strategies and for the emergence of robust statistical observables in macroscopic physical systems. Standard approaches derive its existence from a restricted set of dynamical constraints. However, given the enormous consequences for the understanding of the system's dynamics, and its role underlying the presence of stable, almost deterministic statistical patterns, a question arises whether typical sets exist in much more general scenarios. We demonstrate here that the typical set can be defined and characterized from general forms of entropy for a much wider class of stochastic processes than it was previously thought. This includes processes showing arbitrary path dependence, long range correlations or dynamic sampling spaces; suggesting that typicality is a generic property of stochastic processes, regardless of their complexity. Our results impact directly in the understanding of the stability of complex systems, open the door to new data compression strategies and points to the existence of statistical mechanics-like approaches to systems arbitrarily away from equilibrium with dynamic phase spaces. We argue that the potential emergence of robust properties in complex stochastic systems provided by the existence of typical sets has special relevance to biological systems., Comment: 15 pages, 4 figures

Class-modelling methods aim to predict the conformity of new unknown samples with a single target class, using statistical decision rules built exclusively with objects of that class. This article introduces a novel class-modelling method for spectral data. The method uses the concept of β%-prediction band for functional data to classify spectra. The band is defined by an upper and a lower limiting spectra which delimit critical trajectories for β% of future spectra of the target class. It is constructed in three main steps: firstly, a naive bootstrap sample of calibration spectra is projected onto a parsimonious principal component (PC) basis and their scores are estimated. The posterior predictive distribution of the scores on each PC is estimated using a Bayesian zero-mean normal model. This procedure is repeated on naive bootstrap estimations of the PCs to obtain the predictive distribution of the scores. These enable to account for all modelling uncertainties including the random deviation of scores from their zero-mean on each PC, uncertainty in the variance of scores (eigenvalue) on each PC, and uncertainty in the PC estimations. Secondly, the predicted scores are back-transformed to the original signal scale to obtain the predictive distribution of future spectra. Thirdly, the predicted spectra are ranked to select the β% most central ones as typical set, whose ranges of variation are used to construct the simultaneous limits of the band. Once the band is constructed, reconstructions of future unknown test spectra by bootstrap PC models are projected onto it, and the extent to which they overlap with it is used to decide their acceptance or rejection. The statistical properties and classification performances of the proposed prediction band are evaluated on real near-infrared datasets and compared to the well-known soft-independent modelling of class analogy (SIMCA) model. The results of the evaluation provide evidence that the proposed prediction band possesses satisfactory predictive performances. It even outperforms the SIMCA while offering attractive advantages like risk-management and straightforward physical interpretability of outlyingness patterns of tested spectra.

Subject: The article contains investigation of the questions related to semantic and syntactic analysis of the texts, decomposition of sentences into component processes, the construction of the syntactic structure of sentences; semantic interpretation of the fragments of a natural language sentence into fragments of an M-language; the composition of the fragments of the M-language in the structure of the abstract, describing the problem environment. Purpose: development of a method for analyzing and processing information on the DSS ACS. Objective: To analyze the research of recent years related to the solution of analyzing the content of the language structure problem from the point of view of creating dialogue systems software, to make a conclusion about the appropriateness of research directions. Perform a detailed description of the stages of performing semantic and parsing with a description of the input, intermediate and output data. Determine the recommendations for the input data variability depending on the structure of the sentences of the subject area (the text described in natural language). Suggest rules for the formation of predicates for different parts of the Ukrainian language. Determine the typical set of service awards for filling the reference dictionary. Justify the implementation of each of the above operations for combining into a single computing structure, which is performed at certain stages. Develop procedures for passing each of the stages. Suggest rules for the formation of syntactic groups for certain pairs of tokens. Conclusions: The application of the developed method based on certain rules in predicates will allow to sample informatively significant information from a set of textual information and present it as an annotation (abstract).

Nowadays, the integrated energy system (IES) has become a hot topic in the field of energy research. In this paper, a bi-level optimal configuration strategy is proposed for a community integrated energy system (CIES), which is based on energy supply-demand responses and robustness adjustable scenarios. First, from the perspective of energy supply and demand, various energy equipment on the community side and aggregated energy loads on the user side are analysed and qualitatively modeled, and a multi energy supply-demand of CIES is established. Next, according to the robustness requirements of IES planning, the scenario sampling, sorting, screening and reduction are performed subsequently to obtain a typical set of robustness adjustable scenarios. On this basis, a bi-level optimal configuration model that coordinates the aggregated configuration and operation is developed to design the CIES. While the upper-level model takes the lowest total annual cost as the goal to configure the quantity and capacity of energy equipment, the lower-level model optimizes the scheduling scheme with the aim of the best operation economy under typical scenarios. Finally, case studies are carried out based on a practical town area, and simulation results show the effectiveness and advantage of the proposed strategy.

This paper focuses on an entropy based formalism to speed up the evaluation of the Structural SIMilarity (SSIM) index in images affected by a global distortion. Looking at images as information sources, a visual distortion typical set can be defined for SSIM. This typical set consists of just a subset of information belonging to the original image and the corresponding one in the distorted version. As side effect, some general theoretical criteria for the computation of any full reference quality assessment measure can be given in order to maximize its computational efficiency. Experimental results on various test images show that the proposed approach allows to estimate SSIM with a considerable speed up (about 200 times) and a small relative error (often lower than 5%). HighlightsFast method for the computation of SSIM from a subset of image blocks.Theoretical and practical method for the estimation of the typical set of the quality metric.Speed up for SSIM of about 200 times with relative estimation error lower than 5%.

An information theoretical analysis of nonadaptive group testing schemes based on sparse pooling graphs is presented. A pooling graph is a bipartite graph for which the adjacency matrix is a pooling matrix. The binary status of the objects to be tested are modeled by independent identically distributed. Bernoulli random variables with probability $p$ . An $(l, r, n)$ -regular pooling graph is a bipartite graph in which the left nodes have degree $l$ , the right nodes have degree $r$ , and $n$ is the number of left nodes. The main contribution of this paper is a direct coding theorem that gives the conditions for the existence of an estimator that can achieve an arbitrarily small probability of error. An estimator is a function that uses observations to infer the state of an object. The direct coding theorem is proved by averaging the upper bound on the probability of the estimation error of the typical set estimator over an $(l, r, n)$ -regular pooling graph ensemble. Numerical results indicate sharp threshold behaviors in the asymptotic regime. These results can provide a concrete benchmark for nonadaptive group testing of existing and emerging detection algorithms over a noiseless system.

Determining a single-letter secrecy-capacity formula for the arbitrarily varying wiretap channel (AVWTC) is an open problem largely because of two main challenges. Not only does it capture the difficulty of the compound wiretap channel (another open problem), it also requires that secrecy is ensured with respect to exponentially many possible channel state sequences. By extending the strong soft-covering lemma, recently derived by the authors, to the heterogeneous scenario, this paper accounts for the exponential number of secrecy constraints while only imposing single-letter constraints on the communication rate. Through this approach, we derive a single-letter characterization of the correlated-random (CR)-assisted semantic-security (SS) capacity of an AVWTC with a type constraint on the allowed state sequences. The allowed state sequences are the ones in a typical set around a single constraining type. The stringent SS requirement is established by showing that the mutual information between the message and the eavesdropper’s observations is negligible even when maximized over all message distributions, choices of state sequences, and realizations of the CR-code. Both the achievability and the converse proofs of the type-constrained coding theorem rely on stronger claims than actually required. The direct part establishes a novel single-letter lower bound on the CR-assisted SS-capacity of an AVWTC with state sequences constrained by any convex and closed set of state probability mass functions. This bound achieves the best known single-letter secrecy rates for a corresponding compound wiretap channel over the same constraint set. In contrast to other single-letter results in the AVWTC literature, this paper does not assume the existence of a best channel to the eavesdropper. Instead, SS follows by leveraging the heterogeneous version of the strong soft-covering lemma and a CR-code reduction argument. Optimality is a consequence of a max-inf upper bound on the CR-assisted SS-capacity of an AVWTC with state sequences constrained to any collection of type-classes. When adjusted to the aforementioned compound WTC, the upper bound simplifies to a max–min structure, thus strengthening the previously best known single-letter upper bound by Liang et al. that has a min–max form. The proof of the upper bound uses a novel distribution coupling argument. The capacity formula shows that the legitimate users effectively see an averaged main channel, while security must be ensured versus an eavesdropper with perfect channel state information. An example visualizes our single-letter results, and their relation to the past multi-letter secrecy-capacity characterization of the AVWTC is highlighted.

Online set intersection operations have been widely used in network processing tasks, such as Quality of Service differentiation, firewall processing, and packet/traffic classification. The major challenge for online set intersection is to sustain line-rate processing speed; accelerating set intersection using state-of-the-art hardware devices is of great interest to the research community. In this paper, we present a novel high-performance set intersection approach on FPGA. In our approach, each element in any set is represented by a combination of Group ID (GID) and Bit Stride (BS); all the sets are intersected using linear merge techniques and bitwise AND operations. We map our online set intersection algorithm onto hardware; this is done by constructing modular Processing Element (PE) and concatenating multiple PEs into a tree-based parallel architecture. In order to improve the throughput on a state-of-the-art FPGA, we feed all the inputs to FPGA in a streaming fashion with the help of the synchronization GIDs. Post place-and-route results show that, for a typical set intersection problem in network processing, our design can intersect $\text{eight}$ sets, each of up to $32$ K elements, at a throughput of $47.4$ Thousand Intersections Per Second (KIPS) and a latency of $94.8\,\mu$ s per batch of inputs. Compared to the classic linear merge or bitwise AND techniques on state-of-the-art multi-core processors, our designs on FPGA achieves up to $66\times$ throughput improvement and $80\times$ latency reduction.

Although both novice and experienced researchers can struggle with what theoretical frameworks are and why they are necessary, it is nevertheless clear that they are an important part of designing, carrying out, and reporting on research in our field. In this chapter, we attempt to clarify the roles played by theoretical frameworks in mathematics education and to explain why they are important and useful, both to individual researchers and to the field as a whole. Finally, we provide some examples of how different frameworks might be applied to a typical set of data: videotaped whole-class, teacher-student, and student-student interactions in a mathematics classroom.

We introduce a method for measuring the number and durations of processing stages from the electroencephalographic signal and apply it to the study of associative recognition. Using an extension of past research that combines multivariate pattern analysis with hidden semi-Markov models, the approach identifies on a trial-by-trial basis where brief sinusoidal peaks (called bumps) are added to the ongoing electroencephalographic signal. We propose that these bumps mark the onset of critical cognitive stages in processing. The results of the analysis can be used to guide the development of detailed process models. Applied to the associative recognition task, the hidden semi-Markov models multivariate pattern analysis method indicates that the effects of associative strength and probe type are localized to a memory retrieval stage and a decision stage. This is in line with a previously developed the adaptive control of thought-rational process model, called ACT-R, of the task. As a test of the generalization of our method we also apply it to a data set on the Sternberg working memory task collected by Jacobs, Hwang, Curran, and Kahana (2006). The analysis generalizes robustly, and localizes the typical set size effect in a late comparison/decision stage. In addition to providing information about the number and durations of stages in associative recognition, our analysis sheds light on the event-related potential components implicated in the study of recognition memory. (PsycINFO Database Record

This paper presents a new methodology for hyperspectral image classification based on the definition of typical sets from the Asymptotic Equipartition Property, an important tool in the field of information theory. The Endmembers (EM) are decomposed in orthogonal functions by a discrete wavelet transform and are modeled as a HMM (Hidden Markov Model). Based on this model, for each EM, a Typical Sequence set is established. One spectrum is classified as a member of a specific EM if belongs to its typical set. It is considered the case in which a class in the hyperspectral image can be represented by several subclasses and also the original spectra can be decimated and be used with less bands in the classification processes. The proposed method is tested with a set of AVIRIS data and is compared with the classification performed by Euclidian Distance, Spectral Angle Mapper (SAM) and Spectral Information Divergence (SID). It is shown that the proposed classification can be used with a reduced number of bands and achieves results comparable with other methods using all bands.

The main aim of this paper is to present results of a full-scale pushover test of a 40 meter telecommunication tower under breaking load. A detailed description of the studied tower has been presented with emphasis on the geometrical imperfections of the selected members of the structure. The results of the experiment consisting of the axial forces in the tower's members, as well as the displacements of the observed nodes as a function of external load have been presented. A comparison of a wind load based on the current standards with the load based on the experimental breaking force has been discussed for a typical set of telecommunication equipment. The main conclusion was that the structure's overall carrying capacity depended on the buckling resistance of the legs. Additionally, theoretical buckling resistances (based on standards) of the tower's legs made with round solid bars were smaller than the experimental axial forces in compression.

The system of axioms for probability theory laid in 1933 by Andrey Nikolaevich Kolmogorov can be extended to encompass the imaginary set of numbers and this by adding to his original five axioms an additional three axioms. Therefore, we create the complex probability set , which is the sum of the real set with its corresponding real probability, and the imaginary set with its corresponding imaginary probability. Hence, all stochastic experiments are performed now in the complex set instead of the real set . The objective is then to evaluate the complex probabilities by considering supplementary new imaginary dimensions to the event occurring in the ‘real’ laboratory. Consequently, the corresponding probability in the whole set is always equal to one and the outcome of the random experiments that follow any probability distribution in is now predicted totally in . Subsequently, it follows that, chance and luck in is replaced by total determinism in . Consequently, by subtracting the chaotic factor ...

In this paper, a new and efficient hybrid AC/DC solar powered Homegrid model is proposed based on the load characteristics of a typical set of home appliances working on a 220 V, 50 Hz system. The load characteristics of home appliances are represented by a static ZIP (constant impedance (Z), constant current (I) and constant power (P)) coefficient model, a useful load model in power flow studies. A Homegrid system is formed by analysing the distortion produced by modern household equipment, and a K-factor with a significant role in the overheating of residential/distribution transformers is determined. Further, the ZIP load model is validated by a simulation and the results are compared with experimental data. To improve the efficiency and quality of the traditional Homegrid system, a solar powered hybrid AC/DC supply network model is proposed. This system eliminates redundant power conversion stages and mitigates the loss due to the harmonics by a shift of harmonic intensive loads to the Direct Current (DC) network side. Its effectiveness has been investigated with a simulation in MATLAB as well as with hardware implementation. This proposed energy efficient Homegrid model could be quite helpful in fulfilling the idea of net zero or surplus energy buildings.

Dynamics of non-stationary nonlinear processes that follow the maximum entropy principle (MaxEnt) for continuous probability distributions is considered. A set of equations describing the dynamics of probability density function (pdf) under the mass conservation and the energy conservation constraints is derived. The asymptotic convergence of evolving pdf and convergence of differential entropy are examined. It is shown that for pdfs with compact carrier the limit pdf is unique and coincides with the pdf obtained from Jaynes’s MaxEnt principle.

Each solar powered device that is based on solar cells requires energy system, which contains typical set of subsystems which should be implemented in software and hardware to achieve efficient power management. This paper will structure general design of solar power system that could be modular and applied to many different types of devices and applications.

k-connectivity of random graphs is a fundamental property indicating reliability of multi-hop wireless sensor networks (WSN). WSNs comprising of sensor nodes with limited power resources are modeled by random graphs with unreliable nodes, which is known as the node fault model. In this paper, we investigate k-connectivity of random graphs in the node fault model by evaluating the network breakdown probability, i.e., the disconnectivity probability of random graphs after stochastic node removals. Using the notion of a strongly typical set, we obtain universal asymptotic upper and lower bounds of the network breakdown probability. The bounds are applicable both to random graphs and to random geometric graphs. We then consider three representative random graph ensembles: the Erdos-Renyi random graph as the simplest case, the random intersection graph for WSNs with random key predistribution schemes, and the random geometric graph as a model of WSNs generated by random sensor node deployment. The bounds unveil the existence of the phase transition of the network breakdown probability for those ensembles., 6 pages

Redox-based resistive random access memories (ReRAM) are promising candidates for the use in ‘beyond-von Neumann’ architectures. One key issue for utilizing ReRAM for e.g. neuromorphic applications is a gradual SET and RESET behavior, allowing to write various resistance states emulating synaptic weights. However, a typical SET event for filamentary-like valence change mechanism devices is happening abrupt due to its physical principle. In this work we demonstrate a gradual SET behavior for $\text{HfO}_{2}/\text{TiO}_{\mathrm{x}}$ ReRAM cells in pulse mode. The results are discussed in view of the inherent properties of the particular bilayer structure.

Macroscopic properties of reacting mixtures are necessary to design synthetic strategies, determine yield, and improve the energy and atom efficiency of many chemical processes. The set of time-ordered sequences of chemical species are one representation of the evolution from reactants to products. However, only a fraction of the possible sequences is typical, having the majority of the joint probability and characterizing the succession of chemical nonequilibrium states. Here, we extend a variational measure of typicality and apply it to atomistic simulations of a model for hydrogen oxidation over a range of temperatures. We demonstrate an information-theoretic methodology to identify typical sequences under the constraints of mass conservation. Including these constraints leads to an improved ability to learn the chemical sequence mechanism from experimentally accessible data. From these typical sequences, we show that two quantities defining the variational typical set of sequences-the joint entropy rate and the topological entropy rate-increase linearly with temperature. These results suggest that, away from explosion limits, data over a narrow range of thermodynamic parameters could be sufficient to extrapolate these typical features of combustion chemistry to other conditions.

According to the asymptotic equipartition property, sufficiently long sequences of random variables converge to a set that is typical. While the size and probability of this set are central to information theory and statistical mechanics, they can often only be estimated accurately in the asymptotic limit due to the exponential growth in possible sequences. Here we derive a time-inhomogeneous dynamics that constructs the properties of the typical set for all finite length sequences of independent and identically distributed random variables. These dynamics link the finite properties of the typical set to asymptotic results and allow the typical set to be applied to small and transient systems. The main result is a geometric mapping-the triangle map-relating sequences of random variables of length n to those of length n+1. We show that the number of points in this map needed to quantify the properties of the typical set grows linearly with sequence length, despite the exponential growth in the number of typical sequences. We illustrate the framework for the Bernoulli process and the Schlögl model for autocatalytic chemical reactions and demonstrate both the convergence to asymptotic limits and the ability to reproduce exact calculations.

The overall intention of chaotic control is to eliminate chaos, and to force the system to become stable in the classical sense. In this paper, I demonstrate a more subtle method that does not eliminate all traces of chaotic behaviour; yet it consistently, and reliably, can provide control as intended. The Rate Control of Chaos (RCC) method is derived from metabolic control processes, and has several remarkable properties. RCC can control complex systems continuously, and unsupervised, it can also maintain control across bifurcations, and in the presence of significant systemic noise. Specifically, I show that RCC can control a typical set of chaotic models, including the 3 and 4 dimensional chaotic Lorenz systems, in all modes. Furthermore, it is capable of controlling spatiotemporal chaos without supervision, and maintains control of the system across bifurcations. This property of RCC allows a dynamic system to operate in parameter spaces that are difficult to control otherwise. This may be particularly interesting for the control of forced systems, or dynamic systems that are chaotically perturbed. These control properties of RCC are applicable to a range of dynamic systems, thereby appearing to have far-reaching effects beyond just controlling chaos. RCC may also point to the existence of a biochemical control function of an enzyme, to stabilise the dynamics of the reaction cascade.

We suggest a transformation to obtain the negation of a probability distribution. We investigate the properties of this negation. Using the Dempster–Shafer theory of evidence, we show of all the possible negations our proposed negation is one having a maximal type entropy.

Purpose – Value-at-risk (VaR) is a risk measure of potential loss on a specific portfolio. The main uses of VaR are in risk management and financial reporting. Researchers are continuously looking for new and efficient ways to evaluate VaR, and the 2008 financial crisis has given further impetus to finding new and reliable ways of evaluating and using VaR. In this study, the authors use genetic algorithm (GA) to evaluate VaR and compare the results with conventional VaR techniques. Design/methodology/approach – In essence, the authors propose two modifications to the standard GA: normalized population selection and strict population selection. For a typical set of simulation, eight chromosomes were used each with eight stored values, and the authors get eight values for VaR. Findings – The experiments using data from four different market indices show that by adjusting the volatility, the VaR computed using GA is more conservative as compared to those computed using Monte Carlo simulation. Research limitations/implications – The proposed methodology is designed for VaR computation only. This could be generalized for other applications. Practical implications – This is achieved with much less cost of computation, and hence, the proposed methodology could be a viable practical approach for computing VaR. Originality/value – The proposed methodology is simple and, at the same time, novel that could have far-reaching impact on practitioners.

Cell detection is the essential step for various analyses in biological fields. One of the conventional approach is to construct a specialized method for every specified task, but it is not efficient in the meaning of the coding workload. Another approach is based on some machine learning technique, but it is difficult to prepare many training data. To solve these problems, we propose a balanced system by combining image processing and machine learning. The system is universally applicable to any image, because it only consists of basic methods of image processing. The code of the system does not need to be modified, because its behavior is adaptively tuned by machine learning. Users are free from excessive request of training data, because only a few desirable data is specifically requested by the system. The system consists of three units to achieve functionalities for avoiding parameter collision, compensating lack of training data, and reducing complexity of feature space. The effectiveness of the system is evaluated with a typical set of cell images, and the result is sufficient. The proposed system provides a reasonable way of preparing a tuned cell detection method for arbitrary sets of images in this field.

Similar to fuzzy set on a possibility space, uncertain set is a set-valued function on an uncertainty space, and attempts to model unsharp concepts. Entropy provides a quantitative measurement of the uncertainty associated with an uncertain set. This paper presents a formula for calculating the entropy of an uncertain set via its inverse membership function. Based on the formula, the entropy operator is shown to satisfy positive linearity property. In addition, this paper proposes a concept of relative entropy to describe the divergence between the membership functions of two uncertain sets.

Entropy is used as a quantitative measurement of the information deficiency. In uncertain set theory, logarithm entropy for uncertain set has been proposed. However, it fails to measure the degree of uncertainty associated with some uncertain sets. Thus this paper will propose sine entropy for uncertain set as a supplement, and investigate its properties such as translation invariance and positive linearity. Besides, it proposes sine relative entropy for uncertain set, and gives its applications in portfolio selection and clustering.

Machining using industrial robots is currently limited to applications with low geometrical accuracies and soft materials. This paper analyzes the sources of errors in robotic machining and characterizes them in amplitude and frequency. Experiments under different conditions represent a typical set of industrial applications and allow a qualified evaluation. Based on this analysis, a modular approach is proposed to overcome these obstacles, applied both during program generation (offline) and execution (online). Predictive offline compensation of machining errors is achieved by means of an innovative programming system, based on kinematic and dynamic robot models. Real-time adaptive machining error compensation is also provided by sensing the real robot positions with an innovative tracking system and corrective feedback to both the robot and an additional high-dynamic compensation mechanism on piezo-actuator basis.

Safety factors proposed in codes CEB, B.A.E.L 91 and EUROCODE 1 cover a great number of uncertainties; making them inadequate for the assessment of existing structures. Suitable safety factors are established using a probabilistic assessment, once real dimensions, materials strength and existing structures deterioration mechanisms are taken into account. This paper presents a calibration method for safety factors using a typical set of RC bridges in France. It considers the principal stages of corrosion provoked by CO2 and Cl− penetration and threshold indexes (B0) for existing structures. Reliability indexes are determined by the FORM method in the calibration method.

This paper studies several properties of channel codes that approach the fundamental limits of a given (discrete or Gaussian) memoryless channel with a nonvanishing probability of error. The output distribution induced by an ϵ-capacity-achieving code is shown to be close in a strong sense to the capacity achieving output distribution. Relying on the concentration of measure (isoperimetry) property enjoyed by the latter, it is shown that regular (Lipschitz) functions of channel outputs can be precisely estimated and turn out to be essentially nonrandom and independent of the actual code. It is also shown that the output distribution of a good code and the capacity achieving one cannot be distinguished with exponential reliability. The random process produced at the output of the channel is shown to satisfy the asymptotic equipartition property.

We show that the derivative of the relative entropy with respect to its parameters is lower and upper bounded. We characterize the conditions under which this derivative can reach zero. We use these results to explain when the minimum relative entropy and the maximum log likelihood approaches can be valid. We show that these approaches naturally activate in the presence of large data sets and that they are inherent properties of any density estimation process involving large numbers of random variables.

Set-valued information system can be used to substitute the incomplete information system, this paper analyzes the shortages of the existing typical binary relation in the set-valued information system. Considering the actual semantic of set-value, a probability equivalence relation is put forward, probability rough set model of the set-valued information system is defined, and the attribute reduction of set-valued decision information systems is discussed, which is based on the probability equivalence relation; on the basis of analysis the defects of existing dominance relation in set-valued ordered information system, a probability dominance relation is offered. The set-valued ordered decision information system is regarded as an example to demonstrate calculation of the “dominance probability” between objects in the probability dominance rough set model, and the acquisition of the probability dominance classes of objects with different values, and probability dominance decision discernibility matrix and attribute reductions.

Efficiency maps have long been used by engineers to understand the topographical behavior of their machinery. Most commonly, efficiency maps have been generated for internal combustion engines, where the torque–speed curve for the engine shows the wide-open-throttle line with constant efficiency lines drawn beneath this maximum operating limit. From such maps, engineers have been able to determine the most efficiency operating point for the engine, given a desired output power (torque and speed). There currently exists a great interest in using hydrostatic transmissions for improving the operating efficiency of an internal combustion engine. However, efficiency maps for hydrostatic transmissions, similar to efficiency maps for internal combustion engines, do not exist in the literature and therefore it is difficult to assess the overall efficiency gains that are achieved when using a hydrostatic transmission in these applications. This paper proposes a method for generating efficiency maps for hydrostatic transmissions, and presents a typical set of maps that may be used as a first approximation for assessing transmission efficiency. The results of this paper are nondimensional and are generalized for a transmission of any size. As shown in this research, there are regimes of transmission operation in which the efficiency is nearly independent of either the output torque, or the output speed. Furthermore, it is shown that maximum operating efficiencies typically exist at high output speeds, and mid-to-high output torques.

Smooth entropy of X is defined as possibly biggest entropy of a distribution Y close to X. It has found many applications including privacy amplification, information reconciliation, quantum information theory and even constructing random number generators. However the basic question about the optimal shape for the distribution Y has not been answered yet. In this paper we solve this problem for Renyi entropies in non-quantum settings, giving a formal treatment to an approach suggested at TCC'05 and ASIACRYPT'05. The main difference is that we use a threshold cut instead of a quantile cut to rearrange probability masses of X. As an example of application, we derive tight lower bounds on the number of bits extractable from Shannon memoryless sources.

Counting is an important part of gems trade, especially in large quantities. To develop a fast and automatic method for gems counting is necessary. According to the structure of round brilliant cut gem and the typical set property, typical gems were defined by high circularity and probability. Using the characters of typical gems and the relationship between number and area, gems were counted adaptively. The experiments were shown that the processing speed was fast and the accuracy of counting was high enough for large number of gems trading.

Multi-million gate system-on-chip (SoC) designs easily fit into today’s Field Programmable Gate Arrays (FPGAs). As FPGAs become more common in safety-critical and mission-critical systems, researchers and designers require information flow guarantees for the FPGAs. Tools for designing a secure system of chips (SOCs) using FPGAs and new techniques to manage and analyze the security properties precisely are desirable. In this work we propose a formal approach to model, analyze and verify a typical set of security properties – noninterference – of Handel C programs using Petri Nets and model checking. This paper presents a method to model Handel C programs using Predicate Transition Nets, a type of Petri Net, and define security properties on the model, plus a verification approach where security properties are checked. Three steps are used. First, a formal specification on the Handel C description using Petri Nets is extracted. Second, the dynamic noninterference properties with respect to the Handel C program statements are defined on the model. To assist in verification, a translation rule from the Petri Nets specification to the Maude programming language is also defined. Thus, the formal specification can be verified against the system properties using model checking. A case study of the pipeline multiplier is discussed to illustrate the concept and validate the approach.

Set valued probability theory is used to analyze and model highly uncertain probability systems. In this work a set valued probability is defined over the measurable space. The range of set valued probability is the set of subsets of the unit interval. Some basic properties and the connection with set valued measures are discussed.

An in-depth understanding of fundamental heterogeneous catalysis can be obtained by the use of Microkinetic Analysis of the elementary reaction steps. Unfortunately, for complex reaction networks, the sheer number of parameters present in such models can make the interpretation and deeper understanding of such microkinetic models very difficult. In this work, a Microkinetic Analysis Methodology, which incorporates statistical methods, is demonstrated, with application to a typical set of fundamental catalytic reactions. A uniform statistical experimental design is implemented, varying a selection of parameters within the microkinetic model. The responses of the simulated model are fitted to construct approximation models. We illustrate the extension of some known methods in order to successfully implement the proposed methodology, such as Kriging approximation models applied to additive log-ratio transformations of the surface coverage compositions, as well as a multivariate scaled EIGF criterion to itera...

Site response analysis, widely performed in practice to estimate seismic site effects, requires multiple inputs regarding the dynamic soil properties. While comprehensive site-specific field and laboratory tests need to be performed for the proper characterization of a site, engineers are often given only limited information and are forced to work with uncertainties. A round-robin test on site response analysis was performed in Korea to evaluate the dispersion of the calculated responses originating from the uncertainties in soil characterization and from the method of analysis. The participants were intentionally given limited information, which represented a typical set of inputs given in practice. The participants were asked to predict the dynamic properties based on the given data, and to perform a series of site response analyses. This paper documents the variations in the predicted dynamic properties and the computed responses. The results showed that the prediction of the shear wave velocity was most important for the evaluation of the ground-motion propagation, while the type of analysis had only a secondary influence. Important guidelines for the prediction of dynamic properties are also given.

Let f be a holomorphic endomorphism of ℂℙ k . We construct by using coding techniques a class of ergodic measures as limits of non-uniform probability measures on preimages of points. We show that they have large metric entropy, close to log d k . We establish for them strong stochastic properties and prove the positivity of their Lyapunov exponents. Since they have large entropy, those measures are supported in the support of the maximal entropy measure of f. They in particular provide lower bounds for the Hausdorff dimension of the Julia set.

Emotional cellular (EC), proposed in our previous works, is a kind of semantic cell that contains kernel and shell and the kernel is formalized by a triple-L = , wherePdenotes a typical set of positive examples relative to word-L,dis a pseudodistance measure on emotional two-dimensional space: valence-arousal, andδis a probability density function on positive real number field. The basic idea of EC model is to assume that the neighborhood radius of each semantic concept is uncertain, and this uncertainty will be measured by one-dimensional density functionδ. In this paper, product form features were evaluated by using ECs and to establish the product style database, fuzzy case based reasoning (FCBR) model under a defined similarity measurement based on fuzzy nearest neighbors (FNN) incorporating EC was applied to extract product styles. A mathematical formalized inference system for product style was also proposed, and it also includes uncertainty measurement tool emotional cellular. A case study of style acquisition of mobile phones illustrated the effectiveness of the proposed methodology.

The GW-technology corrects the Kohn-Sham (KS) single particle energies and single particle states for artifacts of the exchange-correlation (XC) functional of the underlying density functional theory (DFT) calculation. We present the formalism and implementation of GW adapted for standard quantum chemistry packages. Our implementation is tested using a typical set of molecules. We find that already after the first iteration of the self-consistency cycle, G0W0, the deviations of quasi-particle energies from experimental ionization potentials and electron affinities can be reduced by an order of magnitude against those of KS-DFT using GGA or hybrid functionals. Also, we confirm that even on this level of approximation there is a considerably diminished dependency of the G0W0-results on the XC-functional of the underlying DFT.

When testing sequential circuits with scan chains, the test patterns are generated on their combinational parts assuming that all value combinations can be used for flipflops. On the other hands, if target circuits have initial values for flipflops, it is well known that the sets of reachable states may be much smaller than the entire state space, and there are lots of value combinations for flipflops which can never be realized in the normal operations starting with the initial states. Therefore, there are possibilities that the values used for the flipflops in the set of test patterns cannot be realized through normal operations, and there may be over testing issues, as some of the detectable faults by the given test patterns are actually non-detectable under the normal operations. In this paper, we first give a quick way to generate super sets of reachable states on the values of the given subset of flipflops based on QBF (Quantified Boolean Formula) formulation. By limiting the numbers of flipflops in the subset to small, such as 6 or so, we can generate an inductive-invariant for the values of the given subset of flipflops in less than a second for any ISCAS89 circuits. The generated invariant corresponds to a superset of reachable states assuming that the initial state is the one where all flipflop values are zero (or some specific values), and the complement of an invariant is a subset of unreachable states. It is shown that close to the half of a typical set of compacted test patterns for stuck-at (single and multiple) faults on ISCAS89 circuits are using the values from the computed unreachable states, i.e., possibly over testing the circuits, if the initial state is the all zero state. Then we generate the sets of test patterns for stuck-at faults (single and multiple) which never use the values inside the subset of unreachable states. The resulting sets of test patterns become several times larger than a compacted test patterns without considering unreachable states.

In cognitive radio (CR) cooperative sensing schemes, wireless sensor nodes deployed in the network sense the licensed spectrum and send their local sensing decisions to a fusion center (FC) that makes a global decision on whether to allow the unlicensed user transmit on the licensed spectrum, based on a decision (fusion) rule. k-out-of-N is widely used in the literature owing to its practical simplicity. Regrettably, it exhibits a tradeoff between the achievable probabilities of false alarm and miss detection, which could have consequent effects on the performance of CR. In this paper, based on the notion of typical sequences, we propose a novel fusion rule in which the false alarm and miss detection probabilities can be simultaneously made as small as desired (asymptotically zero as the number of sensors goes to infinity).