Miracle-dz/UniFAR-FTUs huggingface dataset:
Web interfaces and usability

The master's project described in this thesis includes designing an interface for a Web site and doing usability tests at three different occasions. The designing process was based in the findings from a prior study [Backlund, 2000], design guidelines and checklists and the experience of the interface designer, who also is the author of this master's thesis. Three different methods were used for the usability tests. The Web site that was created is a job site where the users can search for job postings, post their CVs etc. When designing the interface, the designer tried to follow general guidelines. There are different types of guidelines, some are detailed and can be applied without thinking and the most general, for example Shneiderman's eight golden rules [Shneiderman, 1998], apply to all situations but require an analysis of the actual situation. There were three sets of usability test during the process and in between those, some small usability test were made when the designer felt insecure about which solution to choose. In this study the interface designer also did all programming too, which distracted him some from concentrating on the interface. When doing a usability test the test user should be matching the target group profile as closely as possible, in this case be interested in his or her own career. If the observer is the one who created the interface it is best if the test user does not know this and the observer must be able to take negative critique. Persons with a close relation to the observer should not be chosen as test users since it might have the affect that the test user is not honest in his or her feedback. The one thing that was found to give best feedback is for test users to talk out loud. If the test user can do this and feel comfortable doing it, it is an excellent method for usability testing. In this study three methods were used in the usability tests. The methods were codiscovery learning, where two users cooperate and learn together while doing tasks, retrospective testing, where the session is video recorded and the user and observer later watch the session together, and finally " normal " usability testing with an observer. In this study the codiscovery learning was not very effective since the two users did not know each other since before. The test user who did …
Microcomputers and Statisticians: A 1988 Perspective

A user's perception of the capabilities of a statistical package greatly affects the approach and extent of a given data analysis. As microcomputers have evolved into workstations, the standards of statistical software are being greatly altered. Advances in both the hardware and the operating systems associated with microcomputers point the way to a whole new methodology for performing research. This article briefly reviews the state of microcomputer statistical software and then discusses future trends. Keywords. microcomputers, statistical computing, statistical graphics.
Web Content Accessibility Guidelines (WCAG) 2.0

Web Content Accessibility Guidelines (WCAG) 2.0 covers a wide range of recommendations for making Web content more accessible. Following these guidelines will make content accessible to a wider range of people with disabili ties, including blindness and low vision, deafness and hearing loss, learning disabilities, c ognitive limitations, limited movement,
A precise on-chip voltage generator for a giga-scale DRAM with a negative word-line scheme

We have designed a precise on-chip voltage generator for giga-scale DRAMs with a negative word-line scheme. It combines a charge-pump regulator and a series-pass regulator, and includes a positive/negative offset voltage generator that uses a band-gap generator with a differential amplifier. The noise on a low-voltage word-line is suppressed to below 30 mV for the word-line transient and VBB bouncing. A DC voltage error of less than 6% without trimming is also achieved.
Design considerations for a high-performance 3-/spl mu/m CMOS analog standard-cell library

Several design aspects of a high-performance analog cell library implemented in 3-/spl mu/m CMOS are described, including an improved central biasing scheme, a circuit for high-swing cascode biasing, an impact ionization shielding technique, and a family of operational transconductance amplifiers including a precision low offset-voltage amplifier utilizing lateral bipolar transistors.
The Similarity of The Parts of Iris Texture

In the proposed search, new technique for calculating the similarity among parts related to iris images for the selected person and among iris images will be suggested by dividing iris texture into pre decided number of parts and calculating some features of each one of these parts as a texture then calculating degree of similarity among specific part and all other parts of the same iris and with some irises in database according to some accepted rules. The proposed method divided iris texture into eight parts with (45 degrees) for each part, the features of GLCM algorithm will be calculated for parts of iris image then the distance or similarity between specific and required iris with other irises that will be stored in database will be calculated and finally, the similarity calculated between each part (with 45 degrees) of iris and parts of irises stored in database. The proposed system applied some suitable techniques for localized the pupil of the iris image by using watershed segmentation method by drawing arrows between each pixels and 8-nighbouring pixels according to occurrence of some suitable feature then deleting all arrows from selected pixels if another feature doesn’t available in this pixels, this proposed system used for reducing database size for each registered person depending on extracted features from some parts of another person or from extracted features from one part of iris image.
Reasoning and learning method for fuzzy rules using neural networks with adaptive structured genetic algorithm

