Miracle-dz/UniFAR-FTUs huggingface dataset:
Back Propagation On Warp

We describe two fast back-propagation algorithms for a linear array of processors. Results of the implementation of both algorithms on Warp, a ten processor, programmable systolic array computer, are reviewed and compared with back-propagation implementations on other machines. Our fastest Warp simulator is about 11 times faster at simulating the NETtaik text-to-speech network than the fastest back-propagation simulator previously reported in the literature. This fast simulator on Warp is being used routinely in autonomous navigation experiments, image processing experiments and speech recognition experiments at Carnegie Mellon. Our results indicate that linear systolic array machines can be efficient neural network simulators.
The Emotiv EPOC neuroheadset: an inexpensive method of controlling assistive technologies using facial expressions and thoughts?

Purpose – The EPOC neuroheadset is a commercially available device that allows game players to control a computer using their facial expressions or their thoughts. This paper aims to examine whether it has the potential to be used as an input for assistive technology (AT) devices.Design/methodology/approach – Two experiments were conducted. In the first, 12 non‐impaired subjects used the neuroheadset to control a computer with their facial expressions. They also used a simple system of two head switches for comparison. In the second experiment, three non‐impaired subjects were trained to use the neuroheadset to control a computer with their thoughts.Findings – In the first experiment, the neuroheadset was slower and less accurate than the head switches (p<0.05), and was also harder to use. It is unlikely to be preferred to existing methods of accessing AT for those that retain a small amount of head movement. In the second experiment, by the end of the week, all three subjects achieved accuracy rates grea.
Violent street crime: Making sense of seemingly senseless acts

This paper explores the extent to which street crime can be explained by rational factors associated with the successful commission of the offence or social factors related to street culture. The study is based on qualitative interviews with 55 violent street offenders who were serving sentences for street robbery and assault in six prisons in the UK. The findings identified five main motives for street violence: (1) instrumental motives relating to the specific objectives of the offence (for example, obtaining cash or goods in the case of robbery or inflicting harm in the case of assault), (2) for the buzz and excitement, (3) to express anger, (4) to achieve status and honour, and (5) to inflict informal justice. The implications of the findings are discussed in relation to research and crime prevention.
Traffic Engineering using Multipath Routing Approaches

It is widely recognized that Traffic engineering (TE) mechanisms have to be added to the IP transport functionalities to provide QoS guarantees while ensuring efficient use of network resources. Traffic engineering is a network management technique which routes traffic to where bandwidth is available in the network to achieve QoS agreements between current and future demands and the available network resources. Multi-path routing has been proven to be a more efficient TE mechanism than Shortest Path First (SPF) routing in terms of profit maximization and resource usage optimization. However the identification of set of paths over which traffic is forwarded from source to the destination and the distribution of traffic among these paths are two issues that have been widely addressed by the IP community but remain an open issue for the emerging generation IP networks. Building upon different frameworks, this thesis revisits the issue of multi-path routing to present and evaluate the performance of different traffic splitting mechanisms to achieve QoS routing in Multi-Protocol Label Switching (MPLS) and Wireless Sensor Networks (WSNs). Three main contributions are identified in this thesis. First, we extend an optimization model that used the M/M/1 queueing model on a simple network consisting of a single source-destination pair by using the M/M/s queueing model on a general network consisting of several source-destination pairs. The model solves a multi-path routing problem by defining a Hamiltonian as a function of delay incurred and subjecting this Hamiltonian to Pontryagin’s cost minimization to achieve efficient diffusion of traffic over the available parallel paths. Second, we revisit the problem of cost-based optimization in a multi-path setting by using a Game theoretical framework to propose and evaluate the performance of competitive and cooperative multi-path routing schemes and the impact of the routing metric (cost) on the difference between these two schemes. Finally, building
A neighbor-table-based multipath routing in ad hoc networks

Due to station mobility, the network topology is continuously changing in mobile ad hoc networks. In this paper, we propose a neighbor-table-based multipath routing (NTBMR) protocol to track the dynamic topology changes. Distinguished from prior work on multipath protocols employing disjoint paths, NTBMR does not require the routes to be disjoint. In order to verify the different capabilities against dynamic topology changes for disjoint and non-disjoint multipath routings, we make an attempt to analyze their route reliabilities. Theoretical analysis reveals that non-disjoint multipath routing has higher route reliability when the wireless links are unreliable. In NTBMR scheme, we also present a technique to estimate the mean and variance of the lifetime of a wireless link, which can be used to aid route discovery and maintenance. Simulation results show that our multipath routing scheme is relatively robust in an environment with frequent topology changes and can improve the end-to-end delay and packet delivery ratio performance substantially compared to unipath routing.
Factors Influencing Chinese Authors' Perceptions of Journal Quality: A Comparison Between Two Academic Fields

