Miracle-dz/UniFAR-FTUs huggingface dataset:
The Practice and Efficacy of Restorative Justice

SUMMARY Beginning with an exploration of the importance of understanding the power of questions, this paper examines the question, “Does it work? ” regarding restorative justice as a philosophy and a set of practices based on that philosophy. The paper identifies problems in the dominant retributive philosophical paradigm for responding to crime that the philosophy of restorative justice resolves. The author describes the practices of restorative justice in criminal justice as well as other contexts and presents evidence of effectiveness in achieving restorative outcomes. The paper discusses challenges and limitations in restorative practices.
The quick and the dead

2012; 114: 980–6. 30. Pandit JJ, Duncan T, Robbins PA. Total oxygen uptake with two maximal breathing techniques and the tidal volume breathing technique: a physiologic study of preoxygenation. Anesthesiology 2003; 99: 841–6. 31. Ward DS, Karan SB, Pandit JJ. Hypoxia: developments in basic science, physiology and clinical studies. Anaesthesia 2011; 66(Suppl 2): 19–26. 32. Farmery AD. Simulating hypoxia and modelling the airway. Anaesthesia 2011; 66(Suppl 2): 11–8. 33. Deepika K, Kenaan CA, Barrocas AM, Fonseca JJ, Bikazi GB. Negative pressure pulmonary edema after acute upper airway obstruction. Journal of Clinical Anesthesia 1997; 9: 403–8. 34. Shaw J, Frerk C, Russell J. A commentary on human factors aspects of cases reported to NAP4. In: Cook T, Woodall N, Frerk C, eds. 4th National Audit Project of the Royal College of Anaesthetists and the Difficult Airway Society. Major Complications of Airway Management in the United Kingdom. London: RCoA, 2011: 193–201. 35. Shiga T, Wajima Z, Inoue T, Sakamoto A. Predicting difficult intubation in apparently normal patients: a metaanalysis of bedside screening test performance. Anesthesiology 2005; 103: 429–37. 36. Frerk C, Cook T. Management of ‘can’t intubate can’t ventilate’ situation and the emergency surgical airway. In: Cook T, Woodall N, Frerk C, eds. 4th National Audit Project of the Royal College of Anaesthetists and the Difficult Airway Society. Major Complications of Airway Management in the United Kingdom. London: RCoA, 2011: 105–13.
25.9 A ±3ppm 1.1mW FBAR frequency reference with 750MHz output and 750mV supply

Multiple emerging wireless applications (body-worn devices and IoT, for example) will demand previously impossible thin-film form factors and low system cost. One key enabling technology for this paradigm is a new class of radios that offer cost/size approaching RFID while still maintaining peer-to-peer connectivity like more complex radios. These radios need to be cheap and thin, which means they should be fabricated using wafer-scale semiconductor processing. The existing paradigm (quartz crystals used as a frequency reference in radios) is a huge bottleneck in reducing cost and size of these devices. MEMS frequency references have replaced quartz crystals in some applications [1-3]. For example, [1] reports a MEMS reference with 0.5ppm stability but the power consumption (~100mW) and supply voltage (1.8V) are not suitable for low-voltage/low-power radios. [2] reports a 32kHz, 3ppm reference for mobile time-keeping applications, but is unsuitable for radio frequency synthesis due to its low output frequency. In this paper, we report a thin-Film Bulk-Acoustic-Resonator (FBAR) frequency reference suitable for low-voltage/low-power radio applications. The reported FBAR reference achieves a stability of +/- 3ppm from 0 to 90C. We achieve this by using an electronic temperature compensation scheme to improve the intrinsic +/-50ppm stability of an FBAR oscillator down to +/- 3ppm (Fig. 25.9.1). The core of the temperature compensation scheme is a temperature sensor that achieves a 1.75mK resolution at a 100mS sampling time.
Link Adaptation Strategies for Real-Time Video Transmission Over IEEE 802.11ac DL-MU

Multimedia video applications on mobile devices become pervasive and basically crept into every part of our life. Historically, the wireless standards tend to make the LAN faster and now we have the latest version 11 ac with new advanced features like multi-user (MU) transmission on downlinks. Basically, the LAN standards extend in two different directions. First, increasing performance while reducing the power consumption. Second, as the wireless LAN has become so successful, new concepts, such as Internet of Things, lead to the problem of the interference since many devices use the same frequency spectrum at the same time. While downlink MU feature tries to reduce the interference problem, setting up the LAN for the devices to have a fair opportunities within the network is of high importance. As the IEEE 802.11 ac standard left the fairness to the implementation, in this paper, we present practical schemes to deal with this issue in video streaming applications. The proposed schemes are mathematically modeled and their tractable optimal solutions are presented and verified. The simulation studies show that the proposed schemes meet the fairness criteria while guaranteeing the required quality and performance.
On the power of polynomial discriminators and radial basis function networks

