Miracle-dz/UniFAR-FTUs huggingface dataset:
A modified Hopfield network for two-dimensional module placement

The problem of two-dimensional module placement is solved using a Hopfield network with the objective of minimizing total wire-length. The network is modified to include quartic terms in its energy functional by making the interconnection matrix dependent on the state of the network. This modification decomposes the two-dimensional problem into two coupled one-dimensional problems. A hierarchical approach based on min-cut placement is used to make the network size grow linearly with the number of modules. Computer simulations of the network show that it is capable of finding good solutions that are competitive with well-known heuristic algorithms, particularly when a probabilistic update rule is used for the neurons to avoid local minima. The network can be easily modified to accommodate hard placement of nodules, unequal module sizes, and the constraints of I/O (input/output) pad connections. <<ETX>>
Teaching Human Factors to Graduate and Undergraduate Computer Science Students

Human factors (HF) is not a subject traditionally taught in the Computer Science (CS) curriculum. The traditional CS curriculum focuses on the computer (the machine) and the programs for the machine. Because the faculty was not introduced to HF in their education, studying users has no role in their discipline. Undergraduate CS students are more receptive to new ideas and consequently do not define their discipline as rigidly. Nevertheless, they typically chose to study CS because of their interest in the technology and the machines. Another challenge to introducing HF to the CS curriculum is that there is no space in the program for another course. Human-Computer Interaction (HCI) is an existing course in most CS curricula that can be leveraged to expose CS undergraduates to HF concepts. The traditional HCI course focused primarily on the technology and implementation of graphical user interfaces. Only recently has design, specifically user centered design, been taught in CS HCI courses. This paper describes combining undergraduate and graduate HCI courses that expose CS students to HF. Students in the undergraduate HCI course design and implements group projects, consisting of smart phone applications (apps), and the graduate students evaluate and test the apps. The challenges of introducing HF to CS students and principles for overcoming them are explained, along with the interactions between the undergraduate and graduate students.
Comparative study on 3D optical network-on-chip architectures

Network-on-chip (NoC) has been proposed to overcome the bottlenecks that on-chip communication faced due to the increase of chip complexity. However, limitations such as long delay and high power consumption make traditional NoC using electronic interconnects be inefficient for future use. A new design concept based on optical interconnects, Optical NoC, which can provide low latency, high bandwidth and lower power dissipation, is a promising solution for future on-chip interconnection. In this paper, we will investigate three different 3D Mesh-based ONoC topologies and compare them in terms of End-to-end delay (ETE delay) and network throughput under varying injection rates. The simulation result shows that 3D Partially-connected Optical-crossbar Mesh can achieve smaller network latency and throughput than other three Mesh based architectures.
High level estimation of the area and power consumption of on-chip interconnects

This paper addresses the problem of estimating the power and area consumption of on-chip interconnects for standard cell ASIC processes. We introduce a set of analytic investigations on buses, crossbar switches, and multiplexors. Furthermore, we prove the accuracy of the results by comparing them with gate-level power-estimations on a double metal 0.6 /spl mu/m CMOS technology.
Detection of buried mines and explosive objects using dual-band thermal imagery

We demonstrate the development and use of novel image processing methods to combine dual-band (MWIR and LWIR) images from SELEX GALILEO's Condor II camera to extract characteristics of observed scenes comprising buried mines and explosive objects. We discuss the development of a statistical processing technique to extract the different characteristics of the two bands. We further present a statistical classifier used to detect targets on independently trained images with a high detection probability and low false negative rates and discuss methods to mitigate the impact of false positives through the selective processing of image regions and the contextual interpretation of the scene content.
Levenberg-Marquardt method for ANFIS learning

Presents the results of applying the Levenberg-Marquardt method (K. Levenberg, 1944, and D.W. Marquardt, 1963), which is a popular nonlinear least-squares method, to the ANFIS (Adaptive Neuro-Fuzzy Inference System) architecture proposed by Jang (IEEE Trans. on Systems, Man and Cybernctics, vol. 23, no. 3, pp 665-685, May 1993). Through empirical studies, we discuss the strengths and weaknesses of using such an efficient nonlinear regression technique for neuro-fuzzy modeling, and explain the tradeoffs between mapping precision and membership function interpretability.
Block matching algorithm using a genetic algorithm

In this paper, we propose a block matching algorithm (BMA) using a genetic algorithm. The genetic algorithm was inspired by an information processing scheme which is used by nature. To use the genetic algorithm in 2D block matching, we encode, based on a quad-tree structure, the phenotype representing a motion vector, i.e., the genotype is represented by four symbol strings. The probability of mutation is differently set for each position in a symbol string. Computer simulation results show that we can have the peak signal to noise ratio (PSNR) of the proposed genetic-based BMA comparable to that of the three step search (TSS) or full search (FS) by varying the number of search points.
Active suspension using preview information and model predictive control

