Precision, Flexibility, and Tool Support

Author(s):  
Neelam Soundarajan ◽  
Jason O. Hallstrom

There are two important requirements that any approach to formalizing Design patterns must meet. First, the approach must enable the precise specification of the implementation requirements and behavioral guarantees associated with a wide range of patterns. Second, the formalization of each pattern must retain the pattern’s inherent flexibility. In this chapter, we present a novel approach to formalizing Design patterns that satisfies these seemingly conflicting requirements. For the formalism to be of practical value, we also need tools that can assist practitioners in determining whether the patterns used in designing their systems have been implemented correctly. Such tools are especially important during system maintenance and evolution to ensure that the design integrity of a system is not compromised. We show how our approach lends itself to the construction of such tools.

2021 ◽  
Vol 5 (EICS) ◽  
pp. 1-23
Author(s):  
Markku Laine ◽  
Yu Zhang ◽  
Simo Santala ◽  
Jussi P. P. Jokinen ◽  
Antti Oulasvirta

Over the past decade, responsive web design (RWD) has become the de facto standard for adapting web pages to a wide range of devices used for browsing. While RWD has improved the usability of web pages, it is not without drawbacks and limitations: designers and developers must manually design the web layouts for multiple screen sizes and implement associated adaptation rules, and its "one responsive design fits all" approach lacks support for personalization. This paper presents a novel approach for automated generation of responsive and personalized web layouts. Given an existing web page design and preferences related to design objectives, our integer programming -based optimizer generates a consistent set of web designs. Where relevant data is available, these can be further automatically personalized for the user and browsing device. The paper includes presentation of techniques for runtime adaptation of the designs generated into a fully responsive grid layout for web browsing. Results from our ratings-based online studies with end users (N = 86) and designers (N = 64) show that the proposed approach can automatically create high-quality responsive web layouts for a variety of real-world websites.


2021 ◽  
Vol 15 (5) ◽  
pp. 1-32
Author(s):  
Quang-huy Duong ◽  
Heri Ramampiaro ◽  
Kjetil Nørvåg ◽  
Thu-lan Dam

Dense subregion (subgraph & subtensor) detection is a well-studied area, with a wide range of applications, and numerous efficient approaches and algorithms have been proposed. Approximation approaches are commonly used for detecting dense subregions due to the complexity of the exact methods. Existing algorithms are generally efficient for dense subtensor and subgraph detection, and can perform well in many applications. However, most of the existing works utilize the state-or-the-art greedy 2-approximation algorithm to capably provide solutions with a loose theoretical density guarantee. The main drawback of most of these algorithms is that they can estimate only one subtensor, or subgraph, at a time, with a low guarantee on its density. While some methods can, on the other hand, estimate multiple subtensors, they can give a guarantee on the density with respect to the input tensor for the first estimated subsensor only. We address these drawbacks by providing both theoretical and practical solution for estimating multiple dense subtensors in tensor data and giving a higher lower bound of the density. In particular, we guarantee and prove a higher bound of the lower-bound density of the estimated subgraph and subtensors. We also propose a novel approach to show that there are multiple dense subtensors with a guarantee on its density that is greater than the lower bound used in the state-of-the-art algorithms. We evaluate our approach with extensive experiments on several real-world datasets, which demonstrates its efficiency and feasibility.


Author(s):  
Primož Cigoj ◽  
Borka Jerman Blažič

This paper presents a novel approach to education in the area of digital forensics based on a multi-platform cloud-computer infrastructure and an innovative computer based tool. The tool is installed and available through the cloud-based infrastructure of the Dynamic Forensic Education Alliance. Cloud computing provides an efficient mechanism for a wide range of services that offer real-life environments for teaching and training cybersecurity and digital forensics. The cloud-based infrastructure, the virtualized environment and the developed educational tool enable the construction of a dynamic e-learning environment making the training very close to reality and to real-life situations. The paper presents the Dynamic Forensic Digital tool named EduFors and describes the different levels of college and university education where the tool is introduced and used in the training of future investigators of cybercrime events.


Author(s):  
R. K. Adhikari ◽  
P. P. Regmi ◽  
R. B Thapa ◽  
Y. D. G.C. ◽  
E. Boa

 This paper identified and examined the internal and external forces that enable or inhibit the performance of plant clinics in Nepal. The study used web-based online survey tool to collect primary information. Likert scaling and indexing techniques were used on data analysis. Pretested set of questionnaires were mailed to 209 plant doctors and the response rate was 54.54%. Being ninth country to initiate plant health clinics, Nepal is successful to adapt this novel approach into the existing extension system. It has increased access to plant health services by providing wide range of services at a place. However,limited understanding and only profit motive of local private agro-vet and input dealers has created some biased-understanding and un-trust with clinic organizers. This SWOT analysis clearly spells the scope of plant clinics to fulfill the gap between farmers need and existing services provided by public extension system.Journal of the Institute of Agriculture and Animal Science.Vol. 33-34, 2015, page: 137-146


2021 ◽  
Author(s):  
Anne M Luescher ◽  
Julian Koch ◽  
Wendelin J Stark ◽  
Robert N Grass