In this paper we examine the representational and expressive power of two types of linearly weighted neural network: the polynomial discriminators (PDFs) and the radial basis function networks (RBFNs). A {O, 1}-valued function on Rn is a polyne mial discriminator of degree at most k if there is a surface in Rn which separates the positive examples of ! from the negative examples and which can be described by a polynomial equation of degree at mat k. The set of such functions is denoted P(n, k). In a similar way, ~B (n, k) denotes the set of boolean functions on {O, 1}n whose positive and negative examples can be separated by a surface whose equation is a polynomial of degree at most k. The threshold order of a boolean function f is the least value of k such that / c PB (n, k). By bounding the number of boole~ functions having at most a given threshold order, we prove that for large n, all but a negligible pr~ portion of boolean functions on n variables have threshold order at least [n/2J and that if n is odd, at most 1/2 of all such functions have threshold order at most [n/2J. We then determine precisely the VC dimensions of ‘PB (n, k) and P(n, k). These dimensions coincide for k = 1 but thereafter they diverge. In passing, we provide a new proof of a result of Dudley. We then examine radial basis function networks. Using results of Micchelli and others on the interpolation properties of such networks, we obtain bounds on the VC dimensions of RBFNs with certain standard basis functions. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice IS given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission. ACM COLT ’93 171931 CA, USA @ 1993 ACM 0-89791-61 1-5/93 /0007 /0158 . $l . 50 . Sean B. Holden Engineering Department University of Cambridge Trumpington Street Cambridge CB2 lPZ United Kingdom sbh@eng. cam. ac. uk
Final Year Project : Investigation of differential entropic measures for data mining of both text and DNA

Acknowledgements Thanks to Andrew Allison and Derek Abbott for all their support, and hard work in editing my papers and teaching me yet more maths. Thanks also to my Mum for her support. Carpena Pedro also deserves a mention, for his useful comments on the papers I have written. And lastly, thanks to Belle and Sebastian for helping to keep me sane through all of this. i Executive summary Information theory and mathematics in general provide a large number of techniques for analysing strings of text, be that human languages or the " language " of DNA. The aim of this project was to apply some of these techniques to analyse both written text and DNA, in order to extract useful information from these sources of information and explore properties of languages. In order to implement the techniques , I wrote software in both the Java and Perl programming languages. The key findings I have made are that an inter-word spacing analysis of human languages can be used in determining authorship of documents, and that a multifractal analysis of DNA in conjunction with a tree algorithm can be used to produce useful phylo-genetic trees which show relationships between organisms. I also found that DNA spectrograms could be useful. I evaluated the performance of the Jensen-Shannon divergence measure in finding coding and non-coding regions of DNA.
A New Technique for Automatic Detection and Parameters Estimation of Pavement Crack

Pavement condition evaluation is a significant part of a good pavement management system for effective maintenance, rehabilitation, and reconstruction decision-making. One of the key components of pavement condition evaluation is the quantification of pavement distresses data. Cracking is the main form of early pavement distresses. Cracking of pavement affects road condition, driving comfort, traffic safety, and consequently reduce pavement service life. Once initiated, cracking increases in extent and severity and accordingly accelerates the rate of pavement deterioration. Therefore, the awareness about crack type, extent, and severity is essential to evaluate pavement condition and to determine timing and cost of pavement maintenance. Digital image-based automated pavement evaluation has been gradually replacing the manual pavement evaluation due to its improved efficiency and safely operating. In this paper, we are presenting a novel reliable automated pavement assessment system based on image processing techniques and machine learning methods. The proposed system has the ability to i) identify crack, ii) extract crack parameters, and iii) report the type, extent, and severity level of that crack in an output file. Actual pavement images were used to verify the performance of the proposed system. The results clearly demonstrated that the proposed system was able to automatically and effectively identify crack type and efficiently extract crack parameters from pavement images. Such information can be used by public road agencies to define maintenance plans and assist in pavement management decision-making, in accordance with real pavement condition.
Privacy Implications of Database Ranking

