Random Generation

Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to regular expressions have an exponential blow-up in the worst-case. To overcome this, simple heuristic methods have been proposed. In this paper we analyse some of the heuristics presented in the literature and propose new ones. We also present some experimental comparative results based on uniform random generated deterministic finite automata.

In wireless sensor networks, sensor nodes eventually die due to battery depletion. Wireless sensor networks (WSNs) in which new nodes are periodically redeployed with certain intervals, called generations, to replace the dead nodes are called multi-phase wireless sensor networks. In the literature, there are several key predistribution schemes proposed for secure operation of WSNs. However, these schemes are designed for single phase networks which are not resilient against continuous node capture attacks; even under temporary attacks on the network, the harm caused by the attacker does not heal in time. However, the periodic deployments in multi-phase sensor networks could be utilized to improve the resiliency of the WSNs by deploying nodes with fresh keys. In the literature, there is limited work done in this area. In this paper, we propose a key predistribution scheme for multi-phase wireless sensor networks which is highly resilient under node capture attacks. In our scheme, called RGM (random generation material) key predistribution scheme, each generation of deployment has its own random keying material and pairwise keys are established between node pairs of particular generations. These keys are specific to these generations. Therefore, a captured node cannot be abused to obtain keys of other generations. We compare the performance of our RGM scheme with a well-known multi-phase key predistribution scheme and showed that RGM achieves up to three-fold more resiliency. Even under heavy attacks, our scheme's resiliency performance is 50% better in steady state.

Computability in Europe (CiE) is an informal network of European scientists working on computability theory, including its foundations, technical development, and applications. Among the aims of the network is to advance our theoretical understanding of what can and cannot be computed, by any means of computation. Its scientific vision is broad: computations may be performed with discrete or continuous data by all kinds of algorithms, programs, and machines. Computations may be made by experimenting with any sort of physical system obeying the laws of a physical theory such as Newtonian mechanics, quantum theory, or relativity. Computations may be very general, depending on the foundations of set theory; or very specific, using the combinatorics of finite structures. CiE also works on subjects intimately related to computation, especially theories of data and information, and methods for formal reasoning about computations. The sources of new ideas and methods include practical developments in areas such as neural networks, quantum computation, natural computation, molecular computation, computational learning. Applications are everywhere, especially, in algebra, analysis and geometry, or data types and programming. Within CiE there is general recognition of the underlying relevance of computability to physics and a broad range of other sciences, providing as it does a basic analysis of the causal structure of dynamical systems. The conference was based on invited tutorials and lectures, a set of special sessions on a range of subjects as well as contributed papers and informal presentations. The formal proceedings volume appeared in the Springer LNCS series, Vol. 5028 and contains 25 of the invited lectures and 36 of the submitted contributed papers. The present volume represents the informal abstract booklet which contains another 86 of the contributed talks and two invited plenary talks as well as 23 abstracts of informal presentations. The informal abstract booklet is not a scholarly publication, and papers appearing in it should not be considered published or as selected in a peer review process. There will be a number of post-proceedings publications, including special issues of Theory of Computing Systems, Archive for Mathematical Logic, and Journal of Algorithms. VI The first three meetings of CiE were at the University of Amsterdam in 2005, at the University of Wales Swansea in 2006, and at the University of Siena in 2007. The large number of mathematicians and computer scientists attending these conference had their view of computability theory enlarged and transformed: they discovered that its foundations were deeper and more mysterious, its technical development more vigorous, its applications wider and more challenging than they had known. The Athens meeting promised to extend and enrich that process. The annual CiE conference, based on the Computability in Europe network, has become a major event, and is the largest international meeting focused on computability theoretic issues. The series is coordinated by the CiE Conference

Abstract. Apart from the theoretical worst-case running time analysis not much is known about the average-case analysis or practical performance of finite automata minimization algorithms. On this paper we compare the running time of four minimization algorithms based on experimental results, and apply them to both deterministic and nondeterministic random automata. Although there is no clear winner, some conclusions can be taken for specific cases. Hopcroft's algorithm performs better for DFAs with small alphabets, and, ...

This paper presents a framework for deciding whether and how inventories should be pooled, using the consolidation effect as a cornerstone tool to measure inventory costs, service levels, and total costs. Based on the random generation of different scenarios, it is indicated the adequacy of inventory centralization, regular transshipments, and independent systems to a given set of demand, lead time, and holding costs characteristics. Sensitivity analyses on mathematical expressions are performed to determine when one alternative is preferable in terms of total costs. Real settings are also presented in light of the framework developed.

