Bits Of Information Research Articles

Applications of Artificial Intelligence in Evolution of Smart Cities and Societies

Applications of Artificial Intelligence in Evolution of Smart Cities and Societies

Instrumentalizing the book: Anne Carson’sNoxand books as archives

AbstractThis article introduces an experimental mode of contemporary writing and bookmaking that I callmultimodal book-archives, an emergent mode of contemporary literature that constructs narratives and textual sequences through the collection and representation of reproduced texts and other artifacts. In multimodal book-archives the book-object is presented as a container designed to preserve and transmit textual artifacts. In this article, I examine Anne Carson’sNox(2010) as a case study in archival poetics, exemplifying the “archival turn” in contemporary literature. My analysis draws attention to how writing, subjectivity, knowledge, history, and memory in the digital age are increasingly configured through distributed networks of people and artifacts in different social and institutional spaces, demonstrating howNoxfunctions not only as an instrument of psychological rejuvenation, but as an aesthetic instrument for documenting, ordering, listing, and juxtaposing disparate bits of information and memory into cathartic self-knowledge. Carson’s archival poetics is deeply personal, laden with private symbols and metaphors that readers are asked to collocate, cross-reference, and translate as part of the archival reading process. If grief is a kind of chaos, then Carson’s archival poetics instrumentalizes the book as a tool for ordering that chaos into something manageable, useful, even beautiful.

Parliamentary Democracy in Developing Countries: Comparative Study of Pakistan and Bangladesh (2008 to 2013)

Purpose: Parliamentary democracy is one of the unique forms of democracy. It is practiced in various countries of the world successfully. Like Australia, Canada exercises it in very effective manner. Pakistan and Bangladesh both countries are practicing parliamentary democracy. This research paper made comparison between Pakistan and Bangladesh and also find out reasons that weakened the democratic system in both developing countries like non democratic attitude of their political leaders, poverty, corruption, injustices, lack of education, dictatorship and terrorism that destabilized the parliamentary system in both countries.
 Design/Methodology/Approach: Historiography serves as an ideal approach here, given the subjects of the cases being used in this study. It employs a critical, selective reading of sources that synthesize particular bits of information into a narrative description or analysis of a subject.
 Findings: In Pakistan parliamentary democracy restores in 2008 and eighteen amendments is the good initiate to strength the democratic trend. In fact, in the first time in the history of Pakistan a democratic government complete it tenure. Politics of reconciliation play very vital role in Pakistan. In contrast, in Bangladesh parliamentary democracy restore since 1991but the political leaders highly mistrusted each other and involve in corruption activities. Abolishment of caretaker government is another critical issue in Bangladesh.
 Implications/Originality/Value: Both countries tried to achieve the parliamentary democracy but both countries should struggle more for institutionalization of parliament for strong the parliamentary democracy in both countries.

DIDACTIC-PEDAGOGICAL BASIS OF TEACHING FOREIGN LANGUAGES

Nowadays, at the non-philological institutions the study of English occupies the important place and is an important component in training specialists for different branches of our country. The purpose of this article is to analyze didactic-pedagogical basis of teaching foreign languages. Currently the introduction of the innovative methods to the sphere of teaching English has become important and has a great practical significance. The article gives synopsis and analysis of modern tools in the field of teaching English for Special Purposes. Certainly, teachers for Specific Purposes share a terrific deal for all intents and cause with instructors. For each it is essential to suppose about phonetic development and instructing speculations, to have bits of information in modern-day ideas recognizing their personal function and job simply as the function, furthermore to confront new improvements provided as a information to enhance their strategy in language learning. The requirements understand the conditions of specific callings and readiness to modify these conditions separate the unknown dialect educators to express functions and their pals displaying time-honored unknown dialect. They are characterized by paradigmatic (associative) and syntagmatic connections and relationships that determine their role and place in the language system. Language units are the content of this component. Aimed at ESP educating presumes instructing of English as an unknown dialect with respect to explicit calling, subject or reason. The goal of teaching a foreign language never completely coincides with the result (a student only approaches it, to a certain extent) more or less. It is necessary to take care of the attractiveness of the goal for schoolchildren, maintaining their sense of success, creating and maintaining the need to achieve the goal. This requires a teacher to have a good command of a whole range of professionally significant skills and abilities.

Improving the longevity of optically-read quantum dot physical unclonable functions