Aerosolized particles play a significant role in human health and environmental risk management. The global importance of aerosol-related hazards, such as the circulation of pathogens and high levels of air pollutants, have led to a surging demand for suitable surrogate tracers to investigate the complex dynamics of airborne particles in real-world scenarios. In this study, we propose a novel approach using silica particles with encapsulated DNA (SPED) as a tracing agent for measuring aerosol distribution indoors. In a series of experiments with a portable setup, SPED were successfully aerosolized, re-captured and quantified using quantitative polymerase chain reaction (qPCR). Position-dependency and ventilation effects within a confined space could be shown in a quantitative fashion achieving detection limits below 0.1 ng particles per m3 of sampled air. In conclusion, SPED show promise for a flexible, cost-effective and low-impact characterization of aerosol dynamics in a wide range of settings.


Quantum ◽  
2019 ◽  
Vol 3 ◽  
pp. 125 ◽  
Author(s):  
Farid Shahandeh ◽  
Martin Ringbauer

Quantum optomechanics uses optical means to generate and manipulate quantum states of motion of mechanical resonators. This provides an intriguing platform for the study of fundamental physics and the development of novel quantum devices. Yet, the challenge of reconstructing and verifying the quantum state of mechanical systems has remained a major roadblock in the field. Here, we present a novel approach that allows for tomographic reconstruction of the quantum state of a mechanical system without the need for extremely high quality optical cavities. We show that, without relying on the usual state transfer presumption between light an mechanics, the full optomechanical Hamiltonian can be exploited to imprint mechanical tomograms on a strong optical coherent pulse, which can then be read out using well-established techniques. Furthermore, with only a small number of measurements, our method can be used to witness nonclassical features of mechanical systems without requiring full tomography. By relaxing the experimental requirements, our technique thus opens a feasible route towards verifying the quantum state of mechanical resonators and their nonclassical behaviour in a wide range of optomechanical systems.


2017 ◽  
Vol 16 (3) ◽  
pp. 6213-6218
Author(s):  
Ramandeep Kaur ◽  
Dinesh Kumar

Wireless sensor networks have become increasingly popular due to their wide range of application. Clustering sensor nodes organizing them hierarchically have proven to be an effective method to provide better data aggregation and scalability for the sensor network while conserving limited energy. Minimizing the energy consumption of a wireless sensor network application is crucial for effective realization of the intended application in terms of cost, lifetime, and functionality. However, the minimizing task is hardly possible as no overall energy cost function is available for optimization. In this paper, we have proposed a modified alogirthm of leach where hard and soft threshold values will be applied for improving the overall throughput and network lifetime.


2021 ◽  
Vol 12 ◽  
Author(s):  
Fernanda O. Novais ◽  
Camila Farias Amorim ◽  
Phillip Scott

Cutaneous leishmaniasis exhibits a wide spectrum of clinical presentations from self-resolving infections to severe chronic disease. Anti-parasitic drugs are often ineffective in the most severe forms of the disease, and in some cases the magnitude of the disease can result from an uncontrolled inflammatory response rather than unrestrained parasite replication. In these patients, host-directed therapies offer a novel approach to improve clinical outcome. Importantly, there are many anti-inflammatory drugs with known safety and efficacy profiles that are currently used for other inflammatory diseases and are readily available to be used for leishmaniasis. However, since leishmaniasis consists of a wide range of clinical entities, mediated by a diverse group of leishmanial species, host-directed therapies will need to be tailored for specific types of leishmaniasis. There is now substantial evidence that host-directed therapies are likely to be beneficial beyond autoimmune diseases and cancer and thus should be an important component in the armamentarium to modulate the severity of cutaneous leishmaniasis.


Author(s):  
RAMIN HALAVATI ◽  
SAEED BAGHERI SHOURAKI

Persian is a fully cursive handwriting in which each character may take different forms in different parts of the word, characters overlap and there is a wide range of possible styles. These complexities make automatic recognition of Persian a very hard task. This paper presents a novel approach on recognition of such writings systems which is based on the description of input stream by a sequence of fuzzy linguistic terms; representation of character patterns with the same descriptive language; and comparison of inputs with character patterns using a novel elastic pattern matching approach. As there is no general benchmark for recognition of Persian handwriting, the approach has been tested on the set of words in first primary Iranian school books including 1250 words resulting in 78% correct recognition without dictionary and 96% with dictionary.


2013 ◽  
Vol 23 (4) ◽  
pp. 357-401 ◽  
Author(s):  
GEORGES GONTHIER ◽  
BETA ZILIANI ◽  
ALEKSANDAR NANEVSKI ◽  
DEREK DREYER

AbstractMost interactive theorem provers provide support for some form of user-customizable proof automation. In a number of popular systems, such as Coq and Isabelle, this automation is achieved primarily through tactics, which are programmed in a separate language from that of the prover's base logic. While tactics are clearly useful in practice, they can be difficult to maintain and compose because, unlike lemmas, their behavior cannot be specified within the expressive type system of the prover itself.We propose a novel approach to proof automation in Coq that allows the user to specify the behavior of custom automated routines in terms of Coq's own type system. Our approach involves a sophisticated application of Coq's canonical structures, which generalize Haskell type classes and facilitate a flexible style of dependently-typed logic programming. Specifically, just as Haskell type classes are used to infer the canonical implementation of an overloaded term at a given type, canonical structures can be used to infer the canonical proof of an overloaded lemma for a given instantiation of its parameters. We present a series of design patterns for canonical structure programming that enable one to carefully and predictably coax Coq's type inference engine into triggering the execution of user-supplied algorithms during unification, and we illustrate these patterns through several realistic examples drawn from Hoare Type Theory. We assume no prior knowledge of Coq and describe the relevant aspects of Coq type inference from first principles.


Sign in / Sign up

Export Citation Format

Share Document