Unfolding Transformation Research Articles

Foundation of a new technique for geometric and non-geometric multi-shapes similarities degrees using boundary unfolding transformation with applications

This paper presents a novel approach for measuring multi-shapes degrees of similarities. A new shape transformation concept is suggested through mapping the closed boundary of the shape using unfolded process into one-to-one equivalent graph (or signal) where ample number of approaches for similarity testing can be applied. The degree of similarity is then measured by calculating the discrepancies between each of the two transformed unfolded-graphs autocorrelation functions. The proposed method is also effective in applying clustering technique for clustering groups of shapes into three hierarchical similarity levels depending on their mutual degree of similarity. The suggested similarity method handles two categories of shapes: geometric and non-geometric. Unlike other well-known techniques in the subject of machine learning and deep learning, the presented method represents a powerful analytical-based technique for similarity analysis of both regular and irregular shapes regardless of size or orientation, and in effectively handling compound or multi-shapes degrees of similarities. The results of testing the approach on selected datasets have successfully demonstrated the great effectiveness of the developed technique in yielding output multi-shape degrees of similarities in new graphical and comprehensive forms. Finally, it is pointed out that the new approach will have many potential real-life applications such as in industry, medicine, biology, security, and authentications.

Institutionalized Social Entrepreneurship in Indonesia: A report on the challenges of state-driven social entrepreneurship promotion within the Five Cities' social assistance program

ABSTRACT The landscape of social entrepreneurship has undergone rapid evolution within business and non-profit sectors in recent years. However, there is a more recent trend in Indonesia, where social entrepreneurship is formally practised in public policy. This new approach represents an initiative related to what we call Institutionalized Social Entrepreneurship (ISE). In this article, we investigate the challenges faced while implementing experimental measures to transform cash transfers into social entrepreneurship programs based on 43 interviews with key stakeholders and end-users spreading over five regions. Our research findings indicate a lack of shared understanding among stakeholders when implementing social entrepreneurship programs. Furthermore, the beneficiaries face difficulties distinguishing between social entrepreneurship programs and regular cash transfers, leading to ineffective program outcomes and significant challenges in achieving community development objectives. This issue is exacerbated by an unbalanced power distribution between government and non-government actors involved in program implementation, which can potentially limit the program’s effectiveness and efficiency. Its unfolding transformation of social assistance and the application of social entrepreneurship in Indonesia highlight a new deal for welfare that responds to uncertain post-pandemic circumstances. This study adds to the literature on social entrepreneurship by highlighting the complexities of the state-society relationship in ISE.

Seeking a safe and efficient similarity-based unfolding rule

The unfolding transformation has been widely used in many declarative frameworks for improving the efficiency of programs. Inspired by our previous experiences in fuzzy logic languages that do not deal with similarity relations, in this work we try to adapt such operation to the framework of the fuzzy logic programming language FASILL (acronym of “Fuzzy Aggregators and Similarity Into a Logic Language”) which has been developed in our research group for coping with implicit/explicit truth degree annotations, a great variety of connectives and unification by similarity. The traditional unfolding transformation is based on the application of unifiers on the heads and computational steps on the bodies of program rules. However, when considering similarity relations, the premature generation and application of weak (similarity-based) unifiers at unfolding time could destroy the correctness (i.e., the soundness and completeness) of the transformation. In this paper we study how to avoid the risk, by imposing some conditions on programs in order to be safely unfolded. We show that these conditions are sufficient to guarantee the correctness of the unfolding transformation, and we present some experiments performed with the implemented online tool for illustrating the improved efficiency of unfolded programs.

FPGA-based Implementation of SHA-256 with Improvement of Throughput using Unfolding Transformation

Security has grown in importance as a study issue in recent years. Several cryptographic algorithms have been created to increase the performance of these information-protecting methods. One of the cryptography categories is a hash function. This paper proposes the implementation of the SHA-256 (Secure Hash Algorithm-256) hash function. The unfolding transformation approach was presented in this study to enhance the throughput of the SHA-256 design. The unfolding method is employed in the hash function by producing the hash value output based on modifying the SHA-256 structure. In this unfolding method, SHA-256 decreases the number of clock cycles required for traditional architecture by a factor of two, from 64 to 34 because of the delay. To put it another way, one cycle of the SHA-256 design can generate up to four parallel inputs for the output. As a result, the throughput of the SHA-256 design can be improved by reducing the number of cycles by 16 cycles. ModelSim was used to validate the output simulations created in Verilog code. The SHA-256 hash function factor four hardware implementation was successfully tested using the Altera DE2-115 FPGA board. According to timing simulation findings, the suggested unfolding hash function with factor four provides the most significant throughput of around 4196.30 Mbps. In contrast, the suggested unfolding with factor two surpassed the classic SHA-256 design in terms of maximum frequency. As a result, the throughput of SHA-256 increases 13.7% compared to unfolding factor two and 58.1% improvement from the conventional design of SHA-256 design.