Quantum dot physically unclonable functions (QD-PUFs) provide a promising solution to the issue of counterfeiting. When quantum dots are deposited on a surface to create a token, they form a unique pattern that is unlikely to ever be reproduced in another token that is manufactured using the same process. It would also be an extreme engineering challenge to deterministically place quantum dots to create a forgery of a specific device. The degradation of the optical response of quantum dots over time, however, places a limitation on their practical usefulness. Here we report methods to minimise the degradation of photoluminescence (PL) from InP/ZnS quantum dots suspended in a polymer and demonstrate reliable authentication using a fingerprinting technique to extract a signature from PL, even after significant degradation has occurred. Using these techniques, it was found that the addition of a polylauryl methacrylate (PLMA) copolymer improved the longevity of devices. The best performing example of this was the Polystyrene-PLMA based material. From this, it is projected that 1000 bits of information could be extracted and read after a period of years, therefore providing a compelling solution to the issue of counterfeiting.

Comparative Analysis on Hybrid Content & Context-basedimage Retrieval System

Learning effective segment depictions and resemblance measures are fundamental to the recuperation execution of a substance based picture recuperation (CBIR) structure. Regardless of wide research tries for a significant long time, it stays one of the most testing open gives that broadly impedes the achievements of real-world CBIR structures. The key test has been credited to the extraordinary hole subject that happens between low-level photo pixels got by technologies and raised close semantic thoughts saw by a human. Among various techniques, AI has been successfully analyzed as a possible course to interface the semantic gap in the whole deal. Impelled by late triumphs of significant learning techniques for PC vision and various applications, in this paper, we try to address an open issue: if significant learning is a longing for spreading over the semantic gap in CBIR and how much updates in CBIR endeavors can be cultivated by exploring the front line significant learning methodology for learning feature depictions and likeness measures. Specifically, we explore a structure of significant learning with application to CBIR assignments with a wide game plan of definite examinations by investigating front line significant learning methodologies for CBIR endeavors under moved settings. From our exploratory examinations, we find some encouraging results and compress some huge bits of information for upcoming research.

Mutual authentication of nodes using session token with fingerprint and MAC address validation

Security has become an important issue during communication among mobile nodes in an unfavorable condition. The mobile node’s property is dynamic, so it isn’t easy to manage security policies. These difficulties present a barrier to building multigene security arrangements that accomplish both assurance and attractive network execution. The proposed work suggests the mutual authentication-based protocol, helping in the handshake between two nodes. Once they connected securely through this mechanism, they can interchange the required information. We have a monitoring node that will maintain the access list of the authorized nodes. The monitoring node will keep the nodes’ list based on the MAC address of nodes and digital signature key. The key is generated by combining the hash code of the MAC address with the variety of the user’s fingerprint file acting as a node. The combination of both will verify the entity. It involves the various subsections that include registering the user, token generation, sending and receiving messages through multiple algorithms. The proposed work is implemented using MATLAB. The analysis of the base work and the proposed work is visualized by structuring the GUI. Due to all the strength of the pattern of session token is further validated using the various online password checking tools, and the results obtained are quite impressive. Secure Hash Algorithm (SHA) is a cryptographic hashing algorithm used to decide a specific bit of information’s integrity. In the proposed method, we used different types of keys with additional entropy to check the trust level of password security. The result has been discussed using various entropy graphs that prove improvement over the existing approach.

Generalized differential-linear cryptanalysis of block cipher

Differential-linear cryptanalysis of block ciphers was proposed in 1994. It turns out to be more efficient in comparison with (separately) differential and linear cryptanalytic methods, but its scientific substantiation remains the subject of further research. There are several publications devoted to formalization of differential-linear cryptanalysis and clarification of the conditions under which its complexity can be mathematically accurately assessed. However, the problem of the differential-linear cryptanalytic method substantiation remains completely unresolved.
 This paper presents first results obtained by the author in the direction of solving this problem. The class of differential-linear attacks on block ciphers is expanded. Namely, both distinguishing attacks and attacks aimed at recovering one bit of information about a key are considered. In this case, no assumptions are made (as in well-known publications) about the possibility of representing the cipher in the form of some two components. Lower bounds of information complexity of these attacks are obtained. The expressions of these bounds depend on the averaged (by keys) values of the elements’ squares of the generalized autocorrelation table of the encryption transformation. In contrast to the known ones, the obtained bounds are not based on any heuristic assumptions about the investigated block ciphers and are valid for a wider class of attacks as compared to the traditional differential-linear attack. Relations between, respectively, differential, linear and differential-linear properties of bijective Boolean mappings are given. In contrast to the well-known works, the matrix form of the relations is used that makes it possible to clarify better their essence and simplify the proofs. A new relation is derived for the elements of the generalized autocorrelation table of the encryption transformation of the product of two block ciphers, which may be useful in further research.