Abstract Numerous studies published in the academic literature address the issue of journal quality assessment. However, little has been done to compare the factors that influence the perceptions of journal quality in different disciplines. From Chinese authors' viewpoint, this study explored the factors influencing author quality perceptions of journals in computer science and technology as well as in library and information science. Our empirical findings indicate that author-perceived journal quality in these two fields is significantly positively correlated with impact factors and not statistically significantly correlated with technical delay and immediacy index. Slightly different results are also found between the two fields in terms of the effects of editor service, editorial delay and acceptance rates.
Computer-Aided Descriptive Geometry Teaching

Interactive geometry software brings new opportunities and challenges for how to make the teaching and learning process more effective and simultaneously more interesting. However, the majority of computer-aided activities for geometry courses are oriented especially on basic problems of pre-college mathematics curricula. This article concerns the use of dynamic geometry software in teaching high-level geometry courses for students in mechanical, civil, and other engineering programs at the tertiary level.
Investigation of advanced counterrotation blade configuration concepts for high speed turboprop systems. Task 2: Unsteady ducted propfan analysis computer program users manual

The primary objective of this study was the development of a time-dependent three-dimensional Euler/Navier-Stokes aerodynamic analysis to predict unsteady compressible transonic flows about ducted and unducted propfan propulsion systems at angle of attack. The computer codes resulting from this study are referred to as Advanced Ducted Propfan Analysis Codes (ADPAC). This report is intended to serve as a computer program user's manual for the ADPAC developed under Task 2 of NASA Contract NAS3-25270, Unsteady Ducted Propfan Analysis. Aerodynamic calculations were based on a four-stage Runge-Kutta time-marching finite volume solution technique with added numerical dissipation. A time-accurate implicit residual smoothing operator was utilized for unsteady flow predictions. For unducted propfans, a single H-type grid was used to discretize each blade passage of the complete propeller. For ducted propfans, a coupled system of five grid blocks utilizing an embedded C-grid about the cowl leading edge was used to discretize each blade passage. Grid systems were generated by a combined algebraic/elliptic algorithm developed specifically for ducted propfans. Numerical calculations were compared with experimental data for both ducted and unducted propfan flows. The solution scheme demonstrated efficiency and accuracy comparable with other schemes of this class.
Improved Squeeze Algorithm for Saliency Features of Dictionary Learning

Saliency feature is the main interesting feature of the image; we can find the goals and interesting region in the image. We proposed an improved squeeze algorithm for dictionary learning to extract significant features of an image. For the Squeeze algorithm may come into "chain effect", we solve this question by restricting its expansion radius extent dynamically, then using image sparse dictionary learning and the improved algorithm based on scene perceptions to extract the significance. Through a lot of experiments comparing between the K-SVD, Squeeze, Squeeze in [11] and our algorithm, the results show that the suggested algorithm has high robustness, anti-interference ability, and high accuracy detection.
The Research of Face Recognition Based on Kernel Function

The way of kernel function has been widely applied in machine learning field, such as artificial neural network and support vector machine, for avoiding dimensional disaster of feature space and improving performance of learning machine effectively. The selection of kernel function and construction of new kernel are the core problems, which have a direct relation with the performance of classification, and the research of this field is not enough. In this paper support vector machine (SVM) was used as an example, and the performance of common kernel functions was evaluated through observing and computing the features of kernel matrix. Base on this, a new mixed kernel function was gotten by optimization of kernel functions, and the experimental data proved that the performance of SVM was improved by the mixed kernel function. If the weighting coefficient was selected properly, the correct rate could even reach to 100%. What’s more, not only a method to construct a new learning machine was given, but also a reference for selecting kernel function was given.
Design and Performance of an Intel Xeon Phi based Cluster for Reverse Time Migration

In this paper, we design an Intel Xeon Phi based cluster specifically tuned for RTM and compare its performance to our current optimized architecture consisting of Nvidia GPU accelerated nodes. The Xeon Phi nodes are designed to offer a good balance between co-processor computing capabilities, host computing capabilities, local scratch bandwidth and network bandwidth. Performance is evaluated at the system level including wave propagation kernels but also wavefield checkpointing to the local scratch and pre and post-processing steps. Moreover, the kernels are tuned for the Xeon Phi and compared to our GPU optimized kernels taking into account the tuning effort. Overall, the obtained performance is comparable to our GPU-based architecture while offering a better portability since most of the code is identical to the CPU implementation.
Demonstration of software concepts to multiple stakeholders using modular abstract prototyping

