Miracle-dz/UniFAR-FTUs huggingface dataset:
Secure access control to hidden data by biometric features

In this paper, a novel authentications system combining biometric cryptosystems with digital watermarking is presented. One of the main vulnerabilities of the existing data hiding systems is the public knowledge of the embedding domain. We propose the use of biometric data, minutiae fingerprint set, for generating the encryption key needed to decompose an image in the Tree structured Haar transform. The uniqueness of the biometrics key together with other, embedded, biometric information guarantee the authentication of the user. Experimental tests show the effectiveness of the proposed system.
Babies and Baby Media

In the last decade, exposure to screen media has extended to ever earlier ages, as video products designed and marketed specifically for infants have proliferated and generated extraordinary sales. Parents purchase these products for multiple reasons, including the expectation that their infants will learn from them. We first summarize some of the data documenting this new phenomenon and then raise the question of what empirical research using video presentations tells us about the likelihood that infants will be able to learn from video. Although there has been remarkably few studies directly examining the extent to which infants learn from video displays, there is a substantial body of research in which video has been used to present various kinds of stimuli to infants and toddlers. We examine some of these studies with respect to what they can tell us about the potential visual media have to support learning early in life.
Delay and Delay-Variation Constrained Multicast Routing Algorithm Based on Core Selection

With the development of multimedia network, more and more real-time multimedia applications require a network capable of satisfying QoS constraints such as delay and delay-variation bound so that the messages reach each destination node at almost the same time within a certain specified time limit, and certain application also demand that different streams for each different destination node should reach with minimum cost under the constraints. Therefore, the delay and delay-variation constraint multicast routing problem is studied and a new strategy in core selection methods is proposed. The algorithm we propose guarantees that the delay from the source to any destination does not exceed a real-time constraint satisfying the delay-variation constraint under cost minimization. In addition, this core selection methods achieve a balance of optimizing cost and delay of the multicast tree. Simulation results show that the algorithm has low complexity and balances between the computational complexity and performance, it can also meet the requirements of real-time network communication.
The snobol3 programming language

SNOBOL3 is a programming language designed for the manipulation of strings. Features of the language include symbolic naming of strings and pattern matching. In addition to a basic set of primitive string-valued functions, the system includes the facility for defining functions. These defined functions facilitate the programming of recursive procedures. This paper presents an intuitive description of SNOBOL3 and at the same time incorporates complete reference material for the programmer. The implementation of SNOBOL3 for the IBM 7094 computer operating under BE-SYS-7 is the basis for this description, but most of the material is common to all implementations.
Mathematical analysis of various superimposed coding methods

The chain‐spelling and random‐number superimposed coding methods and their variants are described. It is shown that for a given field and a given number of words to be punched therein, the above methods are equivalent as far as the probability of a match being false is concerned. For the above methods the optimum number of punches per word is 0.693 x (field size) ‐ (number of words punched) and does not depend on the vocabulary size. The staggered superimposed coding method is also described and analyzed. Charts giving the probabilities of a match being false for various vocabulary sizes, field sizes, and numbers of words punched are provided. Tables extending these figures to multi‐word inquiries are included.
Channel-Hopping Model Predictive Control

Abstract In Multiplexed MPC, the control variables of a MIMO plant are moved asynchronously, following a pre-planned periodic sequence. The advantage of Multiplexed MPC lies in its reduced computational complexity, leading to faster response to disturbances, which may result in improved performance, despite finding sub-optimal solution to the original problem. This paper extends the original Multiplexed MPC in a way such that the control inputs are no longer restricted to a pre-planned periodic sequence. Instead, the most appropriate control input channel would be optimised and selected to counter the disturbances, hence the name ‘Channel-Hopping'. In addition, the proposed algorithm is suitable for execution on modern computing platforms such as FPGA or GPU, exploits multi-core, parallel and pipeline computing techniques. The algorithm for the proposed Channel-hopping MPC (CH-MPC) will be described and its stability established. Illustrative examples are given to demonstrate the behaviour of the proposed Channel-Hopping MPC algorithm.
Novel Research Impact Indicators

Citation counts and more recently usage statistics provide valuable information about the attention and research impact associated with scholarly publications. The open access publisher Public Library of Science (PLOS) has pioneered the concept of article-level metrics, where these metrics are collected on a per article and not a per journal basis and are complemented by real-time data from the social web or altmetrics: blog posts, social bookmarks, social media and other.
A performance evaluation method for radio frequency identification–based tracking network of job-shop-type work-in-process material flows