The day the clock stopped. Primitive states of unintegration, multidimensional working through and the birth of the analytical subject.

This paper is based on one idea and built around one clinical experience that helped me to broaden my comprehension of it. The idea, underlying the work of several authors, is that when the analytic field is saturated with primitive and unintegrated mental contents, the analyst's somatic countertransference is a precious indicator of a deep, dissociated form of communication. The clinical experience concerns the difficult elaboration of a complex, multifaceted countertransference that took place during the early stages of the analysis of a sensitive patient who used to communicate in a very dissociated way and that I found hard to contain. This experience, closely described in the article, led me to formulate the clinical idea that the transference field may be made of distinct layers (psychoid, affective, verbal), and that each one of them may potentially convey dissociated, even contrasting bits of information. The corollary of this is that the analyst should be ready to accept contrasting sensations, feelings and thoughts at the same time, as they might be the basic ingredients of a complex reverie. The analyst could find himself/herself in front of his/her own internal unelaborated multiplicity before a symbolic image may emerge to link the scattered pieces of the experience. Nevertheless, the heart of this paper is not about suggesting an idea, but in the sharing of a complex working through, which fostered the birth of a new, more human relational perspective: the capacity of being together in time, in a transitional space where there is neither total separation nor fusion.

Lightweight Aggregated Data Encryption for Wireless Sensor Networks (WSNs)

The primary task of wireless sensor networks (WSNs) is to collect various types of data, for example, weather data, traffic data, etc. Collected data in WSNs are different from most data transmitted in digital communication applications. Most collected data in WSNs contain only few bits of information, but most data in data communication applications contain a large number of bits. All existing data encryptions in WSNs use conventional symmetric-key encryptions (e.g., advanced encryption standard (AES)) in which each large-size key is used to encrypt a block of large-size of data (e.g., a fixed block size of 128 bit in AES), and the security is based on a large-size of pairwise shared key (e.g., 128/192/ 256 bits in AES) between the sender node and the receiver node. Obviously, these conventional encryptions are not suitable for WSNs since the size of keys are much larger than the size of data. We propose a novel data encryption, in which it encrypts only few bits of data, and the security is based on multiple pairwise shared keys with short length. The encryption speed is much faster than conventional symmetric encryptions. Data aggregation is an efficient way to transmit data in a network. In the past, most encrypted data aggregations were designed based on public-key based homomorphic encryption. Public-key encryptions need time-consuming computation, so these schemes are not suitable for applications in WSNs. Most data in WSNs are routed through a path from the source node to the receiver node, which involves multiple sensor nodes. Our encrypted data aggregation is also called path-oriented data encryption. When multiple data are collected in WSNs, our scheme allows sensors in the path to aggregate all collected data in a piggyback ride. Our proposed encrypted data aggregation is a lightweight solution, which is suitable for applications in WSNs.

Beyond Strictly Proper Scoring Rules: The Importance of Being Local

AbstractThe evaluation of probabilistic forecasts plays a central role both in the interpretation and in the use of forecast systems and their development. Probabilistic scores (scoring rules) provide statistical measures to assess the quality of probabilistic forecasts. Often, many probabilistic forecast systems are available while evaluations of their performance are not standardized, with different scoring rules being used to measure different aspects of forecast performance. Even when the discussion is restricted to strictly proper scoring rules, there remains considerable variability between them; indeed strictly proper scoring rules need not rank competing forecast systems in the same order when none of these systems are perfect. The locality property is explored to further distinguish scoring rules. The nonlocal strictly proper scoring rules considered are shown to have a property that can produce “unfortunate” evaluations, particularly the fact that the continuous rank probability score prefers the outcome close to the median of the forecast distribution regardless of the probability mass assigned to the value at/near the median raises concern to its use. The only local strictly proper scoring rule, the logarithmic score, has direct interpretations in terms of probabilities and bits of information. The nonlocal strictly proper scoring rules, on the other hand, lack meaningful direct interpretation for decision support. The logarithmic score is also shown to be invariant under smooth transformation of the forecast variable, while the nonlocal strictly proper scoring rules considered may, however, change their preferences due to the transformation. It is therefore suggested that the logarithmic score always be included in the evaluation of probabilistic forecasts.

Steganography Technique Inspired by Rook

