Miracle-dz/UniFAR-FTUs huggingface dataset:
Structured design of a 288-tap FIR filter by optimized partial product tree compression

A compact 10-bit, 288-tap FIR filter is designed by adopting structured architecture which employs optimized partial product tree compression method. The new architecture is based on the addition of equally weighted partial products which result from 288 multiplications of the filter coefficients and the inputs. The 288 multiplication and 287 addition operations are decomposed to add 1440 partial products to meet the tight timing requirement. Optimized parallel compression schemes such as 4:2 and 5:5:2 compressors are used to perform decomposed partial product addition. The completed 288-tap FIR filter occupies 7/spl times/9 mm/sup 2/ of silicon area which consists of 385754 transistors in 0.6 /spl mu/m triple-metal CMOS technology.
Firing particle flow detection and tracking in sequence images

A method of detecting and tracking firing particle flow in sequence images is proposed in this paper. The features of the firing particle flow in sequence images are analyzed and described using a fuzzy linguistic variable that is used to detect the moving objects. Moving trajectory tracking of firing particle flow is accomplished adaptively also. This method is feasible and satisfied with experiment results.
Automatic Summarization as a Combinatorial Optimization Problem

We derived the oracle summary with the highest ROUGE score that can be achieved by integrating sentence extraction with sentence compression from the reference abstract. The analysis results of the oracle revealed that summarization systems have to assign an appropriate compression rate for each sentence in the document. In accordance with this observation, this paper proposes a summarization method as a combinatorial optimization: selecting the set of sentences that maximize the sum of the sentence scores from the pool which consists of the sentences with various compression rates, subject to length constrains. The score of the sentence is defined by its compression rate, content words and positional information. The parameters for the compression rates and positional information are optimized by minimizing the loss between score of oracles and that of candidates. The results obtained from TSC-2 corpus showed that our method outperformed the previous systems with statistical significance.
Late data choice with the Linux TCP/IP stack

The amount of time critical data sent on the Internet is increasing. As a result, the networks are in danger of getting congested. When sending time critical data on congested networks, we risk that the data may get too old in buffers, and are to no use when it arrives at its destination. For example, a late video frame in a video session or a late position update in games. To prevent delivery of outdated data, we want to discover and discard outdated network traffic as early as possible. A mechanism to accomplish this is late data choice (LDC). With LDC we address the problem at the source by taking control of our own sending buffer. This thesis explores the possibility to support LDC in TCP in the Linux network architecture. There is no LDC support in the TCP implementation in Linux today. Therefore, an implementation of LDC support for TCP was made and evaluated. When testing, we found that with LDC support in TCP we can deliver relevant data and drop data we no longer want to or can send. This makes the utilization of resources much better, as we do not waste them on useless data. Thus, we can say that LDC support in TCP reduces the perceived latency for the receiver, and increases useful throughput.
It Takes a Village to Raise an Information Technology Project: Suggestions on Collaboration From Our 10-Community-College Consortium

This article describes the collaborative evolution of the Midwest Center for Information Technology (MCIT)—which is a consortium of 10 different community colleges across the four states of Nebraska, Iowa, North Dakota, and South Dakota—that was established to improve information technology (IT) education across the region. MCIT has been funded as a Regional Center by the National Science Foundation in three different grants from the Advanced Technological Education program (ATE) due to its successful collaborative model, alignment with research and best practices, focused regional interventions, and data driven decision-making. The fiscal agent for the consortium is unique. It is not one of the community colleges, but rather it is the Applied Information Management Institute (AIM), a business driven nonprofit focused on IT improvement in the midwestern region. The MCIT model, thus, builds a close partnership with local IT businesses and the IT programs in the 10 participating community colleges. This article describes the MCIT model for collaboration, the joint activities undertaken by the 10 colleges and AIM and the results to date of these shared institutional efforts. This article also discusses challenges associated with such a large-scale collaborative effort, and it provides suggestions for collaborative practice for other community colleges seeking to work together in larger consortiums.
Chaos-based BPSK communication system

A novel broadband chaos-based coherent binary phase shift keying (BPSK) communication system is proposed and it is demonstrated that its theoretical probability of error expression matches that of a conventional narrowband BPSK system. The result is confirmed with the corresponding empirical bit error rate (BER) simulation. Most importantly, it is shown that the proposed system outperforms the chaotic communication systems in terms of BER while also being more practicable. The proposed system thus holds high promise as the chaotic communication systems pose implementation difficulties, lack robust synchronisation techniques and are generally considered of academic interest only.
On cost-effective analysis of disk layout schemes for continuous media servers under bounded initial delay

