bluuebunny/crossref_metadata_2025_split huggingface dataset:
Logic Testing
Authors: Wang Laung‐Terng (L.‐T.) , Stroud Charles E. , Cheng Kwang‐Ting (Tim) 
Published: March 2009

AbstractLogic testing involves the process of testing the digital logic portion of a circuit under test (CUT). The digital logic can be reconfigured in test mode to includetest logicto improve the testability and test quality of the circuit. Logic testing typically consists of applying a set of test stimuli to the inputs of the digital logic while analyzing the output responses. Depending on needs, both input test stimuli and output response analysis can be generated and performed inside the chip. Circuits that produce the correct output responses for all input stimuli pass the test and are considered to be fault free. Those circuits that fail to produce a correct response at any point during the test sequence are assumed to be faulty.
Wireless Networks
Authors: Samaka Mohammed , Khan Khaled MD. 
Published: March 2009

AbstractWireless communication is the fastest‐growing field in the telecommunication industry. Wireless networks have grown significantly as an important segment of the communications industry. They have become popular networks with the potential to provide high‐speed, high‐quality information exchange between two or more portable devices without any wire or conductors. Wireless networks can simply be characterized as the technology that provides seamless access to information, anywhere, anyplace, and anytime without being wired. This emerging technology builds on existing technologies such as radio engineering, data communications, computer networks, distributed systems, information management, and applications. The technology is based on radio and infrared transmission mechanisms and uses technologies such as cellular telephony, personal communications systems, wireless private branch exchanges, and wireless local area networks.The wireless radio network system facilitates mobility in communication. Systems achieve mobility by transmitting data via radio waves over the air. In a wireless network, the signal has no wire on which to travel in any particular direction, whereas in wired networks, signals only travel along the wire. In addition, the benefits of wireless networking include things such as increased mobility, simple and flexible installation, and easy scalability. Applications of this emerging technology are many, which range from the multimedia internet‐enabled cell phones to smart homes and appliances to automated highway systems, video teleconferencing and distance learning, and autonomous sensor networks.This article discusses the history, present state, and future of wireless networks. It also describes the fundamentals of wireless communication and explains the basic concepts at a level accessible to an audience with a basic background in digital communication.
Cerebellar Model Arithmetic Computer
Authors: Horváth Gábor 
Published: March 2009

AbstractCerebellar Model Arithmetic Computer (CMAC) is a special neural network architecture that was proposed as a functional model of a certain part of the mammalian brain, which is called the cerebellum.Cerebellum (from the Latin word “little brain”) is a fist‐sized structure located at the lower back of the brain. It is believed that its main function is to coordinate movements of muscles and joints, but recent evidence suggests that the cerebellum is partially responsible for speech, learning, emotions, and attention.CMAC as an artificial neural network architecture was introduced by Albus in 1975. This architecture is based on a theory developed independently by D. Marr and J. Albus around 1970. As it was developed as a simple model of the cerebellum, its main task was to control manipulators. Its original name Cerebellar Model Articulation Controller also comes from this first application.
Digital Sound Synthesis for Multimedia Audio
Authors: Miranda Eduardo R. 
Published: March 2009

Abstract
A great variety of software and techniques for generating audio for multimedia applications have been developed. They can be grouped into two broad approaches, referred to in this article as sampling manipulation and software synthesis, respectively. This article begins with an introduction to the basics of digital representation of sound, including the notions of sampling and storage. Then, it presents the fundamentals of sound processing and analysis by means of the short‐time Fourier transform method, followed by an introduction to sampling manipulation techniques. Next, it introduces the basics of frequency modulation, a powerful software synthesis technique that is relatively easy to implement and is capable of producing various musical tones and unusual sound effects.
FPGAPALDesign Tools
Authors: Sterpone Luca 
Published: March 2009

AbstractReconfigurable logic devices such as field programmable logic arrays (FPGAs) or programmable array logics are nowadays introducing a new design paradigm over the possible techniques an electronic or computing designer may choose to make the desired hardware chip running. Thanks to the higher design flexibility and the increasing performances supported by these devices on several aspects such as power, frequency, and dependability, programmable logic devices design tools play a central rule among the computer aided design (CAD) tools available. The basic concept behind this success is the possibility of defining the logic functionality of an electronic circuits without having a direct interface with the silicon layout mask of the chip itself. FPGA CAD tools have an increasing impact on the performances offered by current programmable devices. state‐of‐the‐art CAD tools support both the synthesis of optimized logic functions and the implementation of design referring to the manner in which programmable switches and hard‐wired interconnections are placed between logic functions. In this article survey of the CAD tools for the programmable devices design phases is presented exploring the variety and particularity offered and analyzing the most influcnt results achieved on this area.
Fuzzy Logic Control Systems
Authors: Kamalasadan Sukumar , Al‐Olimat Khalid S. 
Published: March 2009