A steganographic technique inspired by rook is presented in this paper to ensure privacy and secrecy. In this approach, the cover image is partitioned into n × 1 pixel blocks and converted equivalent n × 8 binary bit planes. Then the functional output of each block is calculated on the basis of the number of rook positions, which are attacked by opponent rooks. The rook is a chess piece that moves only forward and backward in a straight line. In binary bit plane, 0 and 1 are considered as a black and white opponent rook, respectively. The secret information is considered as stream of binary bits. The binary bits of secret information are compared with the functional output of the corresponding block. If it is equal to the functional output of the corresponding block, then nothing needs to be done. In case of inequality, the small number of bits needs to be flipped in such a way that the functional output of the corresponding block becomes equal to the corresponding secret binary bits and the distortion of the cover is minimized.

Torque Ripple Minimization in Switched Reluctance Motor using ANFIS Controller

An inborn torque swell portrays changed hesitance innovation from traditional innovation. A definitive target of this paper is to minimize the torque wave of the exchanged hesitance engine drive utilizing Artificial Network Fuzzy Inference System based direct torque conspire. In the proposed controller arrange proper bits of information are picked for preparing and testing. The best possible choice of the learning rate and energy will help in weight change. The Intelligent controller gives high power over motor torque and speed, lessens rise time just as overshoot. Here the blunder is decreased which demonstrates that the determination of voltage vectors from the vector table is exact and its outcomes in better torque reaction over a wide scope of speed. The reenactment results uncover that the torque swells fluctuate between 3.75% to 2.25% for the variety in load torque and the drive speed. The experimental results for the proposed controller reveal that the torque ripple varies between 3.9% to 2.4% for the variation in speed. Both the recreation and equipment results delineate the effectiveness of the controller.

Three Resistance States Achieved by Nanocrystalline Decomposition in Ge‐Ga‐Sb Compound for Multilevel Phase Change Memory

AbstractPhase‐change memory (PCM), using the fast and reversible transition between crystal and glass to store binary data, is a promising candidate for next‐generation information storage and computing technologies. Recording more than one bit of information on each memory cell, known as multilevel cell (MLC) technology, can greatly increase the data density of PCMs. In this paper, the MLC capability in a phase change material Ge‐Ga‐Sb (GGS) is explored. Using the “SET” operation with increasing voltage amplitudes on this PCM cell in a 250 nm pillar structure device, three resistance levels are achieved and can be stabilized within large operating voltage windows, allowing large tolerance of SET voltage variation which may lead to the overlap of the neighboring resistance levels. It is discovered that the additional resistance level other than “0” and “1” is enabled by compositional phase separation in the nanocrystalline GGS, as revealed via atom probe tomography and electronic microscopy. The device also shows small resistance drift (ν = 0.025) in amorphous state, about four times lower than prototypical Ge‐Sb‐Te‐based PCMs, stabilizing it against time variation. Meanwhile, high thermal stability (Tc ≈ 300 °C) in GGS‐based device can also facilitate the practical applications in some extreme conditions.

Predicting Length of Stay of Coronary Artery Bypass Grafting Patients Using Machine Learning

BackgroundThere is a growing need to identify which bits of information are most valuable for healthcare providers. The aim of this study was to search for the highest impact variables in predicting postsurgery length of stay (LOS) for patients who undergo coronary artery bypass grafting (CABG). Materials and MethodsUsing a single institution's Society of Thoracic Surgeons (STS) Registry data, 2121 patients with elective or urgent, isolated CABG were analyzed across 116 variables. Two machine learning techniques of random forest and artificial neural networks (ANNs) were used to search for the highest impact variables in predicting LOS, and results were compared against multiple linear regression. Out-of-sample validation of the models was performed on 105 patients. ResultsOf the 10 highest impact variables identified in predicting LOS, four of the most impactful variables were duration intubated, last preoperative creatinine, age, and number of intraoperative packed red blood cell transfusions. The best performing model was an ANN using the ten highest impact variables (testing sample mean absolute error (MAE) = 1.685 d, R2 = 0.232), which performed consistently in the out-of-sample validation (MAE = 1.612 d, R2 = 0.150). ConclusionUsing machine learning, this study identified several novel predictors of postsurgery LOS and reinforced certain known risk factors. Out of the entire STS database, only a few variables carry most of the predictive value for LOS in this population. With this knowledge, a simpler linear regression model has been shared and could be used elsewhere after further validation.

A Magnetic Force Microscopy Study of Patterned T-Shaped Structures.