In recent years, there has been much research in the adoption of Ranked Retrieval model (in addition to the Boolean retrieval model) in structured databases, especially those in a client-server environment (e.g., web databases). With this model, a search query returns top-k tuples according to not just exact matches of selection conditions, but a suitable ranking function. While much research has gone into the design of ranking functions and the efficient processing of top-k queries, this paper studies a novel problem on the privacy implications of database ranking. The motivation is a novel yet serious privacy leakage we found on real-world web databases which is caused by the ranking function design. Many such databases feature private attributes - e.g., a social network allows users to specify certain attributes as only visible to him/herself, but not to others. While these websites generally respect the privacy settings by not directly displaying private attribute values in search query answers, many of them nevertheless take into account such private attributes in the ranking function design. The conventional belief might be that tuple ranks alone are not enough to reveal the private attribute values. Our investigation, however, shows that this is not the case in reality. To address the problem, we introduce a taxonomy of the problem space with two dimensions, (1) the type of query interface and (2) the capability of adversaries. For each subspace, we develop a novel technique which either guarantees the successful inference of private attributes, or does so for a significant portion of real-world tuples. We demonstrate the effectiveness and efficiency of our techniques through theoretical analysis, extensive experiments over real-world datasets, as well as successful online attacks over websites with tens to hundreds of millions of users - e.g., Amazon Goodreads and Renren.com.
A Scalable Symbolic Simulator for Verilog RTL

Symbolic simulation is an important technique used informal property verification and test generation for digital circuits. Existing symbolic simulators predominantly operate at the gate level, reasoning about individual bits and signals. As a result, their performance does not scale well to large circuits like microprocessors. Word-level symbolic simulators address this problem to some extent, but present other challenges, such as fixpoint detection when simulating multiple modules that mutually trigger each other. In this paper, we present some exploratory ideas for performing word-level symbolic simulation over a Verilog RTL description of a circuit. We outline the basic technique of simulation and of handling fixpoints, discuss issues faced in our approach and present solution techniques to counter these issues. We also present initial experimental results obtained by applying our algorithms to a Verilog model of an x86 processor design.
Image mosaic method based on the image geometric correction for traffic accident scene

Image mosaic is one of important technologies for image processing. It is normally used to make up a seamless and high resolution image. There are some algorithms that deal with the image mosaic. But the most make simply two or more images seamlessly form a large image for a holographic scenic display. The post-processing on the photo from a traffic accident scene is required to reflect and allow inspectors to accurately determine the actual distance between objects in the scene. Therefore the images taken from the traffic accident scene need to be corrected before being spliced to each other. The image correction allows the information on the scene to be correctly displayed. The splicing on the corrected images ensures a thorough view and complete information gain that covers the whole scene.
Operationally Optimal VERTEX-BASED SHAPE CODING Rate-Distortion Techniques for Improving Object-Based Treatment