A simple algorithm for solving a cyclic block-tridiagonal system of equations is presented. Introducing a special form of a new variable, the system is split into two block-tridiagonal systems, which can be solved by known methods. Implementation details of the algorithm are discussed and numerical examples of diagonal and random generated systems are presented. q

This paper reports on a testing case study applied to a small Java application, partially specified in JML. It illustrates that JML can easily be integrated with classical testing tools based on combinatorial techniques and random generation. It also reveals difficulties to reuse, in a testing context, JML annotations written for a proof process.

We introduce a complexity measure of modal properties of finite structures which generalises the automaticity of languages. It is based on graph-automata like devices called labelling systems. We define a measure of the size of a structure that we call rank, and show that any modal property of structures can be approximated up to any fixed rank n by a labelling system. The function that takes n to the size of the smallest labelling system doing this is called the labelling index of the property. We demonstrate that this is a useful and fine-grained measure of complexity and show that it is especially well suited to characterise the expressive power of modal fixedpoint logics. From this we derive several separation results of modal and non-modal fixed-point logics, some of which are already known whereas others are new.

In this paper we demonstrate a method for generation of assembler test programs that systematically probe the architecture of a PowerPC superscalar processor. We show innovations such as ways to make small models for large designs, predict, with cycle accuracy the movement of instructions through the pipes (taking into account stalls and dependencies) and generation of test programs such that each reaches a new architectural state. We compare our method to the established practice of massive random generation and show that the quality of our tests, as measured by transition coverage, is much higher. The main contribution of this paper is not in theory as the theory has been discussed in previous papers, but in describing how to translate this theory into practice in a practical way a task that was far from trivial

The paper describes a conceptual approach for development of educational Web-based e-testing system. The system aims to improve the effectiveness of the learning process by providing features for flexible adjusting of the testing process. The tutors and learners can interact with the e-testing system by choosing different options for testing-easy questions, advanced questions, sequential or shuffle order, random generated questions within given range. The e-testing system can be used by students for self-testing or by tutors for official examination. When used for official examination the test results information is sent to the examiner by e-mail. The system files are stored on the server-side and are accessible through Webbrowser. A prototype of e-testing system illustrating the proposed approach is developed by means of HTML and JavaScript languages. It was used for ''C Programming Language'' course students self-testing and official examination. The experimental results demonstrated that the implementation of the proposed approach is quite helpful to facilitate the understanding and implementation of teachers' attitudes toward Web-based e-testing tools application.

Objective: To evaluate feasibility, internal consistency, test-retest reliability, and concurrent and discriminative validity of the Infant and Toddler Quality of Life Questionnaire (ITQOL) for parents of pre-school children with 12 scales (103-items) covering physical and psychosocial domains and impact of child health on parents, in comparison with the TNO-AZL Pre-school Children Quality of Life Questionnaire (TAP-QOL). Methods: Parents of children from a random general population sample (2 months-4 years old; n = 500) and of an outpatient clinic sample of children with respiratory disease (5 months-5 1 2 years old; n = 217) were mailed ITQOL and TAPQOL questionnaires; a retest was sent after two weeks. Results: Feasibility: The response was ‡80% with few missing and non-unique ITQOL-answers (<2%) in both study populations. Some ITQOL-scales (3-4 scales) showed a ceiling effect (>25% at maximum score). Internal consistency: All Cronbach's a >0.70. Test-retest Intraclass Correlation Coefficients (ICCs) were moderate or adequate ( ‡0.50; p < 0.01) for 10 ITQOL-scales. Validity: ITQOL-scales, with a few exceptions, correlated better with predefined parallel TAPQOL scales than with non-parallel scales. Five to eight ITQOL-scales discriminated clearly between children with few and with many parent-reported chronic conditions, between children with and without doctor-diagnosed respiratory disease and with a low and a high parent-reported medical consumption (p < 0.05). Conclusions: This study supported the evidence that the ITQOL is a feasible instrument with adequate psychometric properties. The study provided reference ITQOL scores for gender/age subgroups. We recommend repeated evaluations of the ITQOL in varied populations, especially among very young children, including repeated assessments of test-retest characteristics and evaluations of responsiveness to change. We recommend developing and evaluating a shortened ITQOL version.