The study of patterned magnetic elements that can sustain more than one bit of the information is an important research line for developing new routes in magnetic storage and magnetic logic devices. Previous Monte Carlo studies of T-shaped magnetic nanostructures revealed the equilibrium and evolution of magnetic states that could be found as a result of the strong configurational anisotropy of these systems. In this work, for the first time, such behavior of T-shaped magnetic nanostructures is experimentally studied. In particular, T-shaped Co nanostructures have been produced by electron beam lithography using a single step lift-off process over Si substrates. The existence of four magnetic stable states has been proven by Magnetic Force Microscopy (MFM) and the analysis was complemented by Micromagnetic Simulations. The results confirmed that even for what can be considered large structures, with μm sizes, such four stable magnetic states can be achieved, and therefore two magnetic bits of information can be stored. We also addressed how to write and read those bits.

87 Improving the Delivery of Written Communication to Patients Presenting to the Frailty Assessment Service Following A Fall

Abstract Introduction NICE guidelines recommend for healthcare professionals to give patients both verbal and written information when explaining how to prevent further falls at home, how to cope with falls and where they can seek further advice or assistance. Most of the patients seen by the Frailty Assessment Service (FAS) at Northumbria Specialist Emergency Care Hospital (NSECH) will remain at a high falls risk even on discharge. An emphasis should be made on educating patients about how best they can manage their risks at home to prevent further falls. Method Over a six month period, data on patients seen by the FAS team was collected by reviewing electronic case notes and the daily patient list to identify presenting complaint and whether a falls leaflet was given on discharge. Results Following three cycles of intervention, the rate of falls leaflet distribution to patients discharged following a fall increased from an initial 0% to 24%, then to 55% and finally to 72%. Interventions included, in order; educating all frailty nurse practitioners, amending the daily patient list to include a separate column to prompt ticking if a falls leaflet was given, and notifying all frailty consultants to consider including “falls leaflet” as part of their post-take management plans. Conclusion Having a paper information leaflet can be invaluable to patients as it allows them to go away with concrete bits of information that they can always refer back to. This ensures that elderly patients do not face the risk of forgetting any advice given to them verbally during a consultation and written communication would only help to reinforce this instead. In future, it may be helpful to identify if there are reduced rates of re-admission to hospital in patients discharged with a falls leaflet compared to patients discharged without one.

Pixel P Air-Wise Fragile Image Watermarking Based on HC-Based Absolute Moment Block Truncation Coding

In this paper, we first designed Huffman code (HC)-based absolute moment block truncation coding (AMBTC). Then, we applied Huffman code (HC)-based absolute moment block truncation coding (AMBTC) to design a pixel pair-wise fragile image watermarking method. Pixel pair-wise tampering detection and content recovery mechanisms were collaboratively applied in the proposed scheme to enhance readability even when images have been tampered with. Representative features are derived from our proposed HC-based AMBTC compression codes of the original image, and then serve as authentication code and recovery information at the same time during tamper detection and recovery operations. Recovery information is embedded into two LSB of the original image with a turtle shell-based data hiding method and a pre-determined matrix. Therefore, each non-overlapping pixel-pair carries four bits of recovery information. When the recipient suspects that the received image may have been tampered with, the compressed image can be used to locate tampered pixels, and then the recovery information can be used to restore the tampered pixels.

Hamiltonian memory: An erasable classical bit

Computations implemented on a physical system are fundamentally limited by the laws of physics. A prominent example for a physical law that bounds computations is the Landauer principle. According to this principle, erasing a bit of information requires a concentration of probability in phase space, which by Liouville's theorem is impossible in pure Hamiltonian dynamics. It therefore requires dissipative dynamics with heat dissipation of at least $k_BT\log 2$ per erasure of one bit. Using a concrete example, we show that when the dynamic is confined to a single energy shell it is possible to concentrate the probability on this shell using Hamiltonian dynamic, and therefore to implement an erasable bit with no thermodynamic cost.

Solvable Model for the Linear Separability of Structured Data.

Linear separability, a core concept in supervised machine learning, refers to whether the labels of a data set can be captured by the simplest possible machine: a linear classifier. In order to quantify linear separability beyond this single bit of information, one needs models of data structure parameterized by interpretable quantities, and tractable analytically. Here, I address one class of models with these properties, and show how a combinatorial method allows for the computation, in a mean field approximation, of two useful descriptors of linear separability, one of which is closely related to the popular concept of storage capacity. I motivate the need for multiple metrics by quantifying linear separability in a simple synthetic data set with controlled correlations between the points and their labels, as well as in the benchmark data set MNIST, where the capacity alone paints an incomplete picture. The analytical results indicate a high degree of “universality”, or robustness with respect to the microscopic parameters controlling data structure.