Miracle-dz/UniFAR-FTUs huggingface dataset:
Lmcgrid: A Low Management Cost Grid Computation Model

Abstract This paper proposes a Low Management Cost computing Grid model (LMCGrid), aiming at harvesting the idle time of computers connected to Internet to run large-scale distributed applications. In LMCGrid, no specific node is designated to manage dynamically changing resources. Despite the absence of the management node, the corresponding information mechanism, task scheduling algorithm and limited task duplicating algorithm naturally evolve the system into equilibrium to perform large-scale distributed computation with low cost. A simulation software package has been developed to verify this model and to assess its performance. The results showed that LMCGrid reasonably distributed loads in a dynamic environment, and fully utilized the computational capacity of idling resources, and that it was feasible to solve large-scale, embarrassingly parallel applications such as parameter sweep and Monte Carlo simulations efficiently.
Performance Effects of a Cache Miss Handling Architecture in a Multi-core Processor

Multi-core processors, also called Chip multiprocessors (CMPs), have recently been proposed to counter several of the problems associated with modern superscalar microprocessors: limited instruction level parallelism (ILP), high power consumption and large design complexity. However, the performance gap between a processor core and main memory is large and growing. Consequently, multi-core architectures must invest in techniques to hide the large memory latency. One way of doing this is to use non-blocking or lockup-free caches. The key idea is that a cache can continue to service requests while one or more misses are being processed at a lower memory hierarchy level. This technique was first proposed by Kroft [16]. The main contribution of this paper is the observation that a non-blocking cache must fulfill two functions. Firstly, it should provide sufficient miss parallelism to speed up the applications. Secondly, the number of parallel misses should not be so large that it creates congestion in the on-chip interconnect or off-chip memory bus. While the first function is well known, the other is a result of the possibility for contention when multiple processors are placed on a single chip. A compromise miss handling architecture (MHA) evaluated in this work which handles 16 parallel misses in the L1 cache, has an average speed-up of 47 % compared to a blocking cache and has a hardware cost of 9 % of the L1 cache area.
Rhythmic Walking Interaction with Auditory Feedback: Ecological Approaches in a Tempo Following Experiment

We present an interactive auditory display for walking with sinusoidal tones or ecological, physically-based synthetic walking sounds. The feedback is either step-based or rhythmic, with constant or adaptive tempo. In a tempo-following experiment, we investigate diﬀerent interaction modes and auditory feedback, based on the MSE between the target and performed tempo, and the stability of the latter. The results indicate that the MSE with ecological sounds is comparable to that with the sinusoidal tones, yet ecological sounds are considered more natural. Adaptive conditions result in stable tempi. These results have implications on the design of interactive entertainment or therapeutical applications.
A task-based approach to improving the software maintenance process

A comprehensive approach is given to improving the software maintenance process based on task analysis. Techniques are presented for determining maintenance tasks and their relationships. Different methods are then used to derive necessary information to perform these tasks. This information can then be placed in a database and used by tools for dissemination to software engineers to help them perform maintenance tasks. Case study results for the application of this process are described. <<ETX>>
An Evolutionary Programming Solution to the Unit Commitment Problem

The work was conducted with the aim of finding a general method for solving the unit commitment (UC) problem. The proposed algorithm employs the evolutionary programming (EP) technique in which populations of contending solutions are evolved through random changes, competition, and selection. In the subject algorithm an overall UC schedule is coded as a string of symbols and viewed as a candidate for reproduction. Initial populations of such candidates are randomly produced to form the basis of subsequent generations. The practical implementation of this procedure yielded satisfactory results when the EP-based algorithm was tested on a reported UC problem previously addressed by some existing techniques such as Lagrange relaxation (LR), dynamic programming (DP), and genetic algorithms (GAs). Numerical results for systems of up to 100 units are given and commented on.
Multi-Reconstruction of a 3D Freeform Object from Range Images

In Reverse Engineering (RE), laser scanners are commonly used since they can sample 3D range images fast and very accurately relative to other systems. However, these range images are irregular and scattered and require intensive processing in order to reconstruct the surface of the object. Reconstruction of freeform surfaces is based on two main stages: (1) parameterization and (2) surface fitting. Selecting an appropriate parameterization is essential for topology reconstruction as well as for surface fitting. In this paper, two parameterization methods are proposed: Partial Differential Equation (PDE) and SelfOrganizing Maps (SOM). Then, each range image taken from a specific direction is reconstructed as a B-spline surface based on the proposed CMA (Control Mesh Approximation), GDA (Gradient Descent Algorithm) and RSEC (Random Surface Error Correction) fitting methods. Finally, the fitted surfaces are trimmed and merged into a closed surface representation of the 3D volumetric object.
A Survey of Two-Party Password Authentication Key Exchange