Disk layout schemes and retrieval strategies can play important roles on designing a high performance disk-based continuous media (CM) server. Previous studies on evaluating storage system for CM servers merely investigated the tradeoff between the number of supported users and buffer requirement. However, an important QoS parameter, the initial delay for a new require, is almost neglected while deciding the disk configuration. In this paper, a cost function under the bounded initial delays is presented to evaluate the efficiency disk layout and retrieval strategies. Therefore, cost-effective disk configuration for different types of CM services with variant initial delay bounds can be easily obtained.
Experiments in lossless and virtually lossless image-compression algorithms

The CB9 lossless image compression algorithm is context-based, and codes prediction errors with an adaptive arithmetic code. It has been developed within an algorithm class that includes (in the order of their development) Sunset, JPEG lossless, sub8xb, and now CaTH (Centering and Tail Handling). Lossless compression algorithms using prediction errors are easily modified to introduce a small loss through quantization so that the absolute error for any pixel location does not exceed prescribed value N. In this case, N varies from 1 to 7; the values for which the JPEG group issued a call for contributions. This work describes CB9 and the experiments with near-lossless compression using the JPEG test images. Included are experiments with some image processing operations such as edge-enhancement with the purpose of studying the loss in fidelity from successively performing decompression, followed by an image processing operation, followed by recompression of the new result.
Producing fire retardant cotton fabric using chicken eggshell

Cotton has poor fire retardance characteristics. As a result, the textile material is not recommended in areas of fire risks though it has high comfort factor that make preferable for wearing purpose; therefore, imparting fire retardance is must to cotton. This research focuses on producing fire retardant cotton fabric using chicken eggshell to replace synthetic fire-retardant chemicals. Chicken eggshell contains fire-retardant mineral such as calcium carbonate, phosphorous, nitrous, potassium and zinc. Imparting fire retardance using synthetic chemicals has many limitations; toxicity, environmental hazards, non-biodegradable, non-renewable source and cost. On the other side chicken eggshell being bio-product has not any side effects since it occurs in nature abundantly. In most cases the chicken eggshell is removed after usage or hatching causing a big environmental pollution in appearance as well as in odour. Conversion of such wastes to treasure has a dual benefit in preventing cotton from burning extension and using the eggshell wastes for valuable treatment process. Treated fabric using chicken eggshell showed low flammability than untreated. In addition, the treated fabric formed ash and char, whereas untreated fabric produced only ash and got totally burn. The fire propagations were 40 and 1.4 mm per second for untreated and treated fabrics respectively.
Control of nonlinear system with input saturation based on Gaussian potential function network

The authors present a novel approach to the neural-network-based control of a nonlinear system, or in particular for the neural-network-based regulation of a nonlinear system subject to input saturation. This approach is based on (1) the training of a Gaussian potential function network (GPFN) to model nonlinear system dynamics based on the hierarchically self-organizing learning (HSOL) algorithm, and (2) the planning of a path from the initial state to the goal state which ensures the state reachability under input saturation and the satisfaction of performance criteria. Path planning is done in the regulatable region associated with the feasible state transition region based on a potential field method. The advantage of using GPFN with HSOL compared to backpropagation networks is due to the capability of HSOL to recruit a required number of Gaussian hidden units automatically and incrementally by monitoring network performance. This makes it possible to overcome the structural limitations of a network and also the local minima problem in learning. <<ETX>>
Incremental netlist compilation for IKOS hardware logic simulator

Incremental compilation is desirable to avoid recompiling a large network when only a few modules are modified. An algorithm that partitions a network in a hierarchical manner is described. The linker links together separately compiled or linked modules to generate machine codes for the IKOS hardware simulator. The machine codes generated for the duplicate subnetworks (or logic blocks) need not be reproduced and can be loaded to the simulator for the times of occurrences by adjusting for the base offsets. <<ETX>>
Grazing Zero [Microwave Bytes]

One of the major decisions facing any long-time IEEE Member has finally come my way recently, whether to keep ones voluminous collections of journals. It's a call made even tougher by the general state of mind when packing up to move house, two dozen more boxes to find and fill, each weighing enough to challenge the rigidity of the available containers. Well, I actually managed to suppress the voices (both internal and external) who were screaming “dump,” but only in the case of the MTT transactions, which in my collection stretch back to 1981. Personally, I still like looking up MTT references in my own library, mainly because so often as I fl ick through the musty pages I find one or two other papers of interest; sometimes even greater interest than the one I was originally seeking.
Efficient dynamic routing in wide-area networks