This article presents an approach to aggregation of stakeholders' feedback-through-demonstration as of the earliest phase of software development. We demonstrate operational software concepts to a multiplicity of stakeholders, using a novel methodology for modular abstract prototyping (MAP). MAP combines generic and specific modules according to stakeholder focus, i.e. according to their viewpoints, demands, skills and presentation modality. A module captures and demonstrates a specific part or aspect of the functional and behavioural application content. As a result, generic plus specific modules implement the complete demonstration of the software concept as a real-life process. Multiple module configurations can be generated to demonstrate the software concept to the various stakeholder groups in multiple sessions. This article presents the theory and implementation principle of MAP, and illustrates this with an application example on a software tool for smart energy saving. Focus group assessments confirmed a significantly improved convergence among stakeholders and developers at the early stages of development. However, the current MAP is still labour intensive and further automation is desirable. Considering today's pervasive and intense conceptual design and product innovation processes dynamics, MAP is to become a first step towards fully interactive modifiable medium-fidelity abstract prototyping.
A NEW LOOK AT FORMULATING HYPOTHESES ITEMS

In the past, the GRE Board supported research on an item type that measures higher-level cognitive abilities and that uses a free-response format–the Formulating Hypotheses (FH) item type. Further research was not recommended because of issues associated with the cost and feasibility of the operational use of a test composed of FH items. This project focused on the two major issues that need to be addressed in considering FH items for operational use: (1) the costs of scoring, and (2) rather than the conventional number-right scoring, the assignment of scores along a range of values. The first issue was addressed directly by seeking ways to increase the efficiency of scoring through computerized delivery and scoring. The second issue was addressed both directly and indirectly by recommending specific procedures for the computer recognition of responses and problem delivery that will be sufficiently reliable and well-rationalized to be acceptable to reasonable evaluators. This project involved collaboration with experts who are closely involved in confronting the issues involved in the computer recognition and evaluation of open-ended responses. After a series of analyses to explore the design and scoring of FH-type items for computer delivery, we arrived at specific recommendations for developing a system to deliver computerized problems of the FH type. When developed, the prototype also will serve as a computerized research tool to conduct further investigations of potential variations in these types of items.
Difference-Based Partial Reconfiguration

www.xilinx. com 1 © 2003–2007 Xilinx, Inc. All rights reserved. XILINX, the Xilinx logo, and other designated brands included herein are trademarks of Xilinx, Inc. All other trademarks are the property of their respective owners. Summary An important feature in the VirtexTM architectures is the ability to reconfigure a portion of the FPGA while the remainder of the design is still operational. Partial reconfiguration is useful for applications that require the flexibility to change portions of a design without having to completely reconfigure the entire device. With this capability, entirely new application areas become possible:
Destination-controlled routing with resource reservation

This paper proposes a framework for routing and resource reservation in ATM networks, where call admission control (CAC), resource reservation and routing interweave together. A Forward-Routing and Backward-Setup process (FRBS) scheme is proposed. FRBS has two stages, a forward routing stage and a backward setup stage. During the forward stage, routing information on all paths from source to destination are forwarded through setup messages to the destination using a controlled flooding approach. Setup messages include CAC information on all links within the traversed path. The destination node collects information on all possible paths in its routing table. The destination then makes a selection of the path with the best cost value, and reservation is attempted along this path backwards towards the source. This represents the backward setup stage, which includes reserving resources along the selected path such that the CAC criteria are met. Various simulation experiments were conducted under different traffic characteristics and network parameters. Results indicate that the FRBS scheme possesses a number of performance advantages in terms of accuracy of routing decisions and call blocking probabilites.
Throughput enhancement of a slotted DS-CDMA ALOHA with packet combining

An adaptive time-diversity automatic repeat request scheme is investigated for a slotted DS-CDMA wireless data network over frequency selective Rayleigh fading channels. In the proposed technique, the receiver retains and processes all the retransmissions of a single data block using postdetection diversity combining rather than simply discarding the noisy packets. It is shown that packet combining is an effective mechanism for enhancing the network throughput and delay performance of a conventional DS-CDMA ALOHA, while sustaining a reasonable receiver complexity. This scheme is highly advantageous for systems which can tolerate a certain delay and operate over highly time-varying channels. We also examine the effects of forward error correction (FEC) coding and multipath intensity profile on channel utilization efficiency.
Multimodal Medical Image Fusion using Neighbouring Pixel Selection