The objective of a suspension system is to maximize the passenger ride comfort and vehicle road holding quality. Passive systems present a trade-off between these objectives and the required suspension travel. An appropriate active suspension control overcomes this tradeoff and provides maximum ride comfort and road holding quality within the available suspension travel. In this paper, we show model predictive control (MPC) to be a design of choice for control of active suspension systems utilizing previewed road information. MPC design explicitly incorporates all hard constraints on state, control and output variables. It generalizes the approaches based on feedback linearization and dynamic inversion from single step control to multiple step control over a receding prediction horizon. MPC is shown to provide excellent improvements in the ride and road handling qualities of the vehicle over realistic terrain profiles. MPC works well even in the presence of noise in the previewed information. Implementation of MPC on the UCB active suspension test rig also shows the feasibility of the MPC algorithm in real-time application.
A Kind of Hierarchical K-Means Web Log Clustering Algorithm

Clustering techniques are often used in Web log mining to analyze user’s interest on the web pages. Based on the analysis of advantages and disadvantages of the application of classic clustering algorithm in Web log data mining, the paper brought out a kind of hierarchical K-means Web log clustering algorithm, which integrated K-means clustering algorithm and cohesion-based hierarchical clustering algorithm and overcame shortcoming of high time complexity of hierarchical clustering algorithm. The clustering effect of the algorithm is better than K-means clustering and fit for clustering process of large amount data. The result analysis of practical Web log data clustering also proves the validity of the algorithm.
SeisAn Earthquake Analysis Software

In seismology, a wealth of data-processing programs are available, and a seismic observatory typically makes use of several. A common problem is the lack of a proper database structure which prevents effective use of the data, particularly with data from different sources. A primary goal of SeisAn is to organize data from all kinds of seismic stations into a simple database and to provide most of the tools needed for routine processing. The SeisAn database is a way of organizing data by using the directory and file structure, and is not a relational data system with general access techniques such as SQL, which usually is meant by the term “database. ” In addition, the intention is to facilitate research tasks by integrating additional programs to work directly on the database. A second goal is that SeisAn must work in an identical manner under Sun (Solaris-1 and -2), Linux, and MS-Windows, and.
A pinwheel packet scheduling scheme for broadband wireless networks

Abstract A frame‐based packet scheduling scheme, the pinwheel scheduling (PWS) scheme, is proposed and investigated at the medium access control (MAC) layer in broadband wireless networks. The objective of the proposed scheduling scheme is to provide low delay and low jitter for real‐time traffic. We have demonstrated in this paper that the proposed PWS scheme not only satisfies the packet‐level QoS requirements but also has low implementation cost. The PWS scheme gives the highest priority to CBR connections in a service cycle to minimize their delay and jitter. For ABR traffic, a number of slots are allocated to fit their MCR. The remaining time slots are then allocated to VBR traffic according to their PCR. Thus, the VBR traffic may suffer large delay and jitter when the number of CBR connections increases. The PWS with modular strategy (PWS/MS) is proposed to improve the performance of the VBR traffic. We also introduce three different slot‐reuse strategies named real‐time traffic first (RTF), non‐real‐time traffic first (NRTF) and longest queue first (LQF), respectively, to improve resource utilization. In order to demonstrate the performance of the PWS and PWS/MS schemes, comparisons are made with existing schemes such as the round‐robin (RR) and weighted‐round‐robin (WRR) by using OPNET software. Simulation results show that the proposed schemes are capable of maintaining the lowest delay and jitter for VBR and CBR traffic while not sacrificing the available bit rate (ABR) traffic.
A two-stage registration algorithm for oil spill aerial image by invariants-based similarity and improved ICP

Image registration is a crucial progress in detecting oil spilled on the sea and is also important for estimating the volume of the oil spill, especially when one image cannot cover the entire polluted region. In this article, a new algorithm is proposed to register geometrically distorted aerial images of oil spill accurately and automatically. There are two stages in this algorithm: coarse registration and fine registration. Invariants-based similarity and relative space distance are applied to coarse matching. Then improved iterative closest point (ICP) algorithm is used for registering images finely, which is the combination of ICP and a method of solving assignment problem to deal with mismatches. The performance of the proposed algorithm is evaluated by registering oil spill ultraviolet (UV) and infrared (IR) images, respectively. Compared with traditional ICP and other algorithms, the efficiency and accuracy of the proposed algorithm are highly improved.
Solving N Queen Problem using Genetic Algorithm

