Miracle-dz/UniFAR-FTUs huggingface dataset:
Anti-windup Schemes for Proportional Integral and Proportional Resonant Controller

Problems like windup or rollover arise in a PI controller working under saturation. Hence anti-windup schemes are necessary to minimize performance degradation.Similar situation may occur in a Proportional Resonant(PR)controller in the presence of a sustained error input.Several methods can be employed based on existing knowledge on PI controller to counter this problem.In this paper few such schemes are proposed and implemented in FPGA and MATLAB and from the obtained results their possible use and limitations have been studied.
Prediction in wireless networks by Markov chains

Discrete sequence modeling and prediction is an important goal and a challenge for pervasive computing. Mobile clients' data request forecasting and location tracking in wireless cellular networks are characteristic application areas of sequence prediction in pervasive computing. This article presents information-theoretic techniques for discrete sequence prediction. It surveys, classifies, and compares the state-of-the-art solutions, suggesting routes for further research by discussing the critical issues and challenges of prediction in wireless networks.
Practical and economical method for using biotinylated DNA probes with bacterial colony blots to identify diarrhea-causing Escherichia coli

A simple and economical method was developed for using biotinylated DNA probes to hybridize with bacterial colonies belonging to the various categories of diarrhea-causing Escherichia coli. Simplification and cost containment were achieved by using Whatman no. 541 filter papers instead of nitrocellulose, by minimizing the concentration of proteinase K (an expensive but necessary reagent used to pretreat the colony blots prior to hybridization with biotin-labeled DNA probes) and by reusing hybridization solution containing labeled probe DNA. After exposing the colony blots to lysing solution and steam, followed by lysozyme (1.5 mg/ml), sucrose (25%), and proteinase K (10 micrograms/ml) treatments, biotinylated probes were used to detect enterotoxigenic, enteropathogenic, enterohemorrhagic, diffuse adherence, and enteroinvasive categories of diarrhea-causing E. coli with a high level of sensitivity and specificity. Three independent observers who were experienced in reading DNA blots recorded remarkably similar results, while less satisfactory results were obtained when the blots were read by an inexperienced observer. This technique will be useful in laboratories in which radioactive isotopes are unavailable or impractical and in which budgets are restricted.
Mobile liquid 2D scatter space (ML2DSS)

This (video-) paper describes a user interface concept, which facilitates browsing of comparably large amounts of information on small screens. The viewing concept is based on a visually optimized star field display (Ahlberg & Shneiderman 1994) and is introducing new concepts like liquid browsing (an expansion lens with pressure controlled magnetic force simulation), selection based filtering and representation manipulation, multimotion behavior tagging, (interaction-) transparent spaces and continuous state animation. All these create a very versatile information space with a liquid-like look and feel, which can be used in a very intuitive way, providing all the advantages of a mature interactive scatter plot and can easily be scaled to different screen sizes without any adjustment efforts. This paper focuses on visual design and interaction details and emphasizes the importance of the visual interactive quality for mobile information visualization.
How do therapists and families negotiate meaning and family relating during family therapy for self-harm?

Introduction: Although the negotiation of new meaning is a common goal in almost all family therapy, and various approaches offer theoretical accounts of how this takes place, the way in which it occurs in practice through the interaction between therapists and families is not well understood. Adolescent self-harm is one of the most difficult to treat presentations facing mental health professionals today, although family interventions offer a potentially effective way of responding. The present research investigated the processes through which family therapists negotiate the meaning of self-harm during therapeutic conversations taking place over the course of therapy. Method: A grounded theory analysis of video-tapes of family therapy was conducted. Two full cases of family therapy were selected from a pool of tapes recorded as part of an ongoing randomised controlled trial: Self Harm Intervention Family Therapy (‘SHIFT’). A conceptual model of the process through which changes in meaning and relating take place was developed from the analysis of the first case. A second case was selected by means of theoretical sampling and its analysis was used to refine this model. Results: The mutual engagement of family members in therapy was found to be of fundamental importance for the joint exploration of meaning and family relating. Without mutual engagement, other elements of the therapy process are constrained and beneficial change is curtailed. Affect regulation was a prominent theme across the two cases. Discussion: The findings are discussed in the context of the existing literature on functions of self-harm and alliances in family therapy. Implications of the findings for clinical practice are considered and avenues for further research are proposed.
Sequence Alignment with Weighted Constraints