Abstract
This article explains fuzzy controllers and general fuzzy systems. It emphasizes the basic idea of fuzzy control and the mathematics behind the concept. The article is divided into two sections. In the first part, the mathematics of fuzzy systems is discussed, which includes the definitions and basics of fuzzy expert systems, general fuzzy systems, and their properties. In the second part, the concept of fuzzy control are detailed which include the selection of inputs and outputs, enhancing control knowledge as a rule base, determining which rules to use, determining conclusions, converting decisions into actions, and graphical visual representation of fuzzy control operation. Then, various fuzzy control techniques and the essence of how fuzzy systems can be used for a wide range of control architectures are explained. The article concludes with the summary and future prospects of fuzzy logic systems.
Computational Materials Physics
Authors: Colombo Luciano 
Published: March 2009

AbstractMaterials physics greatly benefits computer simulations when addressing its ultimate goal, namely: the atomic‐scale understanding and the predictive modeling of materials behavior in whatsoever state of chemical composition, microstructure complexity, or aggregation.In this framework, computer simulations have firmly established themselves as a valuable partner methodology to the more traditional experimental and theoretical paradigms because: (1) it is possible to measure a theory numerically as much in the same sense as experiments measure phenomena and (2) atomistic simulations provide predictive atomic‐scale physical insight on materials behavior, even in conditions that can hardly be reached or controlled in a real experiment. Furthermore, computer modeling underlines the concept of material by design, that is, the development of the rational design of materials with tailored properties for demanding and advanced applications. Interesting enough, the material by design approach is ubiquously present in modern nanoscience and nanotechnology.Although the atomic scale represents in any case the lower level at which the computer modeling must operate, the new scenario of multiscale modeling has been recognized recently by the materials science community as a significant challenge. According to this standpoint, the different phenomena—which occur at diverse length and time scales—should be modeled by individually appropriate theoretical tools, which eventually must be linked together so as to provide a unique theoretical device that can pass physical information across different scales. The multiscale paradigm requires that different methods are coupled effectively into a numerical tool relatively undemanding of computing resources.
Methods for Acceleration of Convergence (Extrapolation) of Vector Sequences
Authors: Sidi Avram 
Published: March 2009

AbstractAn important problem that develops in different areas of science and engineering is that of computing limits of sequences of vectors, whereandNis very large. Such sequences develop, for example, in the solution of systems of linear or nonlinear equations by fixed‐point iterative methods, andare simply the required solutions. In most cases, however, these sequences converge to their limits extremely slowly. One practical way to make the sequencesconverge more quickly is to apply to themvector extrapolation methods.In this article, we present a somewhat detailed review of two polynomial‐type vector extrapolation methods that have proved to be very efficient convergence accelerators; namely, theminimal polynomial extrapolation(MPE) and thereduced rank extrapolation(RRE). We discuss the derivation of these methods, describe the most accurate and stable algorithms for their implementation along with the effective modes of usage in solving systems of equations, nonlinear as well as linear, and present their convergence and stability theory. We also discuss their close connection with knownKrylov subspace methodsfor linear systems. In addition to being used in solving large sparse systems of equations, MPE and RRE can be applied in other problems: We review the use of MPE in deriving vector‐valued rational approximations from vector‐valued power series and their connection with Krylov subspace methods for eigenvalue problems. We also show that MPE and RRE can be used very effectively to obtain the dominant eigenvectors of large sparse matrices when the corresponding eigenvalues are known, and provide the relevant theory as well. One such problem that has been of interest recently is that of computing thePageRankof the Google matrix. For completeness, we also discuss briefly the scalar, vector, and topological epsilon algorithms.
Optical Disk Data Storage, Distribution and Retrieval
Authors: McLeod Robert R. 
Published: March 2009

AbstractOptical data storage provides a remarkably inexpensive yet high‐quality platform for the distribution of large amounts of digital data. This article describes the end‐to‐end process of this distribution. Detailed information on each major generation of optical storage including compact disk (CD), digital video disk (DVD), and BluRay disk (BD) is presented and the variations within each family are described. Finally, a summary of current research on fourth‐generation optical storage is given.
OSfor Graphics and Multimedia
Authors: Yau David K. Y. 
Published: March 2009