Метрики устойчивости экономического развития ЕАЭС: проблема «ядра» системы показателей и пороговых значений

In the subject area of macroeconomic indicators there is currently not only an active search for new solutions, but also their almost continuous implementation in the practice of macroeconomic regulation. Multiple crisis processes in the world economy and politics, unfolding technological transformation, sharp manifestation of medical and biological threats have created additional impulses for forming and applying new models for assessing macroeconomic realities and a set of sustainable development problems. In the practice of world integration associations and the EAEU in particular, considerable experience has been accumulated in applying the systems of macroeconomic indicators with threshold values and procedures for responding to their violations. Critical analysis of the current system of macroeconomic indicators in the EAEU made it possible to substantiate a new vision of both the composition of indicators of sustainable economic development of the EAEU member states and assessment criteria as well as threshold values.

A HEVC Video Steganalysis Against DCT/DST-Based Steganography

The development of video steganography has put forward a higher demand for video steganalysis. This paper presents a novel steganalysis against discrete cosine/sine transform (DCT/DST)-based steganography for high efficiency video coding (HEVC) videos. The new steganalysis employs special frames extraction (SFE) and accordion unfolding (AU) transformation to target the latest DCT/DST domain HEVC video steganography algorithms by merging temporal and spatial correlation. In this article, the distortion process of DCT/DST-based HEVC steganography is firstly analyzed. Then, based on the analysis, two kinds of distortion, the intra-frame distortion and the inter-frame distortion, are mainly caused by DCT/DST-based steganography. Finally, to effectively detect these distortions, an innovative method of HEVC steganalysis is proposed, which gives a combination feature of SFE and a temporal to spatial transformation, AU. The experiment results show that the proposed steganalysis performs better than other methods.

A 128- Bit of Md5 Algorithm with 16 Stages of P&Eline Using Unfolding Design

We defined the hash algorithm as a security object during data transmission. The hash features are 4 more types 1. Message digest (MDS) 2. RIPMED (Race Integrated primitivity of Message Digest) 3. SHA (Secured Hash Function i) 4. WHIRLFOOL. From this group of hashes, Message Digest 5 is mostly using in embeddedsecuritysystems. To obtain high frequency and throughput in regions of Area, frequency and throughput by the unfolding transformation technique factor of 2. To get better outcomes to overcome the dis-advantages of existing method, the proposed design is reduced the data fetching stages from 32 to 16 stages. However, the overall process is speedy than the existing algorithm.

SUFI PRACTICES IN CONTEMPORARY KAZAKHSTAN: TRADITIONS AND INNOVATIONS

We deemed it necessary to write about the Sufi tradition in Kazakhstan and its unfolding transformation into new practices. Religious revival in Kazakhstan has made Sufism, its teaching and practices very attractive. Its traditions have survived in the Soviet past and were revived in post-Soviet Kazakhstan. Pilgrimage to holy places, first and foremost within Kazakhstan, and veneration of saints have gained popularity as prominent features of Sufism. The same process is unfolding in the neighboring states—in Uzbekistan, Kyrgyzstan, the Northern and Southern Caucasus, and Turkey. In Soviet times, in Kazakhstan, however, the Sufi tradition was partly crushed by repressive secularization practiced by Soviet authorities, which explains why Sufism is sometimes revived in the form of pseudo-Sufi teachings. Sufism is a multi-dimensional phenomenon, therefore, the forms of its revival should be studied in depth to tap its spiritual and moral potential for the purposes of our country’s cultural development. No wonder that Sufism and its profound spiritual teaching of Islamic mysticism have stirred up a lot of interest in both Muslim and Christian regions in the country’s western part. The article examines the forms of revival, traditions and transformations of Sufism in our country. In our analysis we relied on scientifically proven information from open academic sources and our field studies carried out using the methods of participant observation and in-depth interviews.

High-Throughput of SHA-256 Hash Function with Unfolding Transformation