Medical data analysis from different medical image sensor has been increased in medical field. The image fusion techniques which are the efficient way of adding and improving medical imaging information have drawn increasing concentration from the medical society. In this paper, we proposed a new scheme of Neighbouring Pixel Selection (NPS) fusion rule for laplacian pyramidal multiscale decomposition-based fusion of medical images considering the consistency verification of both intrascale and interscale parameters. A combining set of coefficients from the Multiscale Representations (MSR) of the source images is computed by utilization of neighborhood information. An efficient fusion scheme is also proposed for different modalities. Experimental results show that proposed method produces better results than the existing methods.
Modeling and Solving Product Configuration Problems Using Petri Net

This Product configuration is a key enabling technology for implementing mass customization production. In this paper, we present an approach for modeling product configuration problems using Petri Net, a well-defined formalism for describing complex discrete systems. In the presented approach, components within a configurable product are modeled as places of PN whereas structural relationships between components are represented as transitions of PN. Configuration rules such as inclusion and exclusion rules are also described through the elements of PN. By modeling product configuration as a PN, a configuration solution is a set of transitions leading from the initial state of PN to a final state of PN. Therefore, the configuration problem can be solved by analyzing corresponding PN representation.
8.3.3 Different Levels of Centralized Engineering Database Strategies for Integrated Development

The development of large and complex products is currently carried out in small, separate teams of engineers trained in diverse disciplines. Mechanical and electrical engineers are involved in the development of high‐tech and embedded systems as well as software designers. This diversity of disciplines interferes with the efficiency of communication, which is usually carried out in (informal) discussions and by passing documents and models.
A Probabilistic Cache Sharing Mechanism for Chip Multiprocessors

Capacity sharing is efficient for private L2 caches to utilize cache resources in chip multiprocessors. We propose a probabilistic sharing mechanism using reuse replacement strategy. This mechanism adopts decoupled tag and data arrays, and partitions the data arrays into private and shared regions. Probability is introduced to control the capability of each core to compete shared data resources. We assign high probabilities to cores with stress memory demands and dynamically adjust these probabilities corresponding to the monitored run-time memory demands. Simulation results of PARSEC benchmarks show that our mechanism exceeds conventional LRU managed private cache. Compared with reuse replacement managed private cache without sharing among cores, our mechanism achieves an average L2 miss rate reduction of 8.70%.
5.8 GHz DSRC packet communication system for ITS services

In this paper, we introduce a 5.8 GHz DSRC (dedicated short range communication) packet communication system which has been developed by ETRI. 5.8 GHz DSRC packet communication systems are under deveolpment worldwide and it will be widely applied to ITS (intelligent transportation system) services. We discuss the basic requirements of the DSRC communication system and system design specification to meet the requirements with regard to the physical layer, MAC (media acces control) layer, LLC (logical link layer) layer and application layer. DSRC packet communication systems consist of a micro-processor block, baseband packet modem block and an RF block. The microprocessor block handles MAC and application SW, the baseband packet modem transmits data up to 2.048 Mbps and recovers the received data from the RF block. The RF block has a function for ASK modulation and demodulation. We describe packet frame architecture and packet communication procedures for link setup and normal communication.
Distributed Borrowing Addressing Scheme for ZigBee/IEEE 802.15.4 Wireless Sensor Networks

This paper proposes a distributed borrowing addressing (DIBA) scheme to solve problems of failure in address assignments resulting from limited tree depth and width when the distributed address assignment mechanism is used in a ZigBee/IEEE 802.15. 4 wireless sensor network. DIBA is a method of borrowing addresses from neighbor nodes for newly entering nodes and assigning the borrowed addresses. Its network or sensing coverage can increase with almost the same overhead as the existing method. DIBA is a simple and lightweight means of addressing and routing, making it suitable for wireless sensor networks. Simulations showed that DIBA is a distributed addressing scheme with consistently excellent performance.
Concepts and Techniques for Computer—Integrated Automation in the Clinical Laboratory

Our machine card-processing system utilises mark-sense punch cards and five standard cardprocessing machines. As the prime medium of man-to-machine communication we chose the mark-sense card, and it has been used successfully by hundreds of physicians and ward personnel in marking test requests and by our laboratory staff in marking test results. In contrast to the key punch which requires a trained operator punching cards consecutively at typewriter speeds (and which we use for limited amounts of data entry) the mark-sense cards permit large volume data entry by many persons NATIONAL MEETING Held in London, May, 1965.