662 research outputs found

    StarL: Toward a web interface for distributed robotics

    Get PDF
    Most first-time users find it complicated to use the StarL programming framework, especially when they have little experience with Java. The major challenges for programming distributed robotic applications are (1) the learning curve for Java, (2) setting up the StarL development environment, and (3) learning curve for effectively using the Java functions in StarL. We therefore introduce the StarL web interface that provides a more user-friendly access to the StarL programming framework while emphasizing more on the StarL high-level coordination of distributed robots. The StarL web interface enables researchers to implement their applications on distributed robots in the StarL high-level language, run the project and then plot the experiment data for analyzing the robot's traces. The main contribution of this thesis is the user-friendly interface with syntax highlighting and data visualization of the robots' traces obtained through simulation. A Formation example application will illustrate the many aspects of the StarL web interface.Ope

    Optimization in Bochner Spaces

    Full text link
    In this paper, we study some optimization problems in uniformly convex and uniformly smooth Bochner spaces. We consider four cases of the underlying subsets: closed and convex subsets, closed and convex cones, closed subspaces and closed balls. In each case, we study the existence problems and the inverse image properties. We think that the results and the analytic methods in this paper could be applied to the theories of stochastic optimization, stochastic variational inequality and stochastic fixed point

    Multiple solutions for a system of equations with p-Laplacian

    Get PDF
    AbstractIn the paper, by using of the Limit Index, we prove a theorem applying to get multiple critical values of some strongly indefinite nonsmooth functionals, and then we apply it to a system of equations involving the p-Laplacian

    Fast Parallel Molecular Algorithms for DNA-Based Computation: Solving the Elliptic Curve Discrete Logarithm Problem over GF(2n)

    Get PDF
    Elliptic curve cryptographic algorithms convert input data to unrecognizable encryption and the unrecognizable data back again into its original decrypted form. The security of this form of encryption hinges on the enormous difficulty that is required to solve the elliptic curve discrete logarithm problem (ECDLP), especially over GF(2n), n āˆˆ Z+. This paper describes an effective method to find solutions to the ECDLP by means of a molecular computer. We propose that this research accomplishment would represent a breakthrough for applied biological computation and this paper demonstrates that in principle this is possible. Three DNA-based algorithms: a parallel adder, a parallel multiplier, and a parallel inverse over GF(2n) are described. The biological operation time of all of these algorithms is polynomial with respect to n. Considering this analysis, cryptography using a public key might be less secure. In this respect, a principal contribution of this paper is to provide enhanced evidence of the potential of molecular computing to tackle such ambitious computations

    The vibrostabilization optimization of a sorting arm structure

    Get PDF
    Vibration in the chip production process greatly limits the devicesā€™working efficiency. There is a strong need to develop an optimization method to improve the structure vibrostabilization. In this paper, we studied an LED sorting arm and optimization the sorting arm in three steps. Firstly, a series of experiment are carried out to optimize the particle damping capsule distributionand filling ratio. Then, an improved level set optimization algorithm is adopted to carry out the shape and topology optimization of the arm with a damping capsule at the same time. At last, the virtual and real tests are carried out on three arms, the results proved that our optimize method can effectively suppress the vibration

    Landā€’atmosphere coupling effects of soil temperature and moisture on extreme precipitation in the arid regions of Northwest China

    Get PDF
    With global warming and more frequent extreme precipitation events in recent years, the phenomenon of warming and humidification in the arid regions of Northwest China (ANWC) has attracted increasing attention. We assessed the coupling effects of soil temperature and moisture on extreme precipitation in the ANWC by using daily precipitation data from CN05.1 and monthly data on soil temperature, soil moisture, and energy from ERA5-land, 1961ā€“2018. After logical partitioning by K-means clustering, the primary influencing routes in each partition were investigated using two indices of extreme precipitation, indicated by precipitation on very wet days (R95P) and the number of extreme precipitation days (R10day). We found that 1) Local extreme precipitation has had a steadily growing impact on overall precipitation. In summer, this impact is primarily driven by an increase in the quantity of extreme precipitation, but in winter, it is primarily driven by an increase in the intensity of single precipitation. 2) The Tianshan Mountains (TM) and Qilian Mountains (QM) are the key locations for the coupling of soil temperature and moisture with the extreme precipitation index. Both locations exhibit a positive coupling state for soil temperature with extreme precipitation with positive coupling in the TM but negative coupling in the QM for soil moisture with extreme precipitation. 3) In the coupling of soil temperature and moisture with energy, the relevant significant regions are almost all over the ANWC throughout the year and all seasons, and the coupling high-value areas are concentrated around the basin. 4) In the TMā€“Hami Basin (HB)ā€“QM, the coupling between energy and the extreme precipitation index is also stronger. The specific coupling paths have been changing with seasonal and regional changes

    Big Changes in How Students are Tested

    Get PDF
    For the past decade, school accountability has relied on tests for which the essential format has remained unchanged. Educators are familiar with the yearly testing routine: schools are given curriculum frameworks, teachers use the frameworks to guide instruction, students take one big test at yearā€™s end which relies heavily upon multiple-choice bubble items, and then school leaders wait anxiously to find out whether enough of their students scored at or above proficiency to meet state standards. All this will change with the adoption of Common Core standards. Testing and accountability arenā€™t going away. Instead, they are developing and expanding in ways that aim to address many of the present shortcomings of state testing routines. Most importantly, these new tests will be computer-based. As such, they will potentially shorten testing time, increase testsā€™ precision, and provide immediate feedback to students and teachers
    • ā€¦
    corecore