Miracle-dz/UniFAR-FTUs huggingface dataset:
Security Strategy of DRM Based on Trusted Computing

Trusted Computing provides a good technical support for the safe use of Digital Rights Management, which keeps control effectually by monitoring the consumer’s behavior. Digital rights management system based on trusted computing is designed, in which identity authentication employs direct anonymous authentication and validation of controller uses property certificate based attestation. Asymmetric session key is generated and calculated by server and client together through Diffie-Hellman key exchange protocol, integrate it into the integrity reporting protocol, and then the session key encrypts digital information. Security analysis demonstrates that the method can prevent illegal access and attack from malicious third party since only the local Trusted Platform Module can decrypt the key, other illegal user cannot access the content. Special process of remote attestation is illustrated in detail by one streaming media instance of the system and experiment showed that the scheme has improved the efficiency and credibility of remote attestation.
Research into teaching with whole‐class interactive technologies: emergent themes

This discussion paper highlights a number of themes emerging from contemporary research into teaching with whole‐class interactive technologies. Focusing particularly on the contributions to this special issue, the paper considers the significance of whole‐class interactive technologies (primarily interactive whiteboards) with respect to the use of multimodal resources and enabling a more interactive style of whole‐class teaching. Recognising that as technologies change and develop, teachers also need support, time and space to explore the associated implications for their pedagogy and practice, the paper also considers the implications for the professional development of teachers.
No-wait scheduling of a two-machine flow-shop to minimise the makespan under non-availability constraints and different release dates

In this paper, we consider the two-machine no-wait flow-shop scheduling problem, when every machine is subject to one non-availability constraint and jobs have different release dates. The non-availability intervals of the machines overlap and they are known in advance. We aim to find a non-resumable schedule that minimises the makespan. We propose several lower bounds and upper bounds. These bounding procedures are used in a branch-and-bound algorithm. Computational experiments are carried out on a large set of instances and the obtained results show the effectiveness of our method.
A unifying framework for HAMs-family HRL methods

In the HRL (hierarchical reinforcement learning) field, there are three main methods such as HAMs (hierarchical abstract machines), options, MAXQ. These methods all rely on the theory of SMDPs. While the SMDP framework allows us to directly model the high-level actions that take varying amounts of time, it provides little in the way of concrete representational guidance, which is critical from a computational and analytical point of view. In particular, the SMDP framework does not specify how the overall task can be decomposed into a collection of subtasks, which is important for us to do state abstraction and subtask sharing for individual subtask or module. In addition, we also want to choose between hierarchical optimality and recursive optimality for a given hierarchy on our problem. This paper introduces a unifying framework for HAMs-family methods. Based on this framework, we can define HAMs or sub- HAM homomorphism for state abstraction and can also freely select alternative policy optimality.
Channels of published research communication used by Malaysian authors in computer science and information technology

Analyse 389 records retrieved from Inspec (1990-1999), Compendex (1987-1999) and IEL (IEE/IEEE Electronic library)(1987-1999). The records comprised 159 journal articles, 229 conference papers and 1 monograph chapter. The subject coverage was computer science and information technology. The yearly output of Malaysian publications indicated a gentle upward trend. The highest contributions was 87 published in 1997. The channels used to publish differ slightly from the norm for scientists. Conference papers were preferred to journal articles. The spread of conference papers used to publish indicate three zonal distributions; the nucleus, moderate and low productivity in the ratio of 19 : 41 : 88, leading to a clustering index of 2.15. This shows that Malaysian conference contributions were concentrated in a few proceedings. No clear core journals can be identified for the journal articles and contributions were distributed in a wide variety of journal titles. Malaysian Journal of Computer Science published the highest number of journal articles. More than 83% of the articles were published in journals from the UK, USA, the Netherlands and Malaysia.
The Transition from Paper to Electronic Journals

Abstract The primary purpose of this paper is to investigate what factors crucially affect scholar's acceptance of e-journals. Before reviewing various aspects of e-journals, it is necessary to fully understand the traditional journal system, because the developments, roles, and deficiencies of the paper journal system will illustrate some basic requirements for successful e-journals. This article also examines the developments of e-journals and presents a comprehensive examination of the economic, technological and cognitive, and sociological aspects of e-journals based upon an extensive literature review. With regard to the economic and technological and cognitive aspects, the benefits of scholarly e-journal publishing appear to be, by and large, favorable to the transition from paper to electronic journals. However, the major stumbling block is the credibility of scholarly e-journals. Whether or not scholars can obtain the same recognition or rewards through e-journal publication as they obtain through paper journal publication must be one of the key factors that affect scholar's acceptance of e-journals.
Privacy and Security Problems in Fog Computing