Multimedia communications has become one of the fastest growing sectors of the communications industry. While the current drivers are primarily video streaming and videoconferencing, a number of new applications are on the horizon. Such applications, like multimedia libraries and interactive chat rooms, will need access to video data on an object-by-object basis, where video objects are defined by their shape, texture, and motion. Current video coding standards, such as MPEG-1, MPEG-2, H.261, and H.263, are block-based codecs. The scene is divided into equal-sized square blocks for which the texture and motion are encoded. No shape encoding is necessary, since the block size is known a priori. Unfortunately, a bit stream of such a coder does not lend itself to object-based interaction with the data, since the shape of the objects (and therefore the objects themselves) is not defined. Object-based description of video is quite natural and there is a large amount of previous work. For example, most of the source material generated in a broadcast studio is based on the so-called chroma-keying technique, where an actor is filmed in front of a blue screen and then moved in front of any desired background. In [1] a second-generation image coding scheme was formulated, where the segmentation of the image is transmitted explicitly. The underlying assumption is that the contours of regions are very important for subjective image quality, whereas the texture of the regions is of lower importance. Object-based analysis-synthesis coding (OBASC) [2], which is a video coding paradigm, also follows the idea that the shape of moving objects is more important than the texture and that geometric distortions are less noticeable for a human observer than the coding artifacts of traditional block coders. Object-based treatment of video sequences, necessitated by the emerging content-driven applications, requires efficient representation of object boundaries. The ultimate goal is to allocate an available bit budget optimally among the video scene components (shape, tex-
Non-reversible privacy transformations

This paper discusses techniques for maintaining security in statistical databases. Statistical databases are those from which aggregate information about subsets of the database is to be obtained, as opposed to information concerning individual entities. The problem of security in such databases is one of maintaining individual privacy. Many statistical databases are designed to answer queries concerning groups of individuals. For the system to be totally secure, it must be able to insure that any individual’s information is protected. That is, even if the system is designed to return only group statistics and never individual records, it must be difficult to obtain any individual entry of the database. The degree of difficulty in doing this is a measure of the security of the system. It has been shown that in many statistical database sytems, with enough a priori information it is possible to obtain restricted information concerning an individual (see Schwartz[ 19761, Denning[ 19771, Hoffman[ 19771).
Economic Openness and Fiscal Multipliers*

ABSTRACT Recent empirical findings attribute a central role to the degree of economic openness to determine the size of the fiscal multiplier. See, for instance, Ilzetzki et al. (2013) [How big (small? ) are fiscal multipliers? Journal of Monetary Economics, 60(2), 239–254]. However, traditional macroeconomic models have difficulties to account for this evidence. By introducing ‘deep-habit’ formation into a New Keynesian small open economy model, this paper provides a theoretical framework which is able to attest for the new empirical evidence. Deep habits give rise to counter-cyclical firm markups, which are crucial to generate effects of openness on the fiscal multiplier as found in the data. We study three dimensions of economic openness: exchange rate flexibility, trade openness, and capital mobility. In line with the empirical findings, we report a negative relationship between measures of economic openness and the fiscal multiplier.
The design and implementation of object-constraint programming

Constraints allow developers to specify properties of systems and have those properties be maintained automatically. This results in compact declarations to describe interactive applications avoiding scattered code to check and imperatively re-satisfy invariants in response to user input that perturbs the system. Constraints thus provide flexibility and expressiveness for solving complex problems and maintaining a desired system state. Despite these advantages, constraint programming is not yet widespread, with imperative programming still being the norm. There is a long history of research on constraint programming as well as its integration with general purpose programming languages, especially from the imperative paradigm. However, this integration typically does not unify the constructs for encapsulation and abstraction from both paradigms and often leads to a parallel world of constraint code fragments and abstractions intermingled with the general purpose code. This impedes re-use of modules, as client code written in one paradigm can only use modules written to support that paradigm — thus, modules require redundant definitions if they are to be used in both paradigms. Furthermore, clear distinction between the paradigms requires developers to learn about and fully understand both paradigms to make use of them. In our work, we have developed a design for a family of object-constraint languages called Babelsberg. Our design unifies the constructs for encapsulation and abstraction by using only objectoriented method definitions for both declarative and imperative code. Just like assertions, our constraints are expressed using ordinary imperative expressions, including full objects and message sends. Unlike assertions, however, the system attempts to satisfy them if they are not currently true, and keeps them satisfied throughout the remaining execution. We provide a semantics that guides implementers of our design to combine Babelsberg with existing object-oriented host languages both semantically and syntactically and to demonstrate its feasibility with an executable semantics and three concrete implementations of Babelsberg. To allow developers to use the power of constraints without having to understand the specifics of different constraint solving strategies, we integrate an architecture for using multiple cooperating solvers. Finally, based on our experience with the concrete implementations, we propose performant implementation strategies of key features for object-constraint programming. We argue that our approach provides a useful step towardmaking constraint solving a useful tool for object-oriented programmers. We also provide example code, written in our implementations, which uses constraints in a variety of application domains, including interactive graphics, physical simulations, data streaming with both hard and soft constraints on performance, and interactive puzzles.
Methods of detection of Actinobacillus actinomycetemcomitans, Porphyromonas gingivalis and Tannerella forsythensis in periodontal microbiology, with special emphasis on advanced molecular techniques: a review.

BACKGROUND Certain specific bacterial species from the subgingival biofilm have demonstrated aetiological relevance in the initiation and progression of periodontitis. Among all the bacteria studied, three have shown the highest association with destructive periodontal diseases: Actinobacillus actinomycetemcomitans (Aa), Porphyromonas gingivalis (Pg) and Tannerella forsythensis (Tf). Therefore, the relevance of having accurate microbiological diagnostic techniques for their identification and quantification is clearly justified. AIM To evaluate critically all scientific information on the currently available microbial diagnostic techniques aimed for the identification and quantification of Aa, Pg and Tf. SUMMARY Bacterial culturing has been the reference diagnostic technique for many years and, in fact, most of our current knowledge on periodontal microbiology derives from cultural data. However, the advent of new microbial diagnostics, mostly based on immune and molecular technologies, has not only highlighted some of the shortcomings of cultural techniques but has also allowed their introduction as easy and available adjunct diagnostic tools to be used in clinical research and practice. These technologies, mostly polymerase chain reaction (PCR), represent a field of continuous development; however, we still lack the ideal diagnostic to study the subgingival microflora. Qualitative PCR is still hampered by the limited information provided. Quantitative PCR is still in development; however, the promising early results reported are still hampered by the high cost and the equipment necessary for the processing. CONCLUSION Quantitative PCR technology may have a major role in the near future as an adjunctive diagnostic tool in both epidemiological and clinical studies in periodontology. However, culture techniques still hold some inherent capabilities, which makes this diagnostic tool the current reference standard in periodontal microbiology.