In this paper, we present a reasoning and learning method for fuzzy rules using neural networks with adaptive structured genetic algorithm. This adaptive structured genetic algorithm can determine the network structure and their weights solely by an evolutionary process. With this approach, no a priori assumptions about topology are needed and the only information required is the input and output characteristics of the task. The adaptive structured genetic algorithm can generate or annihilate the specified units respectively in hidden layer to achieve an overall good system, without using back propagation or any other learning algorithm.
Ensemble recording of electrical activity in neurons derived from P19 embryonal carcinoma cells

Regeneration of the central nervous system (CNS) is one of the most important research themes in neuroscience and neuroengineering. It is essential to replenish the lost neurons and to establish appropriate functional neuronal networks using pluripotent stem cells. Little is known, however, about the properties of stem cell-derived neuronal networks, particularly under the differentiation and development processes. In this work, we cultured P19 embryonal carcinoma cells on microelectrode arrays (MEAs). P19 cells were differentiated into neurons by retinoic acid application and formed densely connected networks. Spontaneous electrical activity was extracellularly recorded through substrate electrodes and analyzed. Synchronized periodic bursts, which were characteristic features in primary cultured CNS neurons, were observed. Pharmacological studies demonstrated that the glutamatergic excitatory synapses and the GABAergic inhibitory synapses were active in these P19-derived neuronal networks. The results suggested that MEA-based recording was useful for monitoring differentiation processes of stem cells. P19-derived neuronal networks had quite similar network properties to those of primary cultured neurons, and thus provide a novel model system to investigate stem cell-based neuronal regeneration. © 2011 Wiley Periodicals, Inc. Electron Comm Jpn, 94(4): 9–19, 2011; Published online in Wiley Online Library (wileyonlinelibrary.com). DOI 10.1002/ecj.10325
Diversity in Engineering Technology Students

In the US, there are two academic pathways to a career in engineering: Engineering and Engineering Technology (ET). Engineering Technology attracts more African American and Latin American students than traditional engineering programs. Nationally, African American students are more than twice as likely to enroll in an ET program versus Engineering. We suspect it may be due to traditional Engineering programs’ requirement of higher levels of math and science classes, often lacking in under-privileged or underserved urban or rural high schools. Recently published research by the New York Equity Coalition supports this supposition. Understanding the reasons for the higher representation of these students in ET can provide insights on the background of these students for developing effective practices and programming to improve retention of this cohort. It would also provide useful information for increasing the diversity of traditional engineering programs. This paper presents initial findings from a work in progress that is part of a multi-institution study to understand the factors that influence initial matriculation into and retention in engineering technology programs.
Migration Strategies for Object Oriented System to Component Based System

Migration of object oriented system to component based System is not an easy task, not only technically a lot of changes needs to be done but also numerous other issues needs to be kept in mind. However Component based Software development has been gaining its popularity from the past few years and has higher reusability scope. Programs built using CBSE approach are confirmed to be suitable to new environments. These days it's a universal practice to reuse components in project to achieve better quality and to save time. So moving to CBSE from object oriented seems wise decision. Number of approaches has been introduced to implement this and each one of them has its own pros and cons. The paper focuses on the brief review on works of different authors in this area from the year 2000 to 2014.
Variants of the Consecutive Ones Property: Algorithms, Computational Complexity and Applications to Genomics