Fog Computing is a term made by Cisco that insinuates extending cloud computing to the edge of a network. Generally called Edge Computing or preliminaries, fog computing supports the operation of Fog/cloud, storage and networking services between end devices and conveyed processing data centers. Fog computing is a gifted computing perspective that extends cloud computing to the edge of frameworks/networks. Like cloud computing however with specific characteristics, fog computing faces new-fangled security and assurance defies other than those procured from cloud computing. We have reviewed these defies/concerns and prospective plans briefly in this paper.
On the Nature of and Teachers' Goals for Students' Mathematical Argumentation in High School Classrooms.

In an era of new standards and emerging accountability systems, an understanding of the supports needed to aid teachers and students in making necessary transitions in mathematics teaching and learning is critical. Given the established research base demonstrating the importance of justification and reasoning in students' mathematics learning and the heightened emphasis on students' abilities to demonstrate the mathematical practices outlined by the Common Core State Standards Mathematics Practice Standards, this study is timely in that it examined mathematical argumentation as it is currently enacted in today's classrooms. The study investigated students' mathematical argumentation as it is currently practiced in high school classrooms to understand the ways in which the teacher education and professional development communities may better support teachers in this new era of standards and accountability. Five high school Algebra I teachers and their classes comprised the sample. Using a multiple case study design, data in the forms of classroom observations, teacher interviews, and detailed field notes were collected and analyzed. The within- and cross-case analyses revealed a modest number of episodes of mathematical argumentation with a primary focus on using definitions, properties, and procedures to establish students' claims. Further, teachers fostered mathematical argumentation in their classrooms for a variety of reasons, many of which focused on factors affecting learning not explicitly supporting the learning of new mathematical ideas. Findings suggest that teachers may view argumentation as a means of assessing students' knowledge rather than as a mechanism of learning.
in Bayesian Image Segmentation Based on Finite Mixtures

In this paper, the authors propose the use of prior densities within the framework of finite mixture models applied towards image segmentation. They pose segmentation as a pixel labeling problem and investigate a generalized expectation maximization algorithm for the Bayesian estimation of the pixel labels. This algorithm is based on a unique spatially-variant mixture model and has the flexibility of incorporating any useful prior information on the potential label configurations. Specifically, two different priors are proposed for pixel labeling and their effectiveness is assessed quantitatively on simulated images at various noise levels. A qualitative evaluation has also been performed using clinical magnetic resonance images of the human brain.
Implementing a Corporatewide Information Strategy Through CASE

A new technology has emerged in recent years to assist in modeling all facets of a business enterprise and in the design and development of information systems. This technology, computer-aided software engineering (CASE), has caused much confusion in the IS community about its exact purpose. This article provides a detailed definition of CASE, distinguishes between CASE and integrated CASE (ICASE), and provides several strategies for ICASE implementation.
TDSGenerator: A Tool for generating synthetic Transactional Datasets for Association Rules Mining

Data Mining (DM) is the process of automated extraction of interesting data patterns representing knowledge, from the large data sets. Frequent itemsets are the item sets that appear in a data set frequently. Finding such frequent itemsets plays an essential role in mining associations, correlations, and many other interesting relationships among itemsets in transactional and relational database. In this paper we have presented a tool called, Transactional Dataset Generator (TDSGenerator v1.0) for generating a Binary Dataset as well as Transactional Dataset corresponding to the Binary Dataset. Synthetic datasets generated by this tool will be used to find the list of frequent itemsets and thereafter finding the strong Association Rules among those itemsets. This tool can also be used as a demonstrator for experimenting and explaining the concepts of Association Rules Mining (ARM).
Signal processing methods for the analysis of cerebral blood flow and metabolism