Security in computers is information protection from unauthorized or accidental disclosure while the information is in transmission and while information is in storage. Authentication protocols provide two entities to ensure that the counterparty is the intended one whom he attempts to com- municate with over an insecure network. These protocols can be considered from three dimensions: type, efficiency and security. Password Authenticat- ed Key Exchange (PAKE) protocols facilitate two entities to consent on an ordinary session key based on a pre-shared human memorable password. The most important security goal of these protocols is providing security against password guessing attacks. Recently, In 2010 R. Song (1) proposed advanced smart card based password authentication protocol with such non-tamper resistant smart card based on symmetric key cryptosystem as well as modular exponentiation. R. Song et al method is defenseless to the offline password attack, forward secrecy, insider attack and denial of service at- tack are cryptanalysis by W B Horng (2). Here in this paper we will survey on different protocols implemented based on two password authentication and a brief review is given based on different techniques.
A Study of Content Extraction From Web Pages Based on Links

Extracting main content from web page is the preprocessing of web information system. The content extraction approach based on wrapper is limited to one specific information source, and greatly depends on web page structure. It is seldom employed in practice. A new content extraction method is thus proposed in this paper, which can discover web page content according to the number of punctuations and the ratio of non-hyperlink character number to character number that hyperlinks contain. It can eliminate noise and extract main content blocks from web page effectively. Experimental results show that this approach is accurate and suitable for most web sites.
T-SPaCS: a two-level single-pass cache simulation methodology

The cache hierarchy's large contribution to total microprocessor system power makes caches a good optimization candidate. We propose a single-pass trace-driven cache simulation methodology -- T-SPaCS -- for a two-level exclusive instruction cache hierarchy. Instead of storing and simulating numerous stacks repeatedly as in direct adaptation of a conventional trace-driven cache simulation to two level caches, T-SPaCS simulates both the level one and level two caches simultaneously using one stack. Experimental results show T-SPaCS efficiently and accurately determines the optimal cache configuration (lowest energy).
Stationary waiting time distribution in queues with phase type service and in quasi-birth-and-death process

We consider the stationary waiting time distribution under the FIFO discipline for multi-server queues with (possibly heterogeneous) phase type servers and renewal arrivals, and for queues which can be represented as a quasi-birth-and-death process. It is shown that the complementary distribution function of the stationary waiting time in these queues is of the form where θ is positive and the dj are probabilities. A complete characterization of θ and dj , which lends itself to interesting probabilistic interpretations, is given for all these cases. Except in the case of the multiserver GI/PH/c queue which is to be discussed in detail elsewhere, we provide an efficient algorithm to compute the waiting time distribution.
Reverse Engineering XML

A great number of existing XML documents in various domain such as Electrical Business have to be maintained in order to constantly adapt to a dynamically changing environment to keep pace with business needs. A DTD or XML Schema in its current textual form commonly lacks clarity and readability, which makes the maintenance process tedious and error-prone. This paper presents an approach to reverse engineering the XML documents to conceptual model, which makes the XML documents more close to real world and business needs, let the designers quickly gain a picture of the overall structure of XML documents in order to improve its quality, increase the maintainability and reusability. In this paper, the conceptual model is described by UML class diagram, a three-level model is defined, and a novel approach for extracting various structure and semantic information from existing DTD is given, especially the inheritance structure can be inferred from the DTD structure.
An Experimental Study of Self-Optimizing Dense Linear Algebra Software Analytical models of the memory hierarchy are used to explain the performance of self-optimizing software.