The paper analyses the process leading to formatiom and perpetuation of high levels of NPAs in Indian public sector banks (PSBs henceforth). It distinguishes between random and non-random reasons of NPAs formation in PSBs. It points out that a high degree of arbitrariness is involved in defining NPAs as it fails to capture diversity in terms of the seasonal and cyclical nature of the economic activities in India. The study conceptualises random reasons for default in a simplified framework of a Poisson process. It then argues that the nonrandom reasons go beyond the conventional paradigm of interim, ex-ante and ex-post information asymmetries and incomplete contracts. It points out that the financial notion of NPA as a mere risk phenomenon is inadequate, because a number of reasons leading to non-random generation of NPA are related to the dimension of uncertainty. It highlighted that the use of a secondary asset market may take care of NPA problem, but it requires a number of conditions for its use, which hardly exist in India. The study observes a number of reasons of generation of NPAs which are very important and peculiar to India. This is followed by a critical evaluation of the series of policy measures that have been adopted to improve the NPA scenario since liberalization. While one set of policies granting greater autonomy to the PSBs are proved to be quite effective in restricting formation fresh NPAs, the other set of policies designed to recover loans, after default, have failed to deliver the goods. Finally, it concludes by making an assessment of the existing institutions and highlights the fact that the incidence of NPA is as much due to the malfunctioning of the banking institutions as due to the external institutional environment.

Simulations of originally existent biological sequences are helpful for computational analysis and manipulations, rather than wet lab experiments, considerably reducing the cost and time associated with traditional wet lab experiments. The basic idea is to compare the results of a run on real data to many runs on random data. This paper discusses the need for random biological sequence analysis and an alternative for generating biological random sequences. A novel random generation algorithm which uses the statistical distributions to generate numbers and to map these numbers into biological random sequences is conceived. Algorithm for generating random sequences with normal and binomial distributions is implemented; random sequences with tandem repeats, GC base control and nucleotide position control are also incorporated by modifying this algorithm. The newly proposed algorithm and all the mentioned features are also implemented as a platform independent tool named Biolets which can be freely downloaded from the web site http://sooryakiran.com/products_biolets.html.

We consider the problem of scheduling jobs in a hybrid flowshop with two stages. Our objective is to minimize both the makespan and the total completion time of jobs. This problem has been little studied in the literature. To solve the problem, we propose an ant colony optimization procedure. Computational experiments are conducted using random-generated instances from the literature. In comparison against other well-known heuristics from the literature, experimental results show that our algorithm outperforms such heuristics.

An approach is described for estimation of baseflow parameters of the ARNO model, using historical baseflow recession sequences extracted from daily streamflow records. This approach allows four of the model parameters to be estimated without rainfall data, and effectively facilitates partitioning of the parameter estimation procedure so that parsimonious search procedures can be used to estimate the remaining storm response parameters separately. Three methods of optimization are evaluated for estimation of four baseflow parameters. These methods are the downhill Simplex (S), Simulated Annealing combined with the Simplex method (SA) and Shuffled Complex Evolution (SCE). These estimation procedures are explored in conjunction with four objective functions: (1) ordinary least squares; (2) ordinary least squares with Box-Cox transformation; (3) ordinary least squares on prewhitened residuals; (4) ordinary least squares applied to prewhitened with Box-Cox transformation of residuals. The effects of changing the seed random generator for both SA and SCE methods are also explored, as are the effects of the bounds of the parameters. Although all schemes converge to the same values of the objective function, SCE method was found to be less sensitive to these issues than both the SA and the Simplex schemes. Parameter uncertainty and interactions are investigated through estimation of the variance-covariance matrix and confidence intervals. As expected the parameters were found to be correlated and the covariance matrix was found to be not diagonal. Furthermore, the linearized confidence interval theory failed for about one-fourth of the catchments while the maximum likelihood theory did not fail for any of the catchments. ᭧

This thesis describes a methodology for automating routine design problems. The research applied for developing this methodology consisted in three steps. Firstly, different types of complexity in routine design were investigated. Secondly, methods were developed to manage each type of complexity. Thirdly, the obtained methods were integrated into one methodology for routine design automation. The resulting methodology consists of the following five steps: 1. Determine a formal model of the components, parameters and relations of the design problem to automate. 2. Decompose the design problem into different levels of detail by analyzing its functional and physical structure. 3. Translate the obtained problem model into a TARD representation. TARD representations were developed in this research as a means of describing how components, relations and parameters can be used for designing an artifact. 4. Determine the Topology System of Equations (ToSE) of the model. ToSE was developed w...