An important protective feature of the cerebral circulation is its ability to maintain sufficient cerebral blood flow and oxygen supply in accordance with the energy demands of the brain despite variations in a number of external factors such as arterial blood pressure, heart rate and respiration rate. If cerebral autoregulation is impaired, abnormally low or high CBF can lead to cerebral ischemia, intracranial hypertension or even capillary damage, thus contributing to the onset of cerebrovascular events. The control and regulation of cerebral blood flow is a dynamic, multivariate phenomenon. Sensitive techniques are required to monitor and process experimental data concerning cerebral blood flow and metabolic rate in a clinical setting. This thesis presents a model simulation study and 4 related signal processing studies concerned with CBF regulation. The first study models the regulation of the cerebral vasculature to systemic changes in blood pressure, dissolved blood gas concentration and neural activation in a integrated haemodynamic system. The model simulations show that the three pathways which are generally thought to be independent (pressure, CO₂ and activation) greatly influence each other, it is vital to consider parallel changes of unmeasured variability when performing a single pathway study. The second study shows how simultaneously measured blood gas concentration fluctuations can improve the accuracy of an existing frequency domain technique for recovering cerebral autoregulation dynamics from spontaneous fluctuations in blood pressure and cerebral blood flow velocity. The third study shows how the continuous wavelet transform can recover both time and frequency information about dynamic autoregulation, including the contribution of blood gas concentration. The fourth study shows how the discrete wavelet transform can be used to investigate frequency-dependent coupling between cerebral and systemic cardiovascular dynamics. The final study then uses these techniques to investigate the systemic effects on resting BOLD variability. The general approach taken in this thesis is a combined analysis of both modelling and data analysis. Physiologically-based models encapsulate hypotheses about features of CBF regulation, particularly those features that may be difficult to recover using existing analysis methods, and thus provide the motivation for developing both new analysis methods and criteria to evaluate these methods. On the other hand, the statistical features extracted directly from experimental data can be used to validate and improve the model.
Mathematical analysis of super-resolution methodology

The attainment of super resolution (SR) from a sequence of degraded undersampled images could be viewed as reconstruction of the high-resolution (HR) image from a finite set of its projections on a sampling lattice. This can then be formulated as an optimization problem whose solution is obtained by minimizing a cost function. The approaches adopted and their analysis to solve the formulated optimization problem are crucial, The image acquisition scheme is important in the modeling of the degradation process. The need for model accuracy is undeniable in the attainment of SR along with the design of the algorithm whose robust implementation will produce the desired quality in the presence of model parameter uncertainty. To keep the presentation focused and of reasonable size, data acquisition with multisensors instead of, say a video camera is considered.
IMPLEMENTATION OF PROCESS FORENSIC FOR SYSTEM CALLS

Mechanisms such as dynamic process migration, process forensic, process checkpoint-restart are concerned with process-state checkpointing. Dynamic process migration mechanism migrates a partially executed process from its originating workstation to other workstation, thereby it supports load balancing in distributed & networked systems letting applications to access computing resources spread across the network; such workload relocation among workstations may result into substantial improvements in overall system performance. The process checkpointing mechanism is responsible for identifying current dynamic and static state information of a desired process. However, determination of information of a particular system call under execution by a process to be checkpointed is one of the challenging tasks for the process checkpointing and migration mechanisms. A kernel-level solution for checkpointing the system call details is described in this paper.
A Flexible Garbage Collect Algorithm for Flash Storage Management

Log-structured file system (LFS) is widely used in multimedia terminals, which always use flash memory as main storage. Flash memory must be erased before writing and the maximum erasure times of each block is limited, therefore, the flash storage management is quite different from other storages. A flash storage system requires a garbage collect and cleaning mechanism to reclaim the invalidated space for future use. An efficient garbage collect algorithm should achieve wear leveling with low cleaning cost, but cleaning cost and wear levering are two conflicting objectives. Efficient cleaning always comes along with wear skewness, since the blocks (maybe 80% of capacity) with cold data are expected to be seldom erased to decrease total erasure count, while the blocks with hot data will reach the erasure limitation soon, which is caused by frequent accessing.In this paper, a flexible garbage collect algorithm is proposed to achieve an un-absolute balance, since different flash life phase needs different optimization. It is quite wise to go in for low cleaning cost when the flash is fresh, but when it is nearly worn out, wear leveling is more important.
Management by values: a management centered on the person

Cuando lo unico seguro es la inseguridad, el caos y la lucha por la supervivencia, las organizaciones requieren cada vez mas de heroes que las guien en medio de un mundo dinamico, complejo y hostil, pero no existen heroes sin valores. Se estudia la relacion valores-actitudes-comportamientos-resultados como base para entender la direccion por valores, una gestion que complementa a la direccion por objetivos en una epoca de renovadas necesidades empresariales, donde son indispensables altos niveles de rendimiento, creatividad y compromiso entre los empleados y dirigentes. Se define la direccion por valores como una gestion cuyo centro es la persona. Se analiza la seguridad, la salud y la calidad de vida laboral como un componente esencial en la busqueda del bienestar y la felicidad de los empleados. Finalmente, se trata la conveniencia de la introduccion de una direccion por valores en organizaciones que requieren de la explotacion intensa del talento de sus miembros, como sucede con las empresas del sector tecnologico.
Building A Monitoring Overlay for Peer-to-Peer Streaming.