Memory hierarchy optimizations have been studied by researchers in many areas including compilers, numerical linear algebra, and theoretical computer science. However, the approaches taken by these communities are very different. The compiler community has invested considerable effort in inventing loop transformations like loop permutation and tiling, and in the development of simple analytical models to determine the values of numerical parameters such as tile sizes required by these transformations. Although the perfor- mance of compiler-generated code has improved steadily over the years, it is difficult to retarget restructuring compilers to new platforms because of the need to develop analytical models manually for new platforms. The search for perfor- mance portability has ledto thedevelopment ofself-optimizing software systems. One approach to self-optimizing software is the generate-and-test approach, which has been used by the dense numerical linear algebra community to produce high- performanceBLASandfastFouriertransformlibraries.Another approach to portable memory hierarchy optimization is to use the divide-and-conquer approach to implementing cache- oblivious algorithms. Each step of divide-and-conquer gener- ates problems of smaller size. When the working set of the subproblems fits in some level of the memory hierarchy, that subproblem can be executed without capacity misses at that level. Although all three approaches have been studied extensively, there are few experimental studies that have compared these approaches. How well does the code produced by current self-optimizing systems perform compared to hand- tuned code? Is empirical search essential to the generate-and- test approach or is it possible to use analytical models with platform-specific parameters to reduce the size of the search space? The cache-oblivious approach uses divide-and-conquer to perform approximate blocking; how well does approximate blocking perform compared to precise blocking? This paper addresses such questions for matrix multiplication, which is the most important dense linear algebra kernel.
Photometric method for determining surface orientation from multiple images

A novel technique called photometric stereo is introduced. The idea of photometric stereo is to vary the direction of incident illumination between successive images, while holding the viewing direction constant. It is shown that this provides sufficient information to determine surface orientation at each image point. Since the imaging geometry is not changed, the correspondence between image points is known a priori. The technique is photometric because it uses the radiance values recorded at a single image location, in successive views, rather than the relative positions of displaced features. Photometric stereo is used in computer-based image understanding. It can be applied in two ways. First, it is a general technique for deter-mining surface orientation at each image point. Second, it is a technique for determining object points that have a particular surface orientation. These applications are illustrated using synthesized examples.
ee Wireless Network Multicast