paper, explain solution to find the 92 solution of n- Queen problem based on GA (Genetic Algorithm). The n- Queen problem become a Widespread platform for the AI researcher for implement their intelligence algorithms and try them. The Genetic algorithm used to solve the problem and each chromosome is be a solution for the problem and depending on the steps of the GA, The 92 solution, all possible solution for 8 Queen problem is founded. The represent of each chromosome have been by using one dimension array with size equal 8 contain only the queens which represent a one solution and the empty location are aborted to reduce the searching time.
Enhancements on the Convex Programming Based Powered Descent Guidance Algorithm for Mars Landing

In this paper, we present enhancements on the powered descent guidance algorithm developed for Mars pinpoint landing. The guidance algorithm solves the powered descent minimum fuel trajectory optimization problem via a direct numerical method. Our main contribution is to formulate the trajectory optimization problem, which has nonconvex control constraints, as a finite dimensional convex optimization problem, specifically as a finite dimensional second order cone programming (SOCP) problem. SOCP is a subclass of convex programming, and there are efficient SOCP solvers with deterministic convergence properties. Hence, the resulting guidance algorithm can potentially be implemented onboard a spacecraft for real-time applications. Particularly, this paper discusses the algorithmic improvements obtained by: (i) Using an efficient approach to choose the optimal time-of-flight; (ii) Using a computationally inexpensive way to detect the feasibility/ infeasibility of the problem due to the thrust-to-weight constraint; (iii) Incorporating the rotation rate of the planet into the problem formulation; (iv) Developing additional constraints on the position and velocity to guarantee no-subsurface flight between the time samples of the temporal discretization; (v) Developing a fuel-limited targeting algorithm; (vi) Initial result on developing an onboard table lookup method to obtain almost fuel optimal solutions in real-time.
cis‐Dichloro­(di‐tert‐butyl­phosphine‐κP)(triphenyl­phosphine‐κP)platinum(II) tetra­hydro­furan hemisolvate

The title compound, [PtCl2(C8H19P)(C18H15P)]·0.5C4H8O, was obtained in the reaction of bis­(triphenyl­phosphine)­platinum(II) chloride with 1,1,3,3-tetra-tert-butyl-2-trimethyl­silyltriphosphine. The 31P{1H} NMR spectrum of the reaction mixture shows the formation of the title compound together with a significant amount of triphenyl­phosphine and 1,1,3,3-tetra-tert-butyl­triphosphine.
Limb volume determination by means of ultrasound

An ultrasonic method and device have been developed and evaluated for 3-D mapping of irregular surfaces. The device is used for limb volume determination, which is needed in the evaluation of physiological blood volume changes during manned space operations. Volume is calculated from several limb cross-sectional areas of known distances. First experiments on earth simulating physiological effects of microgravity have demonstrated clearly the system's ability to measure limb volume and volume changes. The axial resolution in distance measurement is approximately 0.4 mm. Absolute accuracy in cross-sectional area estimate is better than 0.5%. The time needed to measure one plane is about 10 s and a limb segment is scanned in about one min (4 planes). <<ETX>>
Automated synthesis of Dadda multipliers

Although Dadda multipliers offer the greatest speed potential with a delay proportional to log(n), they are not often used in everyday designs because of their irregular structure and the ensuing difficulty this entails in their implementation. This paper presents a program which automatically generates HDL code describing a Dadda multiplier of specified size. The resulting HDL code is then synthesized to a generic library in the TSMC13G process (0.13um). It is observed that delay increases only marginally when increasing the multiplier size from 16 to 64 bits, while total area increases drastically.
A Video Coding Algorithm Based on Improved Wavelet Coefficients Block

3D-SPIHT algorithm extends 2D-DWT to 3D-DWT and encodes the subsequent coefficients, which is a research hotspot in very low bit rate coding and data compression. This paper reorganizes the 3D-SPIHT coefficients with block structure, and puts forward the 3D-BSPIHT algorithm which can represent an insignificant block which contains four wavelet coefficients with one bit in order to improve the compression efficiency. This algorithm increases average PSNR by 0.2dB at most in comparison with 3D-SPIHT algorithm and decreases the computational complexity especially at low bit rate.
A two-user approximation-based transmit beamforming for physical-layer multicasting in mobile cellular downlink systems

Multicast has been known as an efficient transmission technique for group-oriented applications such as multi-party video conferencing, video streaming for paid users, online gaming, and social networking. In this paper, we investigate physical-layer multicasting in mobile cellular downlink systems, where the antennas at base station are employed to transmit common signals to multiple users simultaneously. A central design problem of downlink physical-layer multicasting is the search for the optimal beamforming vector that maximizes the multicast rate. Traditionally, the problem has been formulated as a quadratically constrained quadratic programming problem and shown to be NP-hard in general. In this paper, starting from examining the Karush–Kuhn–Tucker stationary conditions, a new method based on two-user approximation is proposed for the search for the optimal beamforming vector. The method is able to achieve a much higher multicast rate than the existing methods and provides an attractive trade-off between performance and complexity, especially for the case of using a large number of antennas. Using a large number of antennas at base station, also known as the large-scale multiple-input and multiple-output technique, has been regarded widely as one of the most promising technologies to increase system capacity, coverage, and user throughput for future generations of mobile cellular systems.
On Data Security and Encryption Algorithms in Cloud Environment