Given two sequences S1, S2 and a constrained sequence C, the longest common subsequence of S1, S2 with restriction to C is defined as the constrained longest common subsequence (CLCS) of S1, S2 and C. At the same time, the best alignment of S1, S2 with restriction to C is defined as the constrained pairwise sequence alignment (CPSA) of S1, S2 and C. Previous algorithms have shown that both CLCS and CPSA can be solved in O(rnm) time using similar dynamic programming formulas, where r = |C|, n = |S1| and m = |S2|. In 2004, Arslan first extended the definition of CLCS to a more flexible version, where the number of ignored constraints is allowed to a degree d and time complexity increases to O(drnm). In this paper, we extend the definition of CPSA to another version, called weighted CPSA (WCPSA), and show that WCPSA can not only be solved in O(rnm) time but also allow ignoring constraints by setting proper weights. In addition, we also show that some constraint-related problems can be immediately solved by adopting WCPSA.
Creating a room connectivity graph of a building from per-room sensor units

Sensor and actuator networks are often installed in buildings for energy-related applications such as lighting and climate control. Such systems require metadata about the deployed hardware (e.g. which room each is in, what the function of each room is) in order to operate effectively. In this paper we present methods to automatically determine such metadata, in particular the room connectivity graph (i.e., which rooms share a doorway/interior window). Crucially, our method works with just one sensor unit per room, does not require special placement of any of the sensors, and can therefore work on data from existing widely-deployed applications (such as burglar alarms). We apply this method to a 30-day data set from single per-room sensor units deployed in two residential homes in the United Kingdom. Room connectivity is determined based on: spillover of artificial light between rooms; occupancy detections due to movement between rooms; and a fusion of the two. The fusion of both techniques is shown to work better than either technique alone, with a 93% true positive rate and 0.5% false positive rate (aggregate across both houses), and a convergence time of under a week.
Review of Modifiability of behavior in its relation to the age and sex of the dancing mouse and The relation of strength of stimulus to rapidity of habit-formation.

In connection with a study of various aspects of the modifiability of behavior in the dancing mouse a need for definite knowledge concerning the relation of strength of stimulus to rate of learning arose. It was for the purpose of obtaining this knowledge that we planned and executed the experiments which are now to be described. Our work was greatly facilitated by the advice and assistance of Doctor E. G. MARTIN, Professor G. W. PIERCE, and Professor A. E. KENNELLY, and we desire to express here both our indebtedness and our thanks for their generous services.
String Edit Distance, Random Walks And Graph Matching

This paper shows how the eigenstructure of the adjacency matrix can be used for the purposes of robust graph-matching. We commence from the observation that the leading eigenvector of a transition probability matrix is the steady state of the associated Markov chain. When the transition matrix is the normalised adjacency matrix of a graph, then the leading eigenvector gives the sequence of nodes of the steady state random walk on the graph. We use this property to convert the nodes in a graph into a string where the node-order is given by the sequence of nodes visited in the random walk. We match graphs represented in this way, by finding the sequence of string edit operations which minimise edit distance.
Randomness and metastability in CDMA paradigms

Code Division Multiple Access (CDMA) in which the signature code assignment to users contains a random element has recently become a cornerstone of CDMA research. The random element in the construction is particularly attractive in that it provides robustness and flexibility in application, whilst not making significant sacrifices in terms of multiuser efficiency. We present results for sparse random codes of two types, with and without modulation. Simple microscopic consideration on system samples would suggest large differences in the phase space of the two models, but we demonstrate that the thermodynamic results and metastable states are equivalent. This may have consequences for developing algorithmic methods to escape metastable states, thus improving decoding performance.
Dimensions of Interaction

gent, but deaf, blind, and paraplegic agents. The assumption was that a human agent would formulate the problem in a previously defined language understandable to the agent. The problem statement would include background knowledge, a description of the state of some world, operators to use in that world, and a description of a desired state (a goal). The agent would use (at the knowledge level) logical reasoning to determine a sequence of operations that could be performed to achieve the desired goal, and a more complete description of the resulting desired state. Although this style of building AI systems is still both useful and prevalent, there has been increasing recognition of the importance of designing and analyzing systems that do not make these isolation assumptions. In this article, I want to focus on systems consisting of active agents with multiple goals, communicating among themselves, and interacting Ten years ago, at the first AAAI conference, Alan Newell (1982), in his presidential address, focused on understanding the then dominant paradigm for artificial intelligence: the writing of symbolic reasoning programs for an agent that would act rationally to achieve a goal. He distinguished the “knowledge level” from the “symbol level” description of a system. The former encompasses the knowledge and conditions necessary for an agent to solve a problem. It is only when the knowledge level is reduced to a symbol level description that issues of implementation get considered. Newell’s analysis postulated a single agent, with fixed knowledge and a specified goal. The agent was disconnected from the world, with neither sensors nor effectors, and more importantly with no connection to other intelligent goal -dr iven a g e n t s . R e s e a r c h results in AI consisted pr imar i ly in the determination of AAAI-90 Presidential Address
Winning the victim status can open conflicting groups to reconciliation: Evidence from the Israeli-Palestinian Conflict