Hash Function in cryptography algorithms is used to encrypt the message by giving the appropriate output based on the structure of the hash function itself. This algorithm is important for security applications such as Keyed-Hash Message Authentication Code (HMAC), digital signature, and others. There are different types of hash functions such as MD5, SHA-1, RIPEMD-160, SHA-256, SHA-224, SHA-384, SHA-512, and others. In this paper, the unfolding transformation method was proposed to improve the throughput of the SHA-256 hash function. Three types of SHA-256 hash function were designed namely SHA-256 design, SHA-256 design inner pipelining with unfolding factor 2, and SHA-256 design inner pipelining with unfolding factor 4. The designs were written in Verilog code and the output simulations were verified using ModelSim. The simulation results showed that the proposed SHA-256 inner pipelining unfolding with factor 4 provided the highest throughput which is 4196.30 Mbps, and factor 2 was superior in terms of maximum frequency and was better than the conventional SHA-256 design. Type of Paper: other. Keywords: Cryptography algorithm; FPGA; SHA-256 Hash Function; Unfolding transformation, Verilog

Application of unfolding transformation in the random matrix theory to analyze in vivo neuronal spike firing during awake and anesthetized conditions

General anesthetics decrease the frequency and density of spike firing. This effect makes it difficult to detect spike regularity. To overcome this problem, we developed a method utilizing the unfolding transformation which analyzes the energy level statistics in the random matrix theory. We regarded the energy axis as time axis of neuron spike and analyzed the time series of cortical neural firing in vivo. Unfolding transformation detected regularities of neural firing while changes in firing densities were associated with pentobarbital. We found that unfolding transformation enables us to compare firing regularity between awake and anesthetic conditions on a universal scale.

Democratization, post-industrialization, and East Asian welfare capitalism: the politics of welfare state reform in Japan, South Korea, and Taiwan

This review article provides an overview of the scholarship on the establishment and reform of East Asian welfare capitalism. The developmental welfare state theory and the related productivist welfare regime approach have dominated the study of welfare states in the region. This essay, however, shows that a growing body of research challenges the dominant literature. We identify two key driving factors of welfare reform in East Asia, namely democratization and post-industrialization; and discuss how these two drivers have undermined the political and functional underpinnings of the post-war equilibrium of the East Asian welfare/production regime. Its unfolding transformation and the new politics of social policy in the region challenge the notion of “East Asian exceptionalism”, and we suggest that recent welfare reforms call for a better integration of the region into the literature of advanced political economies to allow for cross-fertilization between Eastern and Western literatures.

Global Value Chains: A Framework for Analysis

Today, more than two-thirds of all transnational trade is conducted by multinational corporations and a full half of that trade—one-third of all transnational trade—is between corporate subsidiaries. These figures reflect the unfolding transformation of traditionally labelled ‘corporate supply chains’ into what are now termed ‘global value chains’. Global value chains have inspired keen, and at times contested, attention from a range of academic, business and policy perspectives. Legal scholars, however, have remained largely outside these debates. This article is the first to fully integrate into legal scholarship the fundamental insights of the robust, multidisciplinary body of academic literature on global value chains. It is seminal in tying together the ongoing paradigm shifts taking place in the global political economy with their relevant legal phenomena, while also opening up opportunities for legal scholars to engage in normative interventions across multiple legal disciplines.

'Open-sourcing' personal learning

This article offers a critical reflection on the contemporary Open Educational Resource (OER) movement, its unquestioned investment in a collective 'content fetish' and an educational 'problem description' that focuses on issues of scarcity, access, and availability of quality materials. It also argues that OER proponents fail to take notice of historically new forms of learning activity emerging within the unfolding digital transformation of our global society. The article reviews some descriptive accounts of such learning activity and suggests that 'networked autodidaxy' in particular can provide inspiration for the critical review of our ideas regarding open resources and practices in education

High Performance and Low Power Hardware Implementation for Cryptographic Hash Functions

Since hash functions are cryptography's most widely used primitives, efficient hardware implementation of hash functions is of critical importance. The proposed high performance hardware implementation of the hash functions used sponge construction which generates desired length digest, considering two key design metrics: throughput and power consumption. Firstly, this paper introduces unfolding transformation which increases the throughput of hash function and pipelining and parallelism design techniques which reduce the delay. Secondly, we propose a frequency trade-off technique which can give us a scope of frequency value for making a trade-off between low dynamic power consumption and high throughput. Finally, we use load-enable based clock gating scheme to eliminate wasted toggle rate of signals in the idle mode of hash encryption system. We demonstrated the proposed design techniques by using 45 nm CMOS technology at 10 MHz. The results show that we can achieve up to 47.97 times higher throughput, 6.31% delay reduction, and 13.65% dynamic power reduction.