The tremendous growth of the global Internet has given rise to a variety of applications that require quality-of-service (QoS) beyond what is provided by the current best-effort IP packet delivery service. In addition, traditional static shortest-path routing offers little flexibility in managing the distribution of traffic in the network. Dynamic or QoS routing protocols offer the advantage of choosing paths that meet application QoS requirements and balance the load in the network. These benefits come at the cost, however, of additional consumption of computational and bandwidth resources at levels higher than conventional routing protocols. More specifically, dynamic routing performs poorly when the network state used to compute paths is out-of-date, requiring that network information be distributed very frequently to achieve good results. This dissertation undertakes a detailed study of dynamic and QoS routing with a focus on understanding and controlling the performance-overhead trade-offs inherent in these protocols. We develop a practically motivated model that clearly formulates dynamic routing in terms of a set of route computation algorithms, routing and update policies, and network and traffic configurations. The model is implemented in a custom-designed simulation environment that allows experimentation with a wide variety of configurations. We use the model and simulation environment to perform in-depth experiments that uncover the influences of a variety of policy and configuration parameters on the performance and resulting overheads. In particular, the evaluation focuses on the effects of out-of-date information about network state on routing performance. A significant contribution of this effort is a set of specific guidelines and observations that assist service providers in configuring the network and setting policies for dynamic or QoS routing. With the insights collected from the evaluation effort, the dissertation develops novel algorithms for reducing the computational overheads of QoS routing. These mechanisms allow precomputed QoS routes to efficiently capitalize on the latest state information available. As a result, precomputation is able to offer performance competitive with the much more costly on-demand computation policy. Finally, the dissertation introduces hybrid routing, a new routing scheme for IP networks that limits dynamic routing to a subset of the network traffic. By dynamically routing only long-lived flows, hybrid routing is able to improve the stability and efficiency of load-sensitive routing while also providing automated load-balancing capability that reacts to fluctuations in network traffic.
Multi-Cipher Single Message Encryption Algorithm

Different types of data are produced, stored, transmitted or exchanged, and in most of the cases the privacy of the data is a requirement; this issue enforces the inventing of a secure way to send the data using the encryption. These days most of the encryption algorithms based on the idea of (Public Private Key), so that the process of encryption uses a key known to everyone and the decryption process uses a different private key, such as the RSA. The problem in these algorithms is the giving of the same cipher-text each time you encrypt a particular text using a specific key, which makes it easier to discover the original text by relating the encrypted text to a well-known decrypted text. The main purpose of this research is to build a reliable, an efficient, and a more secure algorithm for encryption. This algorithm gives multiple ciphers for a specific message using the same key and produces the original message once we decrypt these ciphers; this will make the process of hacking by relating the cipher to the text so difficult. This research paper will compare different algorithms with the new algorithm, and will demonstrate the implementation of an application that shows each one of these algorithms including the new one using a wellknown programming language.
Exercise the power of the World Wide Web

The World Wide Web is a hypertext-based, platform-independent means of displaying text, graphic, audio, and video information over the Internet. Twenty million people now use the Internet, and the number of World Wide Web sites is well over one million and growing rapidly. Web sites are available all over the world, although most are located in the United States. Importantly, the Web's design is consistent with many of our information gathering instincts. It encourages browsing and experimentation and allows each person at computer sites around the world to design unique ways to present and use information. The author discusses its practical applications, explains how hypertext works, and discusses how it is can be used by power utilities. Reserving a password and gaining access to the World Wide Web are also discussed. >
Generation and Verification of Inferences by Experts and Trained Nonexperts

This experiment explored how expert credit administrators and trained, but not yet expert, credit administrators (i.e., trained nonexperts, TNEs) differ in their ability to generate and verify inferences. Subjects read a case study describing a bank that appeared to be growing rapidly but, because of quality control problems, was heading for major difficulty. Subsequently, they performed a retelling task, a recognition task, and a problem identification/justification task. For each task, dependent measures were derived to detect the ability to retrieve explicit facts about the case and the ability to infer and reason about the case. Results showed that experts and TNEs did not differ in their ability to encode or retrieve the facts given explicitly in the case. However, for each task, marked differences appeared for inferencing and reasoning ability. Taken together, the data argue that the ability to reason within a complex domain is not simply the result of acquiring the requisite declarative knowledge. Rather, reasoning ability depends on problem solving practice and real-world experience in the domain. Implications for instruction are discussed.
Language-Independent Conceptual “Bugs” in Novice Programming

This article argues for the existence of persistent conceptual “bugs” in how novices program and understand programs. These bugs are not specific to a given programming language, but appear to be language-independent. Furthermore, such bugs occur for novices from primary school to college age. Three different classes of bugs—parallelism, intentionality, and egocentrism—are identified, and exemplified through student errors. It is suggested that these classes of conceptual bugs are rooted in a “superbug,” the default strategy that there is a hidden mind somewhere in the programming language that has intelligent interpretive powers.
Review of the Impact of Parameter Variation on the Operating Speed Range of the Interior Permanent Magnet Synchronous Machine

Abstract This paper systematically reviews the impact of the parameter variation on the power-speed characteristic of the interior permanent magnet synchronous machine while running with vector current control methods. The authors attempt to study the impact of the stator resistive drop, variation of the magnet flux-linkage, saturation, cross-coupling, and the reduced DC bus voltage on the voltage limits and trajectories for motoring and generation modes. Primarily, the stator resistive drop causes the difference in the base speeds of motoring and generation modes. On the other hand, the reduction in the DC bus voltage affects the starting point of the pseudo-constant power speed range. The saturation and cross-coupling affects the motoring and generation similar way by distorting the voltage limit ellipses and trajectories.
Fully distributed power control algorithm with one bit signaling and nonlinear error estimation [mobile radio systems]

In this paper, we suggest a method to estimate the carrier to interference ratio (CIR) information of the uplink using the power control ON-OFF commands at the mobile station (MS). The estimated CIR information is used to adjust the transmitted power from the mobile terminal using the distributed constrained power control (DCPC) algorithm. The main advantage of our algorithm is that it can improve the performance of power control without any increase in power control signaling. The suggested algorithm is compared with the conventional fixed step power control (FSPC) algorithm by computer simulations. Considerable improvements in system performance are observed when using the suggested algorithm in comparison with the FSPC algorithm.
Towards Role Detection in Virtual Worlds

Virtual worlds are a topic of steadily growing relevance. Some of the providers report user numbers that exceed the population of entire nations in the real world. Virtual worlds typically provide a high degree of complexity, which in some areas approaches the real world's richness of detail. Without ``living" in any given virtual world it is hard to get insights about that world and its inhabitants. Knowledge about users' roles within a virtual world can be of socio-economical and scientific interest. This work describes an automatic means of inferring such roles based on textual communication. We give an introduction into virtual worlds and formalize the task of virtual world role detection as well as evaluating its performance against a manually annotated large-scale corpus. We present and discuss various approaches towards virtual world role detection, showing that performance close to that of human judges can be achieved. We close by demonstrating a successful application of role detection in a free to play MMORPG.
A 0.9-ns-access, 700-MHz SRAM macro using a configurable organization technique with an automatic timing adjuster

The key to improving the performance of a single chip processor is to incorporate many varieties of SRAM macros with a word/bit-flexible configuration. To improve the performance even more, a configurable organization technique featuring a leaf cell design is proposed. In applying the technique, the timing design became too critical for the high-performance processor. An automatic timing adjuster is thus proposed to adjust the sense amplifier activation timing automatically in each organization. In addition, a low Vth MOS transistor is applied in order to improve access time. To overcome the increase in current leakage due to a low Vth, a back-bias control circuit is also proposed. These techniques in conjunction with a 0.25 /spl mu/m CMOS process make it possible to achieve a 0.9 ns access, 700 MHz SRAM macro.
EEG signal classification based on simple random sampling technique with least square support vector machine

This paper proposes a new approach based on Simple Random Sampling (SRS) technique with Least Square Support Vector Machine (LS-SVM) to classify two-class of electroencephalogram (EEG) signals. The experiments are carried out on two EEG databases and a synthetic Ripley dataset. All two-class pairs are tested and our proposed approach obtains a 95.58% average classification accuracy for the EEG epileptic database, 98.73% for the mental imagery tasks EEG database and 100% for Ripley data. We compare our method with two most recent methods for the epileptic database. Experimental results demonstrate that the proposed method is more promising than previously reported classification techniques.