Current peer-to-peer (P2P) streaming systems often assume that nodes are cooperative to upload and download data. However, in the open environment of the Internet, this is not true and there exist malicious nodes in the system. In this paper, we study malicious actions that can be detected through peer- based monitoring. We require each node to monitor the data received and to periodically send out monitoring messages about its neighbors to some trustworthy nodes. To efficiently store and search the messages among multiple trustworthy nodes, we organize the trustworthy nodes into a threaded binary tree. The trustworthy nodes also dynamically redistribute the monitoring messages among them to achieve load balancing. Our simulation results show that this scheme can efficiently detect malicious nodes with high accuracy, and that the dynamic redistribution method can achieve good load balancing among the trustworthy nodes.
Solid State Quantum Bits

We present the solid-state quantum circuits that have been developed in order to implement quantum bits suitable for a quantum processor. These qubits are either based on the quantum state of a single particle (semiconductor qubits), or on the quantum state of the global circuit (superconducting qubits). We discuss more in detail the superconducting qubits, and present results on qubit manipulation and readout. We explain the main strategies used to improve and tio maintain quantum coherence.
Blind beamforming and maximum ratio combining by kurtosis maximization for source separation in multipath

Ding and Nguyen's (2000) kurtosis maximization algorithm (KMA) for blind signal separation and antenna beamforming assumes the absence of multipath channels. This paper proposes a multistage source separation (MSS) algorithm assuming that source signals are independent identically distributed (iid) non-Gaussian and received in the presence of multiple paths (as practically happens in wireless communications). The proposed MSS algorithm includes extraction and blind maximum ratio combing (BMRC) of a source signal from different paths using a fast KMA (FKMA), besides signal classification, time delay estimation, and cancellation of the contribution of the extracted source signal from the received signal at each stage. The proposed MSS algorithm with no need of prior information about the array configuration and direction of arrival (DOA) is supported through computer simulation.
An Efficient Routing Algorithm for Opportunistic Networks Based on Network Coding

To address the problems in Opportunistic Networks that nodes employing routing algorithms based on epidemic mechanism cant sense their neighboring nodes timely and many redundant data packets permeate through the network, an efficient routing algorithm based on XOR network coding was proposed (Xor Network Coding based Epidemic Routing, XNCER). When a node gets a Hello message, it broadcasts, instead of unicasting, a SV(Summary Vector) packet, in return, to all its neighboring nodes. Therefore, the data transmission can be initiated immediately, and the XOR network coding can also be leveraged so as to enhance the efficiency of data transmission. Moreover, the packets destined to the one hop neighboring nodes obtain the priority in transmission, and are determined whether to be deleted based on the ACK mechanism running in the MAC layer in order to cut down the memory overhead and restrain redundant packets from dissemination. Theoretical analysis and extensive simulation results show that the new algorithm obtains an overall improvement in terms of network overhead, average end-to-end delay as well as delivery rate. The novel algorithm can effectively solve the problems of sensing neighboring nodes and data redundancy.
Ibm system z9 109 technical introduction

Hardware description Software support Key functions This IBM Redbook introduces the IBM System z9 109 (z9-109), which offers a continuation of the IBM scalable mainframe servers. The z9-109 server is based on z/Architecture and provides extensions to the architecture. In addition to increased performance and expansion options, particular emphasis has been placed on the integration of the z9-109 into a complete system and software environment. This document provides basic information about new hardware functions and features, associated software support, and migration considerations. It is intended for systems engineers, hardware planners, and anyone else needing to understand the new z9-109 system elements and plan for their usage. This document is not intended as an introduction to mainframes. Readers are expected to be generally familiar with current zSeries technology and terminology.
A Hybrid PSO with Load-Balanced SPV for Real-time Task Scheduling on Chip Multiprocessor

In this paper, a hybrid PSO heuristic and an improved solution representation rules are proposed for the real-time task schedule problem on Chip Multiprocessor (CMP). The hybrid PSO incorporates a Neighbor Search process at the final stage of each move in a standard PSO, and highly improves the result of optimization. The new solution representation rule called the Load-Balanced SPV, evenly assigns tasks to the chip multi-processors according to their total loads, and produces more balanced schedule than the original SPV rule. A comparative performance of our proposal is studied. Through a series of simulations, we demonstrate that our proposal produces much better balanced schedule as well as better overall fitness that the original ones.