With the rapid development of the modern manufacture, a radio frequency identification–based tracking network has been gradually established to monitor and track the material flows in a job-shop floor. Based on an event-driven graphical schema, this article puts forward a new method for modeling and analyzing the job-shop-type work-in-process material flows tracking network. The schema elements are mapped into the network nodes, and the association relationships among the elements are mapped into the network edges. Furthermore, corresponding measures and metrics are presented to evaluate the work-in-process material flows tracking network performance. Finally, a simple example is given to verify the feasibility of the proposed method. It is expected that this study will provide a systemic evaluation method for guiding and optimizing the radio frequency identification–based tracking configuration solution for job-shop-type material flows.
Intersymbol interference reduction for differential MSK by nonredundant error correction

A theoretical analysis and experimental results for differential detection of minimum-shift keying (MSK) with nonredundant error correction are described. The proposed demodulator utilizes the output detected from the difference in phase over two or three time slot intervals along with the conventional detector output. A single error can be corrected by using two differential detectors, and a single and a double error can be corrected by using three detectors. It is shown that the error rate performance is improved, especially in the presence of intersymbol interference (ISI), without the addition to the transmitted data of redundant bits. Simulation and experimental results agree with the theoretical analysis, which shows that the degradation of differential detection relative to coherent detection is reduced from 2.2 dB without error correction to 1.2 dB with single error correction and to 0.7 dB with double error correction. The method can be applied effectively to mobile communications over a fading channel or to time-division multiple-access (TDMA) communications using burst mode transmission. >
Distance-Measure Impacts on the Calculation of Transport Service Areas Using GIS

Access coverage is important in public transit planning, as this is the means by which service is provided to riders. In fact the proximity of demand (population and employment) to stops or stations on the network to a great extent explains its greater or lesser usage by potential users. Coverage of service areas can be delineated by GIS through the creation of buffers around transit facilities based on Euclidean (straight-line) distance. A second method is based on calculations of distances along a street network (network distance). The choice of the distance calculation method affects significantly the final results in terms of population covered. This paper assesses the overestimation of the straight-line-distance method, which is the most widely used in coverage analysis, by comparing it with that of network distances. It investigates systematically the factors influencing this overestimation, such as the density of stops or stations, the coverage distance thresholds and the characteristics of the area analysed (street-network design, barriers, and population distribution in the neighbourhood of the bus stop or station). Finally, it concludes that the network-distance method provides systematically better estimates of transit ridership than the Euclidean distance method.
Advances in binary decision based programmable controllers

Binary decision automata are finite state machines that evaluate switching functions by means of decision rather than Boolean logic. The capability of binary decision machines (BDMs) to evaluate sequential functions is addressed by the authors. The BDM is shown to be less powerful than the deterministic finite automation (DFA) model from automata theory. However, an extended BDM with input control is shown to be equivalent to the DFA and thus can be used to implement finitely computable sequential functions. The use of a BDM finite automaton instead of a more general model is motivated on the basis of expected case time and space complexity analysis. A hardware design following from this analysis is described, and programming methods are discussed. >
Entwurf und Implementierung eines generischen Substring-Index

Mit der Sequenzierung kompletter Genome in den letzten Jahren wurden erhebliche Datenmengen veröffentlicht, die nun weiter analysiert werden müssen. Viele der dafür benötigten Algorithmen, suchen sehr oft nach Vorkommen bestimmter Teilsequenzen innerhalb dieser Genome, so dass es Datenstrukturen und Algorithmen bedarf, die allgemein das Auffinden von Mustern in großen Datensätzen effizient realisieren. Ein Substring-Index ist eine Datenstruktur zu einem gegebenen String s, die Informationen zur lexikographischen Ordnung der Teilstrings von s enthält und Methoden zur Verfügung stellt, effizient nach Vorkommen von Strings zu suchen. Ein generischer Substring-Index ist weitestgehend typund problemunabhängig und nicht nur auf Anwendungen in der Bioinformatik festgelegt. Ebenso ist der Einsatz in Suchmaschinen, o. ä. denkbar. SEQAN ist eine Software-Bibliothek, die in der Arbeitsgruppe Algorithmische Bioinformatik der Freien Universität Berlin entwickelt wird, Algorithmen und Datenstrukturen zur Analyse von Genomoder Proteinsequenzen bereit stellt und die Entwicklung von eigenen Algorithmen erleichtern soll.
Aktivitas Antimikroba Teh Asam Daun Tin (Ficus carica) Secara In Vitro

Daun tin mengandung flavonoid yang dapat digunakan sebagai antimikroba. Fermentasi dengan kombucha diharapkan dapat meningkatkan aktivitas antimikroba. Penelitian ini bertujuan untuk mengetahui potensi teh asam daun tin sebagai antimikroba terhadap beberapa mikroba, diantaranya Staphylococcus aureus , Escherichia coli , Lactobacillus casei dan Candida albicans. Teh asam dibuat melalui fermentasi seduhan daun tin dengan bantuan kombucha selama 12 hari. Uji antimikroba dilakukan dengan menggunakan metode difusi sumuran. Dari hasil pengujian diperoleh rerata zona hambat terhadap Escherichia coli 6,97 mm, Staphylococcus aureus 5,5 mm, Lactobacillus casei 5,29 mm, dan Candida albicans 0,37 mm. Berdasarkan hasil penelitian teh asam daun tin berpotensi sebagai antimikroba, terutama sebagai antibakteri.
Online 3D face reconstruction with incremental Structure From Motion and a regressor cascade