As information and processes are migrating to the cloud, Cloud Computing is drastically changing IT professionals’ working environment. Cloud Computing solves many problems of conventional computing. However, the new technology has also created new challenges such as data security, data ownership and trans-code data storage. We discussed about Cloud computing security issues, mechanism, challenges that Cloud service providers and consumers face during Cloud engineering. Based on concerning of security issues and challenges, we proposed several encryption algorithms to make cloud data secure and invulnerable. We made comparisons among DES, AES, RSA and ECC algorithms to find combinatorial optimization solutions, which fit Cloud environment well for making cloud data secure and not to be hacked by attackers.
Interpretation and musical signification in acousmatic listening

Abstract The challenges of understanding musical meaning are considered in light of ways in which electroacoustic practice and acousmatic listening might embody yet further nuances in how music can function as a signifying system. ‘Classical’ semiotics is discussed, as well as more recent developments with post-structuralist approaches and musical semantics in other areas of music scholarship. The idea, inherited from the tradition of ‘absolute music’, that musical meaning lies exclusively in the inner operations of the musical materials and their structural organisation, is questioned. Concepts from ecologically inspired music psychology are drawn upon to highlight the importance of interpretation, as well as perception, in acousmatic listening. It is argued that if new theoretical terminologies are needed, an invaluable project would be to develop a taxonomy (and thus theoretical framework) of how sound can ‘stand for something’, i.e. function as a sign in semiotic terms. It is also argued that such terminology should not reinforce distinctions between intra- and extra-musical that feature in many theoretical constructs used in relation to this music. Consideration of the Peircean semiotic model in electroacoustic music (as well as the more widely used Saussurean one), tropology in the study of literature, and a much more widely comparative and culturally explicit approach to analysis are suggested as practical starting points. A more critical approach to the integral role of sound recording and reproduction in relation to concepts of representation is needed.
Order Independent Transparency with Dual Depth Peeling

Rendering semi-transparent surfaces correctly using the alpha blending equation requires sorting fragments from front to back or back to front. Depth peeling is a robust solution to the fragment sorting problem which renders the transparent objects multiple times, peeling one layer of fragments every time. We introduce dual depth peeling, an extension of depth peeling based on a min-max depth buffer which peels two layers at a time, one layer from the front and one from the back. Alpha blending is interleaved with dual depth peeling, using different blend equations for front peeling and back peeling. The algorithm guarantees that no fragments can be blended twice. We implement our min-max depth buffer using 32-bit floating-point blending, which is fast on GeForce 8. We also describe a sort-independent method which replaces the RGBA color in the alpha blending equation by the per-pixel weighted average over the pixel, using alpha values as weights. This approximate method can render plausible order independent transparency with a single geometry pass.
Lip animation based on observed 3D speech dynamics

We are all experts in the perception and interpretation of faces and their dynamics. This makes facial animation a particularly demanding area of graphics. Increasingly, computer vision is brought to bear and 3D models and their motions are learned from observations. The paper subscribes to this strand for the 3D modeling of human speech. The approach follows a kind of bootstrap procedure. First, 3D shape statistics are learned from faces with a few markers. A 3D reconstruction of a speaking face is produced for each video frame. A topological mask of the lower half of the face is fitted to the motion. The 3D shape statistics are extracted and principal components analysis reduces the dimension of the maskspace. The final speech tracker can work without markers, as it is only allowed to roam this constrained space of masks. Upon the representation of the different visemes in this space, speech or text can be used as input for animation.
DASH--distributed analysis system hierarchy

We have developed and are operating an object-oriented data reduction and data analysis system, DASH ( Distributed Analysis Software Hierarchy ), for efficient data processing for SUBARU telescope. In DASH, all information for reducing a set of data is packed into an abstracted object, named as ``Hierarchy''. It contains rules how to search calibration data, reduction procedure to the final result, and also the reduction log. With Hierarchy, DASH works as an automated reduction pipeline platform cooperated with STARS (Subaru Telescope ARchive System). DASH is implemented on CORBA and Java technology. The portability of these technology enables us to make a subset of the system for a small stand-alone system, SASH. SASH is compatible with DASH and one can continuously reduce and analyze data between DASH and SASH.