Genome mapping problems in bioinformatics can be modelled as problems of finding sequences of vertices in hypergraphs, subject to consecutivity constraints. These problems are related to the consecutive ones property, a well-studied structural property on binary matrices. Many variants of this property have been introduced to include subtleties in the model, such as upper bounds on the number of times a vertex may appear in a sequence, the distance of the input from having the property, and confidence values for the consecutivity constraints. Most problems involving these variants are intractable, and efficient solutions call for restrictions on the structure of the input, exponential time algorithms, or approximations. The following document discusses these problems, from both a theoretical perspective, and from the genomics point of view. We encounter two main classes of problems, divided into models which account for repeated elements in genomes, and those which do not. Orthogonally, we divide the problems into decision and optimization questions. For models with repeats, we discuss when the given input can be used to reconstruct the genome map of interest, and if we can discard a minimal set of encoded consecutivity information from the model to obtain an input which can be used to reconstruct this genome map. We also discuss the problem of ambiguity introduced by repeats, and introduce the concept of repeat spanning intervals in order to address them. We show that the problem of optimizing over the set of repeat spanning intervals is NP-hard in general, and give an algorithm when the intervals are small. In models without repeated elements, we discuss the problem of optimization by finding a solution that minimizes the distortion in the consecutivity information, by generalizing the concepts of bandwidth and minimum linear arrangement to hypergraphs. We design approximation algorithms for two versions of the latter problem, with an approximation ratio of O (√ logn log logn ) . Finally, we provide details of implementations of some of the methods developed for genome mapping and scaffolding on ancestral genomes. We include results on real data for the genome of the Black Death agent, and for ancestral Anopheles mosquitoes.
Wavelet-multifractal processing of signals

This research develops a new approach in processing multimedia signals (i.e., speech, audio, and images) using wavelets and multifractals. Processing multimedia signals is critical in many modern telecommunication and information systems. Nonstationary behaviours have been the most important characteristics of multimedia signals because they carry signal information. Unfortunately nonstationary parts are difficult to process effectively using traditional tools such as Fourier transforms. In contrast, wavelets and multifractality not only reveal that nonstationary parts are sufficient to represent natural images, but also can be used to reconstruct such signals. The general objectives of this research are to develop the wavelet and multifractal concepts into a new signal-processing framework, to obtain more effective and efficient signal representation. If the objectives can be achieved, the results of the proposed research can be a breakthrough in nonstationary signal processing, as fundamental as the well known Fourier approach in stationary signal processing.
AN EXCHANGE HEURISTIC ALGORITHM FOR PROJECT SCHEDULING WITH LIMITED RESOURCES

In this paper an effective search-type heuristic algorithm for the problems of scheduling activities under resource and precedence constraints is presented. Such problems are typically massive in size and combinatorially explosive. The algorithm to solve these problems consists of two phases (both of which are heuristic). Phase I develops a “good” initial solution. Phase II then employs the solution derived in Phase I as a starting point; attempting to manipulate this schedule so as to reduce the project completion time via suitable reshuffles, or rearrangements of the activities while maintaining feasibility. A random problem generator and a random active schedule generator were prepared and utilized to evaluate the performance of the algorithm.
Rapid invocation and matching of 3D models to 2D images using curvilinear data

Describes a practical approach to match 2D scenes to 3D models in which the scene data is described as a set of curvilinear features extracted from a grey scale image of a rigid object taken from an arbitrary viewpoint, and the model data is derived from a CSG modeller. In contrast to systems that directly acquire depth data, the low and intermediate processing is more reliable and less complex, which can lead to a more effective system using a rapid hypothesis and verification cycle. This may change as research in 3D increasingly concentrates on improving the sensor technology and low-level segmentation algorithms so that surface descriptions become less fragmented and include plausible curved surfaces. >
A Comparative Study on Privacy-PreservingPublic Auditing for Secure Cloud Storage

The Cloud computing is a latest technology which provides various services through internet. The Cloud server allows user to store their data on a cloud without worrying about correctness & integrity of data. Cloud data storage has many advantages over local data storage. User can upload their data on cloud and can access those data anytime anywhere without any additional burden. The User doesn’t have to worry about storage and maintenance of cloud data. But as data is stored at the remote place how users will get the confirmation about stored data. Hence Cloud data storage should have some mechanism which will specify storage correctness and integrity of data stored on a cloud. The major problem of cloud data storage is security. The Log Records stored in log file of an organization may contain sensitive data which should be protected properly for proper working of an organization. Maintaining security of such log records is one of the important tasks. Also, over a long period of time maintaining integrity of such log data is very important. However, deploying such a system for security of log records is an overhead for an organization and also itrequires additional cost. Many researchers have proposed their work or new algorithms for security of log records or to resolve this security problem. This study also reveals about consistency rationing and various adaptive policies. In this work, propose a novel privacy-preserving mechanism that supports public auditing on shared data stored in the cloud. In particular, we exploit ring signatures to compute verification metadata needed to audit the correctness of shared data. With our mechanism, the identity of the signer on each block in shared data is kept private from public verifiers, who are able to efficiently verify shared data integrity without retrieving the entire file. In addition, our mechanism is able to perform multiple auditing tasks simultaneously instead of verifying them one by one. Our experimental results demonstrate the effectiveness and efficiency of our mechanism when auditing shared data integrity.
A Grid Manipulation Algorithm for ALE Calculations in Screw Compressors