to the multihop case since th In this papel; we propose a tihop, mobile wireless network and token access protocol wi cast protocol uses a shared tre dated to adjust to changes in (i.e. dynamic joins and quits tenance have been simulated state ’’ (each connection is automatically timed out and must be refreshed). For the soft state policy, the diferent choices of timeout and refresh ti lyzed for a range of node mobility values. Next, soft state and hard state policies are compared based on th join delay, and control overhead criteria.
A Method for Blind Detection of OFDM Signal Based on Power Spectrum Reprocessing

A method for blind detection of OFDM signal based on power spectrum reprocessing is presented for distinguishing OFDM signal and single carrier modulation signals. The method takes full advantage of cryptic period of OFDM signal and enhances its ability for processing through power spectrum pretreatment, and has strong ability to suppress additive interference and is applicable to frequency selectivity fading channel and accurately estimate subcarrier frequency interval, symbol period, signal bandwidth and subcarrier number of OFDM signal. The simulation result shows that the new method is able to detect OFDM signals rapidly and accurately in condition of relatively low signal-noise ratio, and achieves high identification probability, has high adaptability for frequency selectivity fading channel, and has also low computational complexity, high precision, and is suitable for hardware implement.
On the Identification of the Survivor Average Causal Effect

In randomized trials in which the outcome requires considerable follow-up, participants may die before the trial is complete. In such cases, for the individuals who die before follow-up is complete, the outcome is not simply missing, but is undefined. Some authors refer to this situation as one in which the outcome is â€œtruncated by deathâ€? [1,2], to distinguish this scenario from cases in which the outcome is merely missing because of inadequate data collection. In these settings, a crude comparison of the outcome between those who survived in each treatment arm may give misleading results, because we no longer preserve randomization by conditioning on a post-treatment event (survival) and thus the crude comparison is not a comparison for the same population comparing different treatments, but a comparison of different populations.
Advantages and Advancements of Multiple Imputation

Multiple imputation is still an underused approach for handling missing data despite new advances and its potential in clinical, environmental, and health policy research. This review will discuss several benefits of this technique as well as the approaches that make the technique applicable to different types of data. Providing such examples may show investigators how considering this method may help in their future research.
Spatial Domain Robust Watermarking Scheme for Color Image

Designing an efficient watermarking technique for digital media is still a challenge. Here we presented a robust watermarking method in spatial domain of the color image. We divided the image into eight parts and embedded the binary form of the copyright information after encrypting each bit with a secret key, inside the blue component of the color image. We used a random sequence for selecting the pixel in which we want to insert the information. We stored the information in the blue component of the pixel. We put the recovery record by changing the corresponding green component of the pixel, comparing the changed blue component and the red component of the pixel. The extraction of the copyright information is based on comparing red and green component with the blue component of the pixel from any available block or part of the any eight block of the image. Testing is done by Stirmark benchmark 4.0. The test result shows that the proposed method is very secure and robust against various attacks.
THE USE OF WIMS FOR GAS-COOLED REACTOR CALCULATIONS

The Advanced Gas Cooled Reactors(AGR) operated in the UK are a design that has features that test the capability of reactor codes. The WIMS code is a general neutronics package that has the capability to model this type of reactor. This paper outlines some recent developments to the hybrid Monte Carlo package called MAX within WIMS. These improvements were designed to improve the speed and accuracy of calculations that mainly involve perturbations due to temperature or irradiation. The method adopted is outlined in the paper, in particular the linkage to the deterministic code CACTUS and the treatment of sequences of perturbations are described. The paper also outlines the developments to the WIMSBUILDER package that significantly eases the generation of input for WIMS calculations involving a sequence of perturbations to temperature and then cycles through a set of depletion steps. Finally the paper outlines a number of validation results that test the performance of this new package. Results are presented that show the package accurately predicts 3D effects, temperature coefficients, poison worth and irradiation effects. The resultant code is also shown to be ~ 2 orders of magnitude faster than both the older version of the code and conventional Monte Carlo calculations. Thus the paper concludes that this new method is capable of being used to accurately model complex situations and can be used in conjunction with the code PANTHER to apply these results to whole core situations.
Consistent and Proficient Algorithm for Data Gathering in Wireless Sensor Networks

Problem statement: A wireless sensor network is usually deployed in a harsh geographical area to gather data that can be delive red to the remotely located base station. Sensor no des have irreplaceable energy source, limited computati onal capability and limited memory. It is a challen ge to maximize the use of energy of these sensor nodes to extend the network lifetime. Approach: This study proposes a Rank-Based Data Gathering Algorithm for wireless sensor networks. Sensor nodes were randomly distributed in a network field of differen t sizes. For every round of data communication, the algorithm steps were as follows: A set of sensor no des or vertices were given a random rank between 0 and 1. A link formed between any two nodes if they were within each other's transmission range. If a sensor node had the highest rank among its neighbor s, then it considered an associate node, else it fa lls into the leaf node. Next, the associate nodes form a complete graph among them and later form a Rooted Directed Tree (RDT) after an implementation of Kruskal's Minimum Spanning Tree algorithm and the Breadth First Search algorithm. Finally, a model th at takes into account the energy when deciding what type of node a sensor was implemented. Results and Conclusion: After recording the simulation results, it is concluded that the RBDG yields a better outco me in terms of lifetime and delay per round for TDMA than other popular data gathering algorithms.
A Syntactic Description of German in a Formalism Designed for Machine Translation

This paper presents a syntactic description of a fragment of German that has been worked out within the machine translation project Eurotra. It represents the syntactic part of the German module of this multilingual translation system. The linguistic tool for the following analyses is the so-called CAT-framework.In the first two sections of this paper an introduction of the formalism and a linguistic characterization of the framework is given. The CAT formalism as a whole is a theory of machine translation, the syntactic analysis part which is the subject of this paper is an LFG-like mapping of a constituent structure onto a functional structure.A third section develops principles for a phrase structure and a functional structure for German and the mapping of phrase structure onto functional structure.In a fourth section a treatment of unbounded movement phenomena is sketched. As the CAT-framework does not provide any global mechanisms I try to give a local treatment of this problem.
PHYSICS AND BIOMECHANICS EDUCATION RESEARCH: IMPROVING LEARNING OF BIOMECHANICAL CONCEPTS

Many students find mechanical concepts counterintuitive, difficult, and often have a negative perception of physics and biomechanics classes. This paper reviews the research on learning mechanical concepts from the physics and biomechanics literature. Substantial progress has been made in standardized tests of biomechanical concepts and identifying factors that are associated with learning these concepts. Active learning pedagogies double learning of physics and biomechanics concepts compared to traditional lecture/lab instruction. Biomechanics instructors should consider using research-based instructional strategies, participate in and support the scholarship of teaching and learning of biomechanical concepts.
Metascience: A Paradigm for Postgraduate Communication Design Research

ABSTRACTCommunication design research is becoming an essential component in solving current design problems and tackling new design challenges. However, the notion of a scientific approach to communication design is still an object of discussion. The scientific research scenario in communication design is almost opposed to that of other design fields, such as engineering and product design. While the later fields have well-defined research structures and strong communication channels, the former is still facing foundational problems. The current state of communication design research is described by a lack of a scientific rationale and ambiguous research process structures, frameworks for developing methodologies and strategies to narrow the gap between academia and professional practice.This paper proposes the adoption of a holistic approach—metascience—to enhance and structure postgraduate communication design research. Through the adoption of key aspects of robust scientific disciplines, less experienc.