Design and Development MIPS Processor Based on a High Performance and Low Power Architecture on FPGA

This paper presents the design and development of a high performance and low power MIPS microprocessor and implementation on FPGA. In this method we for achieving high performance and low power in the operation of the proposed microprocessor use different methods including, unfolding transformation (parallel processing), C-slow retiming technique, and double edge registers are used to get even reduce power consumption. Also others blocks designed based on high speed digital circu its. Because of feedback loop in the proposed architecture C-slo w retiming can enhance designs that contain feedback loops. The C-slow retiming is well-known for optimization and high performance technique, it automatically rebalances the registers in the proposed design. The proposed high performance microprocessor is modeled and verified using FPGA and simulation results. The proposed methods in microprocessor have been successfully synthesized and imp lemented in Quartus II 9.1 and Strat ix II FPGA, to target device EP2S15F484C3, and power is analyzed with Xpower analyzer. Results demonstrate that the proposed method has high performance.

Liberation Meets the State

Watching the uprisings unfold in the Middle East, as well as the opposition to them, leads me to appreciate the insights of social movement theory, which suggests that heterogeneous forces can unite in coalitions around super targets when political opportunities suddenly and serendipitously emerge. In this historic moment of change and resistance, will we see the unfolding institutional transformation of the state as it responds to a more participatory ethos, or will former regime stalwarts reconstitute themselves? Elected officials and new governance strategies will still confront serious distributional and economic challenges as states remain enmeshed in neoliberal policies. Political scientists are already studying constitutional change and debates about electoral design, party construction, and other institutional changes to democratize the polity, but we should also look to different transition models that seek to redress deep structural inequalities following decades of repression and rent seeking. Should principles of political or economic affirmative action be incorporated into new institutional designs of transitology?

High-Speed FPGA Implementation of the SHA-1 Hash Function

This paper presents a high-speed SHA-1 implementation. Unlike the conventional unfolding transformation, the proposed unfolding transformation technique makes the combined hash operation blocks to have almost the same delay overhead regardless of the unfolding factor. It can achieve high throughput of SHA-1 implementation by avoiding the performance degradation caused by the first hash computation. We demonstrate the proposed SHA-1 architecture on a FPGA chip. From the experimental results, the SHA-1 architecture with unfolding factor 5 shows 1.17Gbps. The proposed SHA-1 architecture can achieve about 31% performance improvements compared to its counterparts. Thus, the proposed SHA-1 can be applicable for the security of the high-speed but compact mobile appliances.

Johannesburg during the transition in Ivan Vladislavić's ‘The WHITES ONLY Bench’ and The Restless Supermarket1

This article analyses two literary representations of Johannesburg in the early 1990s, a period of transition in which the city, like the country as a whole, moved from apartheid into a democratic and post-apartheid era. It draws on critical ideas about the city, postulated by Williams, Pike, Lefebvre and others, to argue that these works show Johannesburg's inhabitants encountering moments of tension, violence and anticipation during the city's transformation. Vladislavić explores his characters’ responses to the unfolding social and political transformation. The article also considers the use of the trope of chaos and disorder in these works, and the subsequent apocalyptic perceptions of some of Vladislavić's urban dwellers in describing some of the city's residential, commercial and public spaces. This is contrasted with alternative perceptions by some characters, who hope for a new prosperous and opened-up city, where new multiracial and meaningful relationships are possible.

Analysis of an impact Duffing oscillator by means of a nonsmooth unfolding transformation

Forced vibrations of a one degree-of-freedom impact Duffing oscillator are considered in this paper. The nonsmooth unfolding transformation and the Van der Pol method are used together for vibration analysis and the forced vibrations in the region of the resonance family are treated in detail. In this resonance family, the system exhibits subharmonic vibrations. The stability and bifurcations of the periodic motions are also considered.

Expanding Transformation: A Basis for Correctness Verification of Rewriting Rules

Unfolding transformation has long been used for computation and program transformation both in functional programming and logic programming paradigms. In this paper, we clarify that an unfolding step can be regarded as the composition of two simpler operations, i.e., expanding transformation and unification, and show that expanding transformation, rather than unfolding transformation, is a suitable basis for verifying the correctness of rewriting rules by pattern manipulation, which in turn provides a basis for systematically generating rewriting rules from a given problem description. We verify the correctness of expanding transformation and demonstrate the correctness of a basic class of rewriting rules, called general rewriting rules, based on expanding transformation. Applying expanding transformation and its correctness result, we demonstrate correctness verification of a larger class of rewriting rules, called expanding-based rewriting rules, by transformation of clause patterns.