A grid manipulation algorithm is presented that allows CFD calculations in complex moving geometries using block-structured grids. An Arbitrary Lagrangian-Eulerian formulation of the ∞ow problem is used. In terms of grid manipulation, this means that grid nodes are moved in-between time steps without changing the grid topology. The focus of the paper lies on the development of the grid manipulator. The block-structured grids are constructed from the solution of the Laplace equation r 2 (') = 0 obtained on an unstructured grid in the same geometry. High quality meshes are constructed from the gradient lines and the potential lines. A validation calculation of compressible ∞ow in a screw compressor is set up with the constructed meshes. This calculation illustrates the applicability of the grid manipulator.
The discovery of structure by multi-stream networks of local processors with contextual guidance

We study multi-stream networks in which feature discovery and associative learning interact cooperatively at the level of the local processors. These processors select and recode the information in their receptive field (RF) inputs that is predictably related to the context within which it occurs. To enable them to do this they are provided with local contextual input in addition to their receptive field input. This input guides both learning and processing to the RF information that is related to the context, but without confounding the information that the processor transmits about the RF. We show that these nets can discover linear functions of their inputs that are predictably related across streams. They can do so whether or not these variables are the most informative within streams, and when there is no evidence within streams as to the existence of these variables. They discover the relevant variables concurrently with, and because of, discovering the predictive relations between them. Two-stage m.
Performance of fast forward link power control for CDMA systems

Fast power control is being considered on the forward link for the third generation CDMA systems. This paper simulates fast power control on the forward link for a 9600 bps data rate and discusses potential capacity gains. Performance of the fast power control scheme for 800 and 1600 Hz power control update rates are given to determine the potential capacity improvements as the update rate is increased. The paper also discusses some of the issues that need to be considered in designing fast power control for the forward link.
Polarization dependence of multipath propagation and high-speed transmission characteristics of indoor millimeter-wave channel at 60 GHz

Measurements of polarization dependence of multipath-propagation characteristics were conducted at 60 GHz in a room within a modern office building. Delay profiles were measured using a swept frequency method with a high time-delay resolution of 2 ns. Directions of arrival of the multipath components reflected from walls were analyzed by rotating a narrow-beam receiving antenna with an angular resolution of 5 degrees. Results of this experiment showed that multipath delayed waves due to wall reflection can be effectively suppressed by employing circular polarization instead of linear polarization. Based on this experimental result, a computer simulation was made to clarify the polarization dependence of the high-speed transmission characteristics of an indoor communications system operating at 60 GHz. >
Investigation on Digital Media Image Processing Algorithm Based on Asynchronous and Inertia Adaptive Particle Swarm Optimization

With the continuous development of computer science and technology, image processing and analysis gradually form the scientific system. Although history of image processing is not long, it attracts many researchers study on it. Digital media image widely exists in many fields, such as education, video, advertisement, and so on. Process digital media image is an important part of image processing. When analyze the digital media image, we want to extract the image part we care from the original image and then method for image segmentation is quite important. That is to say that the image segmentation will divide the image into a number of regions with specific and unique nature. How to keep the original characteristics of the digital media image is quite important in the image segmentation. In this paper, we propose a new algorithm for digital media image segmentation, and it is also can be used in the image processing. The algorithm is based on asynchronous particle swarm optimization algorithm to obtain the adaptive threshold; take the inertia factor into the algorithm, the optimal threshold has been acquired for the image segmentation. Compared with other particle swarm optimization algorithm, the algorithm has the advantages of stable, easy to converge to the optimal solution, and high segmentation speed.
Guidelines for Cryptographic Key Management Status of This Memo This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements. Distribution of this memo is unlimited.

The question often arises of whether a given security system requires some form of automated key management, or whether manual keying is sufficient. This memo provides guidelines for making such decisions. When symmetric cryptographic mechanisms are used in a protocol, the presumption is that automated key management is generally but not always needed. If manual keying is proposed, the burden of proving that automated key management is not required falls to the proposer.