Members of conflicting groups often engage in ‘competitive victimhood’, that is, they are motivated to gain acknowledgment that their ingroup is the conflict’s ‘true’ victim. The present study found that compared with a control group, Israeli Jews and Palestinians reassured that their ingroup had won the victim status showed increased willingness to reconcile with the outgroup and held less pessimistic, fatalistic views of the conflict. Moreover, for members of the stronger party—Israeli Jews—winning the victim status also led to increased group efficacy and consequent readiness to take action toward resolution. These findings extend previous theorizing about the positive effects of addressing group members’ need for acknowledgement of their victimization. Copyright © 2015 John Wiley & Sons, Ltd. Members of groups involved in a protracted violent conflict often seek to establish that their ingroup has been subjected to more suffering and injustice than their adversarial group (Noor, Shnabel, Halabi, & Nadler, 2012). Based on Gray and Wegner’s (2009) theorizing on ‘moral typecasting,’ it has been argued that groups’ engagement in such ‘competitive victimhood’ stems from construing the victim and perpetrator roles as mutually exclusive. This zero-sum mindset motivates conflicting groups to ‘win’ the victim status, which is associated with various material and symbolic benefits (see Noor et al., 2012). Tragically, evidence obtained in various contexts of violent conflict, including Northern Ireland, post-Pinochet Chile (Noor, Brown, Gonzalez, Manzi, & Lewis, 2008a; Noor, Brown, & Prentice, 2008b), Burundi, DRC, Rwanda (Vollhardt & Bilali, 2014), and Israel (Shnabel, Halabi, & Noor, 2013), suggests that group members’ engagement in competitive victimhood negatively affects their attitude toward their outgroup (e.g., their readiness to forgive and reconcile with it). Apparently, when groups fight over their share of victimhood, they are unable or unwilling to let go of the painful past and replace it with a vision of a conflict-free future (Noor, Shnabel, Halabi, & Doosje, 2014). Because the concept of competitive victimhood has only recently entered the scientific discourse (Noor et al., 2012), it is still under-researched. Existing research has focused on the antecedents (e.g., Sullivan, Landau, Branscombe, & Rothschild, 2012) and consequences (e.g., Noor et al., 2008a & 2008b) of groups’ engagement in competitive victimhood, but to the best of our knowledge, no research has explored
Genome-Wide De Novo Prediction of Cis-Regulatory Binding Sites in Mycobacterium tuberculosis H37Rv

The transcription regulatory system of Mycobacterium tuberculosis (M. tb) remains incompletely understood. In this study, we have applied the eGLECLUBS algorithm to a group of related prokaryotic genomes for de novo genome-wide prediction of cis-regulatory binding sites (CRBSs) in M. tb H37Rv. The top 250 clusters from our prediction recovered 83.3% (50/60) of all known CRBSs in extracted inter-operonic sequences of this strain. We further demonstrated that the integration of our prediction results with the ChIP-Seq datasets is very effective in identifying true binding sites of TFs. Using electrophoretic mobility shift assays and real-time RT-PCR, we experimentally verified our prediction of CRBSs for Rv0081, an important transcription factor thought to be involved in regulation of M. tb under hypoxia.
Molecular typing of enterohemorrhagic Escherichia coli O157:H7 isolates in Japan by using pulsed-field gel electrophoresis

Pulsed-field gel electrophoresis (PFGE) was applied for molecular typing of 825 enterohemorrhagic Escherichia coli (EHEC) O157:H7 isolates, most of which were from 19 outbreaks and 608 sporadic cases in Japan, mainly in May to August 1996. By PFGE, the EHEC O157:H7 isolates were classified into six types (type I to V and ND [nondescript]) and UT untypeable isolates. Fifty isolates from seven outbreaks in May to June and 60 isolates from patients with sporadic cases of infection showed almost identical PFGE patterns which differed in only 1 of 22 DNA fragments. They were classified into type I. Ninety-nine isolates from 10 other outbreaks and 156 isolates from patients in the Kinki area with sporadic cases of infection obtained in the early summer of 1996 showed identical PFGE patterns, suggesting that they were derived from one huge outbreak. They were classified into type II. Type IV EHEC isolates, which had only the stx2 gene, caused another outbreak in a primary school in June. EHEC isolates of two other types, types III and V, were not related to the outbreak but were isolated in several parts of Japan. ND EHEC isolates included a variety of patterns which could not be classified into either of the types mentioned above. Twenty-five isolates could not be analyzed due to degradation of their genomic DNAs and were represented as UT. These results indicate that EHEC O157:H7 strains with various PFGE types have already spread to Japan and caused the multiple outbreaks and sporadic infections in Japan in the summer of 1996.
Security Analysis using Flow Logics