AbstractMultimedia and graphics data, which includes video, audio, and realistic animations, are entertaining, informative, and intuitive. The information is continuously updated, in which the timing of the data is part of their semantics, and it must be maintained both within a data stream and between related data streams. Operating system (OS) support for the soft real‐time needs of multimedia applications is crucial and challenging. In this article, we discuss OS support for multimedia quality of service in a general‐purpose and multiuser computing environment. We address the issues of (1) resource abstraction and accounting, (2) resource scheduling, and (3) solutions to priority inversion problems that develop from interactions between OS components.
Operating Systems for Wireless Embedded Devices
Authors: Dunkels Adam 
Published: March 2009

AbstractWireless embedded devices are one of the fastest growing computer technologies today. Of the total amount of microprocessors sold today, 98% are used in embedded systems. Wireless embedded systems range from wireless car keys to security systems for freighter containers. Wireless embedded devices meet challenges in terms of cost, physical size, and energy consumption, which has implications for the operating systems running in the devices. This article discusses energy consumption and energy conservation, communication protocols and their implementation, programming models, and software updates and run‐time reprogramming for operating systems for wireless embedded devices.
Program Assemblers
Authors: Burgstaller Bernd , Scholz Bernhard 
Published: March 2009

Abstract
The central processing unit (CPU) of a computer executes instructions encoded as a sequence of binary numbers. This program representation is commonly referred to as machine code. Assembly languages provide mnemonic abbreviations for the instructions of a computer. Program assemblers translate assembly language programs into machine code and binary data. Program assemblers allow the use of symbolic addresses (labels) to save the assembly language programmer from the tedious task of computing memory addresses manually. Macros provide textual substitution facilities. Pseudoinstructions, code optimizations, and just‐in‐time assembly complicate the task of program assemblers even more.
Software Dependability
Authors: Roshandel Roshanak 
Published: March 2009

AbstractSoftware systems today control every aspect of our daily lives from banking and airline reservation systems, to power grids and air traffic control systems, to online shopping. Proliferation of complex software systems around the world, connected via networks, creates the expectations that these systems must be trusted; that they must be available when needed; that they must perform their duties correctly; that they must be safe to use; and that they must protect sensitive information embedded within them. Simply put, these software systems must be dependable.
Software Reliability
Authors: Gokhale Swapna S. 
Published: March 2009

AbstractThe influence of computer systems on our day‐to‐day lives has increased dramatically since their advent almost 60 years ago. The ever‐increasing power and reliability of hardware has encouraged the development of novel and innovative software applications. However, as the reliability of hardware continues to improve steadily, software reliability is becoming a major stumbling block in achieving desired levels of system dependability. The literature is replete with numerous software failures in the case of mission‐critical and medical systems, which result in a loss of life and reliable software operation is undoubtedly important for these systems. However, as economies of industrialized nations become increasingly dependent on software, its reliable operation becomes crucial for the success of business critical systems as well. A NIST study estimates that the U.S. economy loses $59.5 billion per year or 0.6% of the GDP that result because of failures resulting from software faults. As computer software permeates our society, expectations about its reliability will increase rapidly.
Data Compression
Authors: Ansari Rashid , Chang Chang , Reynolds William D. 
Published: March 2009

AbstractData compressionrefers to the process of transforming a given format of representing information (audio, image, video, or text) into a more compact format that consumes significantly reduced amounts of resources for storage and transmission. The term data compression is sometimes used to refer to the algorithms used for transforming the data.Data compression technologycommonly refers to the software or hardware that is used in implementing the compression algorithms. Often the termcodingis employed to convey the same meaning as compression, and the descriptions audio, image, and video coding are commonly used to describe compression of these media data.
File Organizations
Authors: Zezula Pavel , Dohnal Vlastislav , Batko Michal 
Published: March 2009

AbstractOrganizing files of records has always been an important part of data processing technology, because it influences the efficiency of operations that query or manipulate data collections. We define a notion of a file and classify existing file organizations in three broad categories: simple key, multidimensional key, and distance‐based key file organizations. For each of the categories, we explain the basic principles, survey main representatives, and outline major application areas. We also show how limitations of structures in one category can be addressed by methods in other categories by means of a specific transformation. Finally, future directions are outlined.
Chomsky Hierarchy
Authors: Paun Gheorghe 
Published: March 2009

Abstract
We introduce Chomsky hierarchy in a formal manner, considering first the basic classes (regular, linear, context‐free, context‐sensitive, and general grammars), then also introducing a sample intermediate level placed in between context‐free and context‐sensitive levels, the one defined by the matrix grammars and their “relatives,” the programmed and the random context grammars. A series of properties of the corresponding families of languages are also presented: characterizations and necessary conditions, closure and decidability properties, automata characterizations, and so forth.
Image Segmentation by Region Based and Watershed Algorithms
Authors: Hanbury Allan 
Published: March 2009