Code revision of a leading telecom product was performed, combining manual audit and static analysis tools. On average, one exploitable vulnerability was found for every 4000 lines of code. Half of the located threats in the product were buffer overflows followed by race condition, misplaced trust, and poor random generators. Static analysis tools were used to speed up the revision process and to integrate security tests into the overall project process. The discussion analyses the effectiveness of automatic tools for auditing software. Furthermore, the incorporation of the software security analysis into the development process, and the results and costs of the security analysis is discussed. From the initial 42 workdays used for finding all vulnerabilities, approximately 16 days were needed for finding and correcting 91,5 % of the vulnerabilities. So, proportionally small investments improve the program code security by integrating an automatic auditing tool into the ordinary execution of source code revision.

Limits of densities belonging to an exponential family appear in many applications, {e.g.} Gibbs models in Statistical Physics, relaxed combinatorial optimization, coding theory, critical likelihood computations, Bayes priors with singular support, random generation of factorial designs. We discuss the problem from the methodological point of view in the case of a finite state space. We prove two characterizations of the limit distributions, both based on a suitable description of the marginal polytope (convex hull of canonical statistics&#39; values). First, the set of limit densities is equal to the set of conditional densities given a face of the marginal polytope. Second, in the lattice case there exists a parametric presentation, in monomial form, of the closure of the statistical model.

Reconfigurable Computers (RC) can provide significant performance improvement for domain applications. However, wide acceptance of today's RCs among domain scientist is hindered by the complexity of design tools and the required hardware design experience. Recent developments in hardware/software co-design methodologies for these systems provide the ease of use, but they are not comparable in performance to manual co-design. This paper aims at improving the overall performance of hardware tasks assigned to FPGA. Particularly the analysis of inter-task communication as well as data dependencies among tasks are used to reduce the number of configurations and to minimize the communication overhead and task processing time. This work leverages algorithms developed in the RC and Reconfigurable Hardware (RH) domains to address efficient use of hardware resources to propose two algorithms, Weight-Based Scheduling (WBS) and Highest Priority First-Next Fit (HPF-NF). However, traditional resource based scheduling alone is not sufficient to reduce the performance bottleneck, therefore a comprehensive algorithm is necessary. The Reduced Data Movement Scheduling (RDMS) algorithm is proposed to address dependency analysis and inter-task communication optimizations. Simulation shows that compared to WBS and HPF-NF, RDMS is able to reduce the amount of FPGA configurations to schedule random generated graphs with heavy weight nodes by 30% and 11% respectively. Additionally, the proof-of-concept implementation of a complex 13-node example task graph on the SGI RC100 reconfigurable computer shows that RDMS is not only able to trim down the amount of necessary configurations from 6 to 4 but also to reduce communication overhead by 48% and the hardware processing time by 33%. * One instantiation of a FPGA configuration is denoted to the process of loading the corresponding bitstream into the device, configuring it, executing the tasks in the configuration, and then releasing the device.

We present the realization of a physical quantum random number generator based on the process of splitting a beam of photons on a beam splitter, a quantum mechanical source of true randomness. By utilizing either a beam splitter or a polarizing beam splitter, single photon detectors and high speed electronics the presented devices are capable of generating a binary random signal with an autocorrelation time of 11.8 ns and a continuous stream of random numbers at a rate of 1 Mbit/s. The randomness of the generated signals and numbers is shown by running a series of tests upon data samples. The devices described in this paper are built into compact housings and are simple to operate.

There are several well known algorithms to minimize deterministic finite automata. Apart from the theoretical worst-case running time analysis, however, not much is known about the average-case analysis or practical performance of each of these algorithms. On this paper we compare three minimization algorithms based on experimental results. The choice of the algorithms was based on the fact that although having different worst-case complexities they are usually considered to be ones that achieve best performance. We used an uniform random generator of (initially-connected) deterministic finite automata for the input data, and thus our results are statistically accurate. Because one of the algorithms allowed to minimize nondeterministic finite automata (NFA), we also developed a non-uniform random generator for NFAs. Nevertheless, although not statistically significant, the results in this case are fairly interesting.

Part selection and machine loading are two major problems in the production planning phase of the flexible manufacturing systems. The problems have a combinatorial structure and usually, in practice, it is difficult to deal with this kind of problems using a mathematical programming model. In this paper, the above problems are formulated as a mixed-integer programming model which is handled sequentially and solved by a diversification-strategy-added version of the hybrid tabu search/simulated annealing algorithm of Zhang et al. (Comput Oper Res 35:282–294, 2008) presented in 2008. The performance of the algorithm is tested on eight random-generated problems with different sizes. The results are compared with those of the mathematical programming model, the original version of Zhang et al.’s (Comput Oper Res 35:282–294, 2008) algorithm and also a tabu search algorithm developed earlier by the authors.

In this paper, a computational model of fuzzy reliability focusing on solving the engineering problems with random general stress-fuzzy general strength is presented. The mathematical basis of this computational model is that the fuzzy probability can be computed with the computational method of conventional probability by use of a mathematical transition. Based on this computational model, a numerical algorithm is given which can be applied to compute the fuzzy reliability of mechanical components, sensors, electronic units, etc. This establishes a basis for the reliability analysis of systems consisting of components with fuzzy reliability. As an example, a case study about the fuzzy reliability analysis of a kind of sensor used in railway systems is provided to verify the logic of this algorithm. The computation results show that this algorithm fits the engineering experience. q

Abstract. Apart from the theoretical worst-case running time analysis not much is known about the average-case analysis or practical performance of finite automata minimization algorithms. On this paper we compare the running time of four minimization algorithms based on experimental results, and apply them to both deterministic and nondeterministic random automata. Although there is no clear winner, some conclusions can be taken for specific cases. Hopcroft&#x27;s algorithm performs better for DFAs with small alphabets, and, ...

This thesis describes a methodology for automating routine design problems. The research applied for developing this methodology consisted in three steps. Firstly, different types of complexity in routine design were investigated. Secondly, methods were developed to manage each type of complexity. Thirdly, the obtained methods were integrated into one methodology for routine design automation. The resulting methodology consists of the

We present a simple and efficient algorithm for randomly generating Tanner-graphs with given symbol-node and check-node degrees and without small cycles. These graphs can be used to design high performance Low-Density Parity-Check (LDPC) codes.

The object of this study was to identify potential risk and protective factors associated with psychological distress among the Cree of James Bay, through a secondary analysis of data on 1136 Cree (aged 15-85) from a random general population health survey in 1991. In multiple linear distress in the past week included: younger age, female gender, early loss of a parent or close relative, more life events in the year before the survey, a serious illness or drinking problem in the past year, ever having used cannabis, having more than elementary education, having fewer than five close friends/relatives and residing in an isolated or inland region. Having a good relationship with others in the community and spending more time in the bush were both associated with less distress. The relative importance of these factors varied across age/gender cohorts. We conclude that gender and generational differences should be considered when planning mental health promotion strategies for this population. In addition to more conventional approaches to reduce alcohol abuse, improve coping with loss and increase social support, targeted programs should be developed addressing the impact of education and role strain for women.

This paper analyses the responses given by children from two samples (n=320; n=147) to two test items concerning the fairness for a game of chance. We study the influence of age and mathematical ability on the percentage of correct responses. Interviews with a small sample of pupils serve to describe children's conceptions of fair games.

Objective To test the responsiveness of the Infant/Toddler Quality of Life Questionnaire (ITQOL) to five health conditions. In addition, to evaluate the impact of the child's age and gender on the ITQOL domain scores. Methods Observational study of 494 Dutch preschoolaged children with five clinical conditions and 410 healthy preschool children randomly sampled from the general population. The clinical conditions included neurofibromatosis type 1, wheezing illness, bronchiolitis, functional abdominal complaints, and burns. Health-related quality of life (HRQoL) was assessed by a mailed parent-completed ITQOL. Mean ITQOL scale scores for all conditions were compared with scores obtained from the reference sample. The effect of patient's age and gender on ITQOL scores was assessed using multi-variable regression analysis. Results In all health conditions, substantially lower scores were found for several ITQOL scales. The conditions had a variable effect on the type of ITQOL domains and a different magnitude of effect. Scores for 'physical functioning', 'bodily pain', and 'general health perceptions' showed the greatest range. Parental impact scales were equally affected by all conditions. In addition to disease type, the child's age and gender had an impact on HRQoL. Conclusions The five health conditions (each with a distinct clinical profile) affected the ITQOL scales differently. These results indicate that the ITQOL is sensitive to specific characteristics and symptom expression of the childhood health conditions investigated. This insight into the sensitivity of the ITQOL to health conditions with different symptom expression may help in the interpretation of HRQoL results in future applications. Keywords Health-related quality of life Á Preschool children Á ITQOL Á Variety of diseases Abbreviations BI Burn injury GP General population sample HRQoL Health-related quality of life ITQOL Infant/Toddler quality of life questionnaire NF1 Neurofibromatosis type 1 FAC Functional abdominal complaints RSV Respiratory syncytial virus WI Wheezing illness

Recently, random generation of time intervals has been proposed as a procedure to impair executive processing in a dual-task paradigm without substantial interference with phonological and visuo-spatial working memory resources. A fundamental assumption of this procedure is that humans are able to distinguish time sequences on their degree of randomness. The present study tests this assumption. To this end, nonbiased, repetition-biased, alternation-biased sequences and repetitive rhythms were judged under conditions of higher or lower executive load. In Exp. 1, load depended on the presentation speed, while in Exp. 2, a dual-task condition was used with either a concurrent numbercopying task or an arithmetic task. It was found that the participants could distinguish repetitive rhythms from more or less random sequences, and that both accuracy of this judgment and latency were aected by the concurrent load. The ®ndings are taken as a ®rst indication that random time judgment is capacity-limited.

Objective The objective of the research was to develop a generalized height-diameter model for Quercus suber L. in Portugal, which can be applied both to undebarked and debarked trees, with diameter at breast height over cork larger than 2.5 cm.

The paper analyzes the process leading to formation and perpetuation of high levels of NPAs in Indian Public Sector Banks (PSBs). It distinguishes between random and non-random reasons of NPA formation in PSBs. It points out that a high degree of arbitrariness is involved in defining NPAs as it fails to capture diversity in terms of the seasonal and cyclical nature of the economic activities in India. The study conceptualizes random reasons for default in a simplified framework of a Poisson process. It then argues that the non-random reasons go beyond the conventional paradigm of interim, ex-ante and ex-post information asymmetries and incomplete contracts. It points out that the financial notion of NPA as a mere risk phenomenon is inadequate, because a number of reasons leading to non-random generation of NPA are related to the dimension of uncertainty. It highlighted that the use of a secondary asset market may take care of NPA problem, but it requires a number of conditions for i...

The representation of combinatorial objects is decisive for the feasibility of several enumerative tasks. In this work, we present a unique string representation for complete initially-connected deterministic automata (ICDFAs) with n states over an alphabet of k symbols. For these strings we give a regular expression and show how they are adequate for exact and random generation, allow an alternative way for enumeration and lead to an upper bound for the number of ICDFAs. The exact generation algorithm can be used to ...

Today&#x27;s demand of secure data exchange and manipulation rely mostly on the use of cryptography. The most important and difficult part of any cryptographic system is to generate secret keys of high randomness quality. Therefore the generation process of random bits is becoming increasingly important. Since the use of a truly random generator is very difficult as they are generally

Physicochemical transport due to electro-osmosis of dilute electrolyte solutions (<1 × 10 −3 mol/L) through microporous media with granular random microstructures has been modeled in this work by our three-step numerical framework. First, the three-dimensional microstructures of porous media are reproduced by a random generation growth method. Second, the effects of chemical adsorption and electrical dissociation at the solid-liquid interfaces are modeled to determine the electrical boundary conditions, which vary with the ionic concentration, pH, and temperature. Finally, the nonlinear governing equations for electrokinetic transport are solved using a highly efficient lattice Poisson-Boltzmann algorithm. The simulation results indicate that the electro-osmotic permeability through the granular microporous media increases monotonically with the porosity, ionic concentration, pH, and temperature. When the surface electric potential is higher than about −50 mV, the electro-osmotic permeability exponentially increases with the electric potential. The electro-osmotic permeability increases with the bulk ionic concentration even though the surface zeta potential decreases correspondingly, which deviates from the conclusions based on the thin layer model. The electro-osmotic permeability increases exponentially with pH and linearly with temperature. The present modeling results improve our understanding of hydrodynamic and electrokinetic transport in geophysical systems and help guide the design of porous electrodes in microenergy systems.

This paper presents traffic analysis of Frame Bursting (FB) in Single-Input Single-Output (SISO) IEEE 802.3z (Gigabit Ethernet; GbE) Networks. This analysis characterizes the Frame bursting traffic behavior and performance measurement, shows its implications for future research issues. GbE is one of the world's largest Enterprise LANs solutions in terms of the number of concurrent users. FB Mechanism improves the performance of GbE CSMA/CD networks when transmitting short frames by reducing the Extension Field (EF) overhead, and tries to accord the controversy over the cross-layer (Layer2/Layer3) scheme. But FB get some negative effect like Jumbo Frame, long burst will affect the equal opportunity of other transmission. We simulate about 1 Tera-packets by random generation, let the packet pass through form non-FB domain to FB domain, observe that FB behavior like the burst per 100 packets (BPHP), packet per burst(PPB) and it's distribution, the burst length in different Input Rate, Input Channel, and Packet Length Distribution Input, The analysis of the burst performance reveals that the geometrical proportion between burst size and burst length, and the inverse proportion between the percentage of Burst and the output utilization after bursting. We find that there is a linear relationship between Input Rate and the burst behavior. As for the burst behavior is highly dynamic complex in variable Number of Inputs, and Packet Length Distribution types.

A classical result by Athreya and Karlin states that a supercritical Galton-Watson process in stationary ergodic environment f = (f 0 , f 1 ,...) (these are the random generating functions of the successively picked offspring distributions) has a positive chance of survival 1 − q(f) for almost all realizations of f provided that E log(1 − f 0 (0)) > −∞. While in some cases like when f 0 , f 1 ,... are i.i.d., this last condition together with supercriticality, viz. E log f 0 (1) > 0, is actually equivalent to q(f) < 1 a.s., there are others where it is not. This is demonstrated by giving a rather simple counterexample which in turn draws on the main result of this paper. The latter is intended to shed further light on the relation between E log(1 − f 0 (0)) > −∞ and the almost sure noncertain extinction property, the most interesting outcome being that, if E log f 0 (1) is also finite, then q(f) < 1 a.s. holds iff E log 1− f 0 •...• f T (0) 1− f 1 •...• f T (0) > −∞ for some random time T. The use of random times in connection with the stationary environment f will lead us quite naturally to the use of Palm-duality theory in some of our arguments.

Abstract: Regular expressions (res), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recognition depend on the size of the equivalent nondeterministic finite automata (NFA). We present the implementation of several algorithms for constructing small epsilon-free NFAss from res within the FAdo system, and a comparison of regular expression measures and NFA sizes based on experimental results obtained from uniform random generated res. ...

The quality of attempts at generating a random sequence of the numbers 1~5 was studied in 30 patients with dementia of the Alzheimer type (DAT) and 30 elderly normal control (NC) subjects. Three main findings emerged: (1) DAT patients' subjective random sequences were more stereotyped (contained fewer digit combinations) than those of NC subjects.

We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of a rejection-based approach, whose time complexity is shown to grow exponentially in k in some cases. We propose an alternative recursive algorithm, whose careful implementation allows for a non-redundant

In this paper, we are interested in a particular combinatorial optimisation problem (COP), namely the graph colouring problem (GCP). To solve the GCP, we present a parallel approach adopting an efficient strategy. A brief survey on known methods for solving the GCP enables us to justify our approach which is based on a hybrid method, starting from a set of solutions initialized by the so-called RLF colouring method and combining both a genetic algorithm and the tabu search. A parallelising strategy is then applied. The performances of our method were evaluated through a series of experimentations achieved on an IBM SP2 multiprocessor. The processed graphs were chosen from two benchmark sets. The first, taken from the Internet, involves graphs whose chromatic numbers are known and the second involves random generated graphs. The analysis of the results proves the interest of our approach.

The representation of combinatorial objects is decisive for the feasibility of several enumerative tasks. In this work, we present a unique string representation for complete initially-connected deterministic automata (ICDFAs) with n states over an alphabet of k symbols. For these strings we give a regular expression and show how they are adequate for exact and random generation, allow an alternative way for enumeration and lead to an upper bound for the number of ICDFAs. The exact generation algorithm can be used to partition the set of ICDFAs in order to parallelize the counting of minimal automata, and thus of regular languages. A uniform random generator for ICDFAs is presented that uses a table of pre-calculated values. Based on the same table, an optimal coding for ICDFAs is obtained.