Security. Originated in the 70’s, security of computer systems became soon an essential requirement for many applications, especially in the last decade, due to the widespread diffusion of distributed systems and networks. Mobility is really shaping these systems, leading to new scenarios in which security problems become more and more urgent. The software executed on a computer needs not to be produced for it anymore, as it can also be downloaded from a server, somewhere on the net. Consequently, each computational environment offers a general and distributed platform to programs that can be concurrently executed by users either locally or remotely. This makes it mandatory to fix precise policies for access rights to obtain non-interference and the protection of private information. Moreover, it is necessary to face up to the heterogeneity of administration domains and untrustability of connections, due to geographic distribution: communications between nodes have to be guaranteed, both by making it possible to identify partners during the sessions and by preserving the secrecy and integrity of the data exchanged. To this end specifications for message exchange, called security protocols, are defined on the basis of cryptographic algorithms. Even though carefully designed, protocols may have flaws, allowing malicious agents or intruders to violate security. An intruder, gaining some control over the communication network, is able to intercept or forge or invent messages to convince agents to reveal sensitive information or to believe it is one of the legitimate agents in the session. Cryptography can minimize possible malicious effects.
Embedding dimension estimation of high dimensional chaotic time series using distributed time delay neural network

In the face of a practical chaotic system whose mathematical model is not available, because of unknown input factors and unavailable dynamical equations, using time series approach can be useful. Therefore, space state reconstruction of a chaotic system by using a scalar time series from its output observations is considered for obtaining information on this system from its one-dimensional signal. In this paper a method for estimation of an appropriate embedding dimension for phase space reconstruction of underlying high dimensional system from the observed chaotic time series by a Distributed Time Delay Neural Network (DTDNN) is proposed. Various methods for embedding dimension estimation have been previously studied from which False Nearest Neighbours (FNN) is the most conventional method, however the performance of this method for the high dimensional chaotic systems is not acceptable. The proposed method is applied to high dimensional chaotic systems such as approximated Mackey-Glass time series with dimensions 7, 13 and data set D1 from the Santa Fe institute. Our method for embedding dimension estimation has been compared with the conventional estimation method, and their comparisons showed the effectiveness of the proposed methodology. The results show that this method is feasible and fit for the embedding dimension estimation of high-dimensional chaotic systems.
Delamination of cells from neurogenic placodes does not involve an epithelial-to-mesenchymal transition

Neurogenic placodes are specialized regions of embryonic ectoderm that generate the majority of the neurons of the cranial sensory ganglia. Here we examine in chick the mechanism underlying the delamination of cells from the epibranchial placodal ectoderm. We show that the placodal epithelium has a distinctive morphology, reflecting a change in cell shape, and is associated with a breach in the underlying basal lamina. Placodal cell delamination is distinct from neural crest cell delamination. In particular, exit of neuroblasts from the epithelium is not associated with the expression of Snail/Snail2 or of the Rho family GTPases required for the epithelial-to-mesenchymal transition seen in neural crest cell delamination. Indeed, cells leaving the placodes do not assume a mesenchymal morphology but migrate from the epithelium as neuronal cells. We further show that the placodal epithelium has a pseudostratified appearance. Examination of proliferation shows that the placodal epithelium is mitotically quiescent, with few phosphohistone H3-positive cells being identified. Where division does occur within the epithelium it is restricted to the apical surface. The neurogenic placodes thus represent specialized ectodermal niches that generate neuroblasts over a protracted period.
On energy efficiency and network connectivity of mobile ad hoc networks

In mobile ad hoc networks, it is often more important to optimize for energy efficiency than throughput. In this paper we investigate the effect of transmit range on energy efficiency of packet transmissions. We determine a common range for all nodes such that the average energy expenditure per received packet is minimized. In the first part of this paper, we consider stationary networks. We show that energy efficiency depends on various system parameters that includes path loss exponent of the channel, energy dissipation model and network offered load. In particular, when the path loss exponent is large, energy efficiency decreases when the transmit range increases. Hence, the network should be operated at the critical range that just maintains network connectivity. However, when the path loss exponent is small, operating at the critical range yields inferior throughput and energy efficiency. Our results show that energy efficiency is intimately connected to network connectivity. Three network connectivity regimes are identified as the transmit range of all nodes increases. In the second part, we examine the effect of node mobility on energy efficiency. We show that at normal offered load, an optimal transmit range exists such that energy efficiency is maximized The optimal range turns out to be insensitive to node mobility, and is much larger than the critical range. We show that the energy expenditure can be reduced by 15% to 73% in different mobility scenarios, if the network is operated at the optimal range.
Lumo: illumination for cel animation

A method is presented to approximate lighting on 2D drawings. The specific problem solved is the incorporation of 2D cel animation into live-action scenes, augmenting the existing method of drawn "rims and tones" with subtle environmental illumination. The image-based tools developed to solve the problem have both photorealistic and non-photorealistic applications.