AbstractThe segmentation of an image is defined as its partition into regions, in which the regions satisfy some specified criteria. First, two region‐based image segmentation techniques are described: region growing and split and merge. Second, the watershed transform, which combines aspects of both edge‐based and region‐based segmentation approaches, is described. In general, the basic watershed transform leads to an over‐segmentation of an image. Methods to reduce this over‐segmentation are discussed: preprocessing and filtering the input image, the marker‐based watershed algorithm, and hierarchical watershed algorithms.
Shape from Shading
Authors: Tankus Ariel , Sochen Nir , Yeshurun Yehezkel 
Published: March 2009

AbstractShape‐from‐shading (SfS) is a fundamental problem in computer vision. Its goal is reconstruction of surface depth (i.e., distance from camera plane) based on a single image of the surface. The problem was introduced in the early 1970s by Horn. A very common assumption in this field is that image projection is orthographic. We will present the orthographic shape‐from‐shading problem and an algorithm for its solution: the fast marching method of Kimmel and Sethian. We shall than reexamine the basis of SfS, which is the image irradiance equation, under a perspective projection assumption. The resultant equation does not depend on the depth function directly, but on its natural logarithm, and as such it is invariant to scale changes of the depth function. A reconstruction method based on the perspective formula is then described; it is a modification of the aforementioned orthographic fast marching method. Then, a comparison of the orthographic fast marching, perspective fast marching, and the perspective algorithm of Prados and Faugeras on synthetic images is are presented. The two perspective methods equate with each other and show better reconstruction results than the orthographic. We then compare the orthographic and perspective versions of the fast marching method on endoscopic images. The perspective algorithm outperformed the orthographic one. These findings suggest that the more realistic set of assumptions of perspective SfS improves reconstruction significantly with respect to orthographic SfS. The findings also provide evidence that perspective SfS can be used for real‐life applications in fields such as endoscopy.
Mesh Deformation
Authors: Zhang Hongxin , Liu Xinguo , Bao Hujun 
Published: March 2009

AbstractGenerating and manipulating surfaces is one of the central issues in various applications of computer graphics and digital entertainment. As one of these operations for surface generating, deformations allow the user to treat an object as if it were constructed from a special type of topological putty or clay, which may be bent, twisted, tapered, compressed, expanded, and otherwise transformed repeatedly into a final shape. They are highly intuitive and easily visualized operations that simulate some important manufacturing processes for fabricating objects, such as the bending of bar stock and sheet metal.Recent progress of deformation techniques focus on mesh deformation. Although for different computing tasks, different surface representations are employed to reveal different geometric, physical, plausible, or perceptual properties of the shape to be handled. The polygonal meshes become fundamental digital media through the whole geometric processing pipeline because of its convenience of acquisition and rendering. However, a pure mesh representation with its vertex positions defined in global coordinate system is challenging for deforming shapes while caring details. Hence researchers have developed several efficient ways to deform mesh surfaces.
Computer Music Composition/Analysis
Authors: Cope David 
Published: March 2009

AbstractComputers are used in music for composition, analysis, sound synthesis, performance, notation, recording, and so on, wherever benefits result from enhanced speed and accuracy. Of these possible uses, computer music composition and computer music analysis have the most serious philosophical implications, because computers can be used to replace what many feel are activities more rightfully the domain of humans: principally the freedom of choice, but including more ephemeral concepts such as imagination, inspiration, and intuition. In this article, we will investigate many aspects of computer music composition and analysis as well as their philosophical implications.
Robot Path Planning
Authors: Hsu Harry Chia‐Hung 
Published: March 2009

Abstract
Planning for a robot to execute a task from abstraction to concretion can be roughly divided into three stages: task planning, path planning, and motion planning. The task planning divides a complex task into several simple subtasks. For instance, for a forage robot to execute a task of grasping food back to home, this task may be divided into subtasks of searching food, moving toward the food if found, grasping the food, moving the food back to home, and putting the food at home. For executing each subtask, path planning needs to produce a path for the robot to execute. For example, for executing the subtask of moving toward the food, the robot needs to calculate executable paths from its current position to the food position and determine which route to take if multiple paths exist (generally the shortest path has the highest priority). Similarly, for executing the subtask of grasping the food, the robot needs to produce a path for its arm to hold the food. Finally, the motion planning based on the planned path to plan its kinematic and dynamic motions for the robot to execute. The main focus of this article is path planning, and part of task planning and motion planning is also mentioned as they are related.
The Computing Field: Structure
Authors: Denning Peter J. 
Published: March 2009

AbstractThis article examines the development of the computing field. Our account considers the computing field in four stages: infancy (1935–1950), childhood (1950–1970), adolescence (1970–1990), and young adulthood (1990–2010). The computing profession is a product of the fourth stage. The relationships between computing and other fields are vitally important.