In this paper we present a method for online 3D face reconstruction from a video sequence. The face landmarks in a given frame are detected and used to create a 3D shape estimate. The resulting 3D shape is an approximate, sparse representation of the subject’s face. Our reconstruction step is based on a revised version of incremental Structure From Motion, where we use a novel 4D subspace tracking procedure followed by scaled deflation against a vector of ones. Facial landmark detection is built upon a regressor cascade scheme where each subsequent regressor updates the initial shape obtained from the preceding frame.
Design of an advanced readout chip for silicon strip detectors

Work was begun in 1990 on the development of an advanced readout chip for silicon strip detectors. Features of the proposed device include compatibility with close bunch spacing and double sided detectors, and on-chip analog storage, digitization, and data sparsification. Chips have been designed to check all of these concepts, fabricated in the VTI 2 mu process, and tested. The circuit configurations and test results are presented. Measurements are very encouraging and show that performance is close to that desired. <<ETX>>
Synchrony: quantifying variability in space and time

There is growing recognition that linking patterns to their underlying processes in interconnected and dynamic ecological systems requires data sampled at multiple spatial and temporal scales. However, spatially explicit and temporally resolved data sets can be difficult to analyze using classical statistical methods because the data are typically autocorrelated and thus violate the assumption of independence. Here, we describe the synchrony package for the R programming environment, which provides modern parametric and nonparametric methods for (i) quantifying temporal and spatial patterns of auto‐ and cross‐correlated variability in univariate, bivariate, and multivariate data sets, and (ii) assessing their statistical significance via Monte Carlo randomizations. We illustrate how the methods included in the package can be used to investigate the causes of spatial and temporal variability in ecological systems through a series of examples, and discuss the assumptions and caveats of each statistical procedure in order to provide a practical guide for their application in the real world.
Application of Principal Component Analysis to Predict Dynamic Origin–Destination Matrices

Prediction of the time evolution of origin–destination (O-D) matrices is important for many applications in the traffic domain. These applications range from ex ante evaluation to real-time prediction and control. Since O-D matrices are high-dimensional multivariate data structures, both the specification and the estimation of O-D prediction models are methodologically and computationally cumbersome. This paper demonstrates that a significant reduction of the dimensionality of the O-D data that preserves structural patterns can dramatically reduce computational costs without a significant loss of accuracy. This paper explores the application of principal component analysis (PCA) for this purpose. PCA shows that the dimensionality of the time series of O-D demand can be reduced significantly. This paper also shows how the results from the PCA method can be used to reveal the structure in the underlying temporal variability patterns in dynamic O-D matrices. The results indicate three main patterns that can be distinguished in dynamic O-D matrices: structural, structural deviation, and stochastic trend patterns. Insight into how these trends contribute to each O-D pair and how this information can be further used to predict dynamic O-D matrices on the basis of a set of dynamic O-D matrices obtained from real data is provided.
A high speed BiCMOS table look-up gate

The authors describe a BiCMOS programmable gate array (PGA) with subnanosecond logic block delay and low power consumption. Each logic block can implement any Boolean function of three inputs, a D-latch, or an SR-latch. The PGA is supported by an advanced design environment, which includes schematic capture, interactive functional simulation, logic minimization, and technology mapping. <<ETX>>
The process of knowledge reification in human-human interaction

The notions explored in this paper have arisen in a project (JITOL) experimenting with IT-supported open learning applied to the personal development of professionals. In this context, we hypothesize that open learning is optimum for acquisition of knowledge. The method underlying open learning in JITOL is rather unique. First, it is based on the idea that collaborative learning is essential, particularly for the professional development of individuals. Second, it emphasizes knowledge stemming from the debates between professionals and provides methods for capitalizing on it by a recursive process, called the reification of interactions.
Lr parsing for tree adjoining grammars and its application to corpus-based natural language parsing

This thesis develops the formal aspects of LR parsing for Tree Adjoining Grammars (TAGS) and investigates its application to natural language best-parse parsing. It is argued that the combination of TAG and the LR technique is beneficial to both. On the one hand, starting from the observation that the rich descriptions provided by Tree Adjoining Grammars are better suited to the description of natural languages than Context Free Grammars, we look for an efficient parsing algorithm that yields a single analysis per sentence. On the other direction, the LR technique is argued to benefit from the rich descriptive power of the Tree Adjoining Grammars, leading to better parsing accuracy than when applied to Context Free Grammars. conception of LR parsing. We then propose practical efficient algorithms for LR table generation for TAGs and for a TAG subclass: the Tree Insertion Grammars (TIGs). Decision procedures are presented for conflict resolution during parsing so as to allow the pursuit of the single best-parse for any given sentence. Such procedures are statistical in nature. We obtain their statistical parameters from a large syntactically annotated corpus, the Penn Treebank, from which also the corresponding grammars are extracted. Thanks to the rich descriptions provided by the elementary trees of the Tree Adjoining Grammars, we were able to use a deterministic parsing strategy with limited backtracking (instead of exhaustive parallel all-paths search), thus obtaining a very fast parser with good accuracy. At the end we propose more elaborate techniques for further improving the parsing accuracy of our LR parser for TAG. * *This dissertation is a compound document (contains both a paper copy and a CD as part of the dissertation).
A new implementation of the array- and ta bular-environments

This article describes a new implementation of the Ul&X array- and tabularenvironments. The special merits of this implementation are further options to format columns md the fact that fragile UTj$<ommands don't have to be \prot ect'ed my more within those environments. At the same time it shows a new - and in our opinion sensible - way of documenting "QX-macros: This article is the stylefile that is to be used. All we need in addition to it is a short 'T@-program which visualizes the comments and puts the definitions in verbatim mode.
Performance of QoS-based multicast routing algorithms for real-time communication

In recent years, there has been a lot of interest in providing real-time multimedia services like digital audio and video over packet-switched networks such as Internet and ATM. These services require certain quality of service (QoS) from the network. The routing algorithm should take QoS factor for an application into account while selecting the most suitable route for the application. In this paper, we introduce a new routing metric and use it with two different heuristics to compute the multicast tree for guaranteed QoS applications that need firm end-to-end delay bound. We then compare the performance of our algorithms with the other proposed QoS-based routing algorithms. Simulations were run over a number of random networks to measure the performance of different algorithms. We studied routing algorithms along with resource reservation and admission control to measure the call throughput over a number of random networks. Simulation results show that our algorithms give a much better performance in terms of call throughput over other proposed schemes like QOSPF.
Web Service Composition Verification of Safety Properties: An Approach Based on Predicate Abstraction

The biggest problem in model checking is state space explosion. Using predicate abstraction, state space of colored Petri net models were abstracted, and an algorithm was proposed to obtain the abstracted state space of a colored Petri net model without its original state space generated. A method to verify safety properties of Web service composition by abstracted state space was proposed. The problem of state space explosion is solved to some extend in this way. Finally an application of the method is illustrated with an example, which its efficiency shown.
A single-Vt low-leakage gated-ground cache for deep submicron

In this paper, we propose a novel integrated circuit and architectural level technique to reduce leakage power consumption in high-performance cache memories using single V/sub t/ (transistor threshold voltage) process. We utilize the concept of gated-ground (nMOS transistor inserted between ground line and SRAM cell) to achieve a reduction in leakage energy without significantly affecting performance. Experimental results on gated-ground caches show that data is retained (DRG-Cache) even if the memory is put in the standby mode of operation. Data is restored when the gated-ground transistor is turned on. Turning off the gated-ground transistor in turn gives a large reduction in leakage power. This technique requires no extra circuitry; the row decoder itself can be used to control the gated-ground transistor. The technique is applicable to data and instruction caches as well as different levels of cache hierarchy, such as the L1, L2, or L3 caches. We fabricated a test chip in TSMC 0.25-/spl mu/m technology to show the data retention capability and the cell stability of the DRG-Cache. Our simulation results on 100-nm and 70-nm processes (Berkeley Predictive Technology Model) show 16.5% and 27% reduction in consumed energy in L1 cache and 50% and 47% reduction in L2 cache, respectively, with less than 5% impact on execution time and within 4% increase in area overhead.
What are we managing – knowledge or information?

Purpose – A good amount of literature has appeared on knowledge management, wherein, by and large, the concepts of information and knowledge are being used in an overlapping manner, as are information management and knowledge management. There seems to be a conceptual confusion as to what libraries are managing – information or knowledge? This paper proposes to examine this issue.Design/methodology/approach – Based on a literature survey and the author's own teaching experience, the article tries to provide an answer to this simple but at the same time complex question. The subject scope is self‐explanatory as it deals with two basic aspects, i.e. IM and KM.Findings – Based on certain characteristics, efforts have been made to produce a clear distinction between IM and KM. These findings are also presented in tabular form.Practical implications – Today, KM has become an important activity in all organizations, particularly in the corporate sector. As a result, intangible assets are playing the role of key.