Design Strategies for ARX with Provable Bounds: SPARX and LAX

We present, for the first time, a general strategy for designing ARX symmetric-key primitives with provable resistance against single-trail differential and linear cryptanalysis. The latter has been a long standing open problem in the area of ARX design. The Wide-Trail design Strategy (WTS), that is at the basis of many S-box based ciphers, including the AES, is not suitable for ARX designs due to the lack of S-boxes in the latter. In this paper we address the mentioned limitation by proposing the Long-Trail design Strategy (LTS) -- a dual of the WTS that is applicable (but not limited) to ARX constructions. In contrast to the WTS, that prescribes the use of small and efficient S-boxes at the expense of heavy linear layers with strong mixing properties, the LTS advocates the use of large (ARX-based) S-Boxes together with sparse linear layers. With the help of the so-called long-trail argument, a designer can bound the maximum differential and linear probabilities for any number of rounds of a cipher built according to the LTS. To illustrate the effectiveness of the new strategy, we propose Sparx -- a family of ARX-based block ciphers designed according to the LTS. Sparx has 32-bit ARX-based S-boxes and has provable bounds against differential and linear cryptanalysis. In addition, Sparx is very efficient on a number of embedded platforms. Its optimized software implementation ranks in the top-6 of the most software-efficient ciphers along with Simon, Speck, Chaskey, LEA and RECTANGLE. As a second contribution we propose another strategy for designing ARX ciphers with provable properties, that is completely independent of the LTS. It is motivated by a challenge proposed earlier by Wallen and uses the differential properties of modular addition to minimize the maximum differential probability across multiple rounds of a cipher. A new primitive, called LAX is designed following those principles. LAX partly solves the Wallen challenge

Intitatives for a Smart Economy 2.0

Just like its predecessor, I4SE 2.0 is organized in a manner that focuses on those sectors of the local economy identified by WNYREDC as growth sectors. It identifies initiatives within those sectors where Erie County can make a meaningful contribution. These sectors include: advanced manufacturing, smart growth implementation, workforce development, agriculture, bi-national logistics, energy, and tourism. The report also identifies specific initiatives that Erie County will undertake in other important areas, beyond the WNYREDC growth sectors, that contribute to a thriving and inclusive local economy. These include quality of life initiatives, as well as those focused on the “blue” economy and enhancement of the Erie County Industrial Development Agency (“ECIDA”)

On the Efficiency of Optimising Shallow Backtracking in Prolog

The cost of backtracking has been identified as one of the bottlenecks in achieving peak performance in compiled Prolog programs. Much of the backtracking in Prolog programs is shallow, i.e. is caused by unification failures in the head of a clause when there are more alternatives for the same procedure, and so special treatment of this form of backtracking has been proposed as a significant optimisation. This paper describes a modified WAM which optimises shallow backtracking. Four different implementation approaches are compared. A number of benchmark results are presented, measuring the relative tradeoffs between compilation time, code size, and run time. The results show that the speedup gained by this optimisation can be significant

Parks & Equity: A Framework for Equitable Access in Richmond, VA Parks

Increasingly, cities are investing in their green spaces, such as open spaces and parks, as a strategy to improve the livability of the city, but also to improve the health of its residents. Research finds that access and proximity to green spaces provides a host of benefits to humans, including mental and physical health improvements. However, not all residents have equal access to these green public amenities. Research focuses on best practices for identifying minimum basic standards for DPR parks and the importance and limitations of green spaces in urban design. Basic standards include: setting the minimum limit for amenities in parks, best policies, implementation practices, and funding. The plan includes an analysis of the study area, Richmond, Virginia, and park access based on age, income, and race

Personalised trails and learner profiling within e-learning environments

This deliverable focuses on personalisation and personalised trails. We begin by introducing and defining the concepts of personalisation and personalised trails. Personalisation requires that a user profile be stored, and so we assess currently available standard profile schemas and discuss the requirements for a profile to support personalised learning. We then review techniques for providing personalisation and some systems that implement these techniques, and discuss some of the issues around evaluating personalisation systems. We look especially at the use of learning and cognitive styles to support personalised learning, and also consider personalisation in the field of mobile learning, which has a slightly different take on the subject, and in commercially available systems, where personalisation support is found to currently be only at quite a low level. We conclude with a summary of the lessons to be learned from our review of personalisation and personalised trails

Innovative observing strategy and orbit determination for Low Earth Orbit Space Debris

We present the results of a large scale simulation, reproducing the behavior of a data center for the build-up and maintenance of a complete catalog of space debris in the upper part of the low Earth orbits region (LEO). The purpose is to determine the performances of a network of advanced optical sensors, through the use of the newest orbit determination algorithms developed by the Department of Mathematics of Pisa (DM). Such a network has been proposed to ESA in the Space Situational Awareness (SSA) framework by Carlo Gavazzi Space SpA (CGS), Istituto Nazionale di Astrofisica (INAF), DM, and Istituto di Scienza e Tecnologie dell'Informazione (ISTI-CNR). The conclusion is that it is possible to use a network of optical sensors to build up a catalog containing more than 98% of the objects with perigee height between 1100 and 2000 km, which would be observable by a reference radar system selected as comparison. It is also possible to maintain such a catalog within the accuracy requirements motivated by collision avoidance, and to detect catastrophic fragmentation events. However, such results depend upon specific assumptions on the sensor and on the software technologies

Preliminary Sunyaev Zel'dovich Observations of Galaxy Clusters with OCRA-p

We present 30 GHz Sunyaev Zel'dovich (SZ) observations of a sample of four galaxy clusters with a prototype of the One Centimetre Receiver Array (OCRA-p) which is mounted on the Torun 32-m telescope. The clusters (Cl0016+16, MS0451.6-0305, MS1054.4-0321 and Abell 2218) are popular SZ targets and serve as commissioning observations. All four are detected with clear significance (4-6 sigma) and values for the central temperature decrements are in good agreement with measurements reported in the literature. We believe that systematic effects are successfully suppressed by our observing strategy. The relatively short integration times required to obtain these results demonstrate the power of OCRA-p and its successors for future SZ studies.Comment: 9 pages, 2 figures. Accepted by MNRAS, online earl

Routing design for less-than-truckload motor carriers using ant colony techniques

One of the most important challenges for Less-Than-Truck-Load carriers consists of determining how to consolidate flows of small shipments to minimize costs while maintaining a certain level of service. For any origin-destination pair, there are several strategies to consolidate flows, but the most usual ones are: peddling/collecting routes and shipping through one or more break-bulk terminals. Therefore, the target is determining a route for each origin-destination pair that minimizes the total transportation and handling cost guaranteeing a certain level of service. Exact resolution is not viable for real size problems due to the excessive computational time required. This research studies different aspects of the problem and provides a metaheuristic algorithm (based on Ant Colonies Optimization techniques) capable of solving real problems in a reasonable computational time. The viability of the approach has been proved by means of the application of the algorithm to a real Spanish case, obtaining encouraging results