ppxscal/embedding_network huggingface dataset:
Wire sizing and spacing for lithographic printability and timing optimization
Authors: Ke Cao, Jiang Hu, Mosong Cheng
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

As the VLSI feature size has already decreased below lithographic wavelength, the printability problem, due to strong diffraction effects, poses a serious threat to the progress of VLSI technology. A circuit layout with poor printability implies that it is difficult to make the printed features on wafers follow designed shapes without distortions. The development of resolution enhancement techniques (RET) can alleviate the printability problem but cannot reverse the trend of deterioration. Moreover, over-usage of RET may dramatically increase photo-mask cost and increase the cycle time for volume production. Thus, there is a strong demand to consider the subwavelength printability problem in circuit layout designs. However, layout printability optimization should not degrade circuit timing performance. In this paper, we introduce a wire sizing and spacing method to improve wire printability with minimal adverse impact on interconnect timing performance. A new printability model is proposed to handle partially coherent illuminations. The complex printability and timing optimization problem is solved in a two-phase approach. The difficulty of the printability optimization due to its multimodal nature is handled with a sensitivity-based heuristic. A coupling aware timing driven continuous wire sizing algorithm is also provided. Lithographic simulation results show that our approach can improve the printability in term of edge placement error (EPE) by 20%-40% without violating timing, wire width, and spacing constraints.
Existence of solutions to nonlinear Neumann boundary value problems with generalized p-Laplacian operator
Authors: Li Wei, Ravi P. Agarwal
Venue: Computers Mathematics with Applications (2008)

Using perturbation results on the sums of ranges of nonlinear accretive mappings of Calvert and Gupta [B.D. Calvert, C.P. Gupta, Nonlinear elliptic boundary value problems in L^p-spaces and sums of ranges of accretive operators, Nonlinear Anal. 2 (1978) 1-26], we present some abstract existence results for the solutions of nonlinear Neumann boundary value problems involving the generalized p-Laplacian operator. The equation discussed in this paper and the method used extend and complement some of the previous work.
Constructions of bipartite graphs from finite geometries
Authors: Keith E. Mellinger, Dhruv Mubayi
Venue: Journal of Graph Theory (2005)

We construct an incidence structure using certain points and lines in finite projective spaces. The structural properties of the associated bipartite incidence graphs are analyzed. These n &times; n bipartite graphs provide constructions of C6-free graphs with &Omega;(n4-3 edges, C10-free graphs with &Omega;(n6-5) edges, and &Theta;(7,7,7)-free graphs with &Omega;(n8-7) edges. Each of these bounds is sharp in order of magnitude. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory 49: 1&ndash;10, 2005
Vision-based fuzzy 8051 surveillance systems design
Authors: Hsuan-Ming Feng, Chih-Yung Chen, Chia-Yun Wu
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

This paper proposes a vision-based fuzzy 8051 surveillance system which emphasizes on designing the image processing function to detect the invaded states and the 8051 fuzzy servomotors controller to track the invader region. The techniques include discrete wavelet transformation (DWT) image data reducing, edge detection, motion detection, and fuzzy servomotor control. In this paper, image processing techniques are used for invader detection. Using a two-axis camera mount controlled by fuzzy controller, this system could make the camera exactly keeping the invader object on the center of scene. Also, the proposed tracking system has high potential in the guard of security management, the transaction authentication, the residential monitoring.
Fuzzy Edge Detection in Biometric Systems
Authors: Vamsi Krishna Madasu, Shantaram Vasikarla
Venue: Proceedings of the 36th Applied Imagery Pattern Recognition Workshop (2007)

This paper proposes a fuzzy logic based edge detector for feature extraction in biometric systems such as face and palm print recognition. Edge detection is carried out by means of global (histogram of gray levels) and local (pixels within in a window) information. The local information is fuzzified by employing a modified Gaussian membership function. Using the contrast intensification operator, the image is enhanced to the required level of visual quality by entropy optimization of fuzzification parameters. Furthermore, the local edge detection operator is applied on the enhanced image using parameters obtained from entropy optimization. Finally, a simple threshold is applied to produce the skeleton image. Results demonstrate that this edge detector is well suited for feature extraction in biometric image systems.
Interactive Distributed Source Coding in Asymmetric Communication Scenarios
Authors: Samar Agnihotri, H. S. Jamadagni, Pavan Nuggehalli
Venue: Proceedings of the Data Compression Conference (2008)

We are concerned with the problem of minimizing the complexity of communication in a distributed information gathering scenario, where a recipient gathers the information from a set of correlated informants, by interactively communicating with those. We assume that the joint distribution of the informants’ data is known only to the recipient. Realizing that there can be different objectives to achieve in such a communication scenario, our work provides the optimal communication protocols, which minimize the number of messages and bits exchanged to achieve these objectives. Both, worst-case and average-case scenarios are considered.
An Algorithm Based on Girth-location for MR Head Image Segmentation
Authors: Jun Wu, Xiaolin Tian
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

In this paper, a segmentation algorithm for MR Head image has been proposed based on Girth-Location information. In the new algorithm, the brain structure is segmented by counting the girth of boundary for connective areas with location information. Then the algorithm of region growing has been used to separate the white matter (WM) from gray matter (GM). Experimental results indicated that this new approach has made full usage of the location information and boundary information of MR images. Compared with other algorithms, the new algorithm is characterized by faster, robustness and accurateness.
Lattice Boltzmann Modeling: An Introduction for Geoscientists and Engineers, 1 edition
Authors: Michael C. Sukop, Daniel T. Jr Thorne
Venue:  (2007)

Lattice Boltzmann models have a remarkable ability to simulate single- and multi-phase fluids and transport processes within them. A rich variety of behaviors, including higher Reynolds numbers flows, phase separation, evaporation, condensation, cavitation, buoyancy, and interactions with surfaces can readily be simulated. This book provides a basic introduction that emphasizes intuition and simplistic conceptualization of processes. It avoids the more difficult mathematics that underlies LB models. The model is viewed from a particle perspective where collisions, streaming, and particle-particle/particle-surface interactions constitute the entire conceptual framework. Beginners and those with more interest in model application than detailed mathematical foundations will find this a powerful "quick start" guide. Example simulations, exercises, and computer codes are included. Working code is provided on the Internet.
On a certain class of a nonlinear evolution partial differential equations
Authors: S. Mesloub, H. A. Abdusalam
Venue: Journal of Computational and Applied Mathematics (2008)

An existence result and a priori bound for the solution of a second-order nonlinear parabolic equation are established. Also a generalized tanh-function method is used for constructing exact travelling wave solutions for the nonlinear diffusion equation of Fisher type originated from the considered partial differential equation. And new multiple soliton solutions are obtained.
Reducing Scan Shift Power at RTL
Authors: Elif Alpaslan, Yu Huang, Xijiang Lin, Wu-Tung Cheng, Jennifer Dworak
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

Power consumption during scan-based test becomes a concern in nanometer technologies. Previous test power reduction techniques that insert additional logic in gate-level circuits may result in timing violations. In this paper, we show that the problem can be solved at the RTL instead so that the timing and area constraints will be handled automatically by synthesis tools. Using a signal probabilistic approach proposed previously, we identify power-sensitive scan cells at the prototyping gate level, and we map these cells to their corresponding signal / variable bits at the RT-Level. Additional RTL code is added to freeze these power sensitive bits in order to reduce scan shift power consumption. Experimental results on ITC99 benchmarks show that on average more than 22% power reduction can be achieved when we only freeze the top 1% of power-sensitive bits at RTL. The flow is more practical in terms of timing closure than doing the same at the gate-level.
Quantifying optical and SAR image relationships for tropical landscape features in the Amazônia
Authors: Y. E. Shimabukuro, R. Almeida-Filho, T. M. Kuplich, R. M. de Freitas
Venue: International Journal of Remote Sensing (2007)

This paper discusses the relationship between SAR and optical data for an Amazonian test-site with different land cover types. L-band HH JERS-1 SAR and Landsat TM images acquired few days apart from each other in 1994 and 1997 were analyzed. Landsat TM fraction images (vegetation, soil, and shade) were used to characterize the terrain features in the study area. Based on 220 samples randomly distributed over different land cover types in the fraction and SAR bands, a regression analysis was performed. Consistent results between SAR data and fraction images suggest that L-band SAR data may be a complementary source of information for mapping land cover changes in Amazônia, especially to monitor deforestation in areas frequently blurred by cloud cover in optical images.
A Novel Route Guidance Algorithm with Maximum Coverage and Minimum Handover for Vehicular Networks
Authors: Mohamed Chedly Ghedira, Walid Ben-Ameur, Hossam Afifi
Venue: Proceedings of the Seventh International Conference on Networking (2008)

In this paper, we propose a novel route guidance algorithm that provides better wireless network availability. Using a GPS device, geographical information is considered to select a short geographical path while ensuring the maximum covered distance and the minimum handovers number. An efficient algorithm is derived to tackle the problem in polynomial time. Our solution is optimal and well suited to all possible scenarios including low and high hotspots density. By comparing our algorithm with some common practices, we minimize significantly the handovers number and decrease the wireless uncovered distance, with a negligible overhead in the traversed distance.
AUV controller design and analysis using full-state feedback
Authors: M. Y. Radzak, M. R. Arshad
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

This paper presents the design and development of a system controller for our USM Autonomous Underwater Vehicle (USM-AUV). The state space design approach was used because this design approach is most suitable for nonlinear system and multi-input multi-output (MIMO) system set-up. The full state feedback control scheme under the state space design topic has been selected for the controller design. In the initial stage, the controller system was designed using the linearised equation of motion. For the USM-AUV vehicle design, the thruster motor output force was selected as the input with the depth position as the output. Analysis of the designed control system performances has been done via simulation in Matlab control simulation software. A satisfactory performance has been achieved from the designed controller system. Optimal parameters values have also been acquired for optimal performance of our USM-AUV platform.
Use of vegetation index and meteorological parameters for the prediction of crop yield in India
Authors: A. K. Prasad, R. P. Singh, V. Tare, M. Kafatos
Venue: International Journal of Remote Sensing (2007)

Monsoon rainfall distribution over the Indian sub-continent is inconsistent every year. Due to uncertainty and dependence on the monsoon onset and weather conditions, estimation of crop yield in India is difficult. In this paper, analyses of the crop yield, normalized difference vegetation index, soil moisture, surface temperature and rainfall data for 16 years (from 1984 to 1999) have been carried out. A non-linear iterative multivariate optimization approach (quasi-Newton method with least square loss function) has been used to derive an empirical piecewise linear crop yield prediction equation (with a break point). The derived empirical equation (based on 1984 to 1998 data) has been used to predict 1999 crop yield with R2>0.90. The model has been validated for the three years 1997, 1998 and 1999. A crop yield prediction equation has been obtained for each province in India (for wheat and rice) that accounts for>90% of the variance in the dataset.
Neural adaptive control for a class of nonlinear systems with unknown deadzone
Authors: Zhonghua Wang, Yong Zhang, Hui Fang
Venue: Neural Computing and Applications (2008)

This paper focuses on the adaptive control of a class of nonlinear systems with unknown deadzone using neural networks. By constructing a deadzone pre-compensator, a neural adaptive control scheme is developed using backstepping design techniques. Transient performance is guaranteed and semi-globally uniformly ultimately bounded stability is obtained. Another feature of this scheme is that the neural networks reconstruction error bound is assumed to be unknown and can be estimated online. Simulation results are given to demonstrate the effectiveness of the proposed controller.
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
Authors: R. Ryan Williams
Venue: Computational Complexity (2008)

We prove the first time-space tradeoffs for counting the number of solutions to an NP problem modulo small integers, and also improve upon known time-space tradeoffs for Sat. Let m > 0 be an integer, and define MOD m -Sat to be the problem of determining if a given Boolean formula has exactly km satisfying assignments, for some integer k. We show for all primes p except for possibly one of them, and for all c < 2 cos(¿/7) ¿ 1.801, there is a d > 0 such that MOD p -Sat is not solvable in n c time and n d space by general algorithms. That is, there is at most one prime p that does not satisfy the tradeoff.We prove that the same limitation holds for Sat and MOD 6-Sat, as well as MOD m -Sat for any composite m that is not a prime power. Our main tool is a general method for rapidly simulating deterministic computations with restricted space, by counting the number of solutions to NP predicates modulo integers. The simulation converts an ordinary algorithm into a "canonical" one that consumes roughly the same amount of time and space, yet canonical algorithms have nice properties suitable for counting.
On the development of a technology intelligence tool for identifying technology opportunity
Authors: Byungun Yoon
Venue: Expert Systems with Applications: An International Journal (2008)

Technology intelligence tools have come to be regarded as vital components in planning for technology development and formulating technology strategies. However, most such tools currently focus on providing graphical frameworks and databases to support the process of technology analysis. Techpioneer, the proposed tool in this paper, aims to offer decisive information in order to identify technology opportunities. To this end, the system uses textual information from technological document databases and applies morphology analysis to derive promising alternatives and conjoint analysis to evaluate their priority. In addition, the method used in developing a technology dictionary is presented, employing clustering and network analysis. This system also has the ability to communicate with experts in order to estimate the value of existing patents, which is inevitable for the priority-setting of alternatives, construct a morphological matrix and so on. This paper presents the system architecture and functions of this tool and moreover, illustrates the prototype implementation and case study of the same.
Experiences with a FPGA-based Reed/Solomon-encoding coprocessor
Authors: Volker Hampel, Peter Sobe, Erik Maehle
Venue: Microprocessors Microsystems (2008)

In this paper we present an implementation of a Reed/Solomon (R/S)-coprocessor to be used on a hybrid computing system, which combines general purpose CPUs with FPGAs. The coprocessor accelerates the encoding of user data to be stored block-wise on a distributed, failure-tolerant storage system. We document design constraints and their impact on the resulting architecture. Measurements are presented to characterize the performance of the coprocessor in terms of computational bandwidth, latency, and the hardware-software interaction. For comparison, software-based R/S-encoding implementations are presented and evaluated as well. The two variants of the FPGA-based coprocessors are compared to each other with respect to their fitting to a distributed storage application.
Learning educational research methods through collaborative research: the PhICER initiative
Authors: Anders Berglund, Ilona Box, Anna Eckerdal, Raymond Lister, Arnold Pears
Venue: Proceedings of the tenth conference on Australasian computing education - Volume 78 (2008)

To accommodate an increasing interest in phenomenography among the computing education research community, the authors of this paper have organised two workshops, or intensive courses, in phenomenography, intended for researchers in computing education at a university level. Although the workshop programs contained lectures and smaller exercises, the emphasis was on preparing one joint publication from each of the workshops. The publication from the first workshop discussed the experience of being a teacher in computing, while the second focused on teachers' experiences of the problems their students encounter when learning computing. The workshops and their impact on the community are discussed in this paper.
Forbidden subgraphs and bounds on the size of a maximum matching
Authors: Michael D. Plummer, Akira Saito
Venue: Journal of Graph Theory (2005)

Let K1,n denote the star on n&thinsp;+&thinsp;1 vertices; that is, K1,n is the complete bipartite graph having one vertex in the first vertex class of its bipartition and n in the second. The special graph K1,3, called the claw, has received much attention in the literature. In particular, a graph G is said to be claw-free if G possesses no K1,3 as an induced subgraph. A well-known theorem of Sumner and, independently, Las Vergnas says that every connected even claw-free graph contains a perfect matching. (Later, J&uuml;nger, Pulleyblank, and Reinelt proved that if G is connected, claw-free, and odd, then G must contain a near-perfect matching.) More generally, Sumner proved that if G is K1,n-free, (n&thinsp;-&thinsp;1)-connected, and even, then G must contain a perfect matching. In this paper, we extend these results in several ways. First, we show that if G is a k-connected K1,n-free graph on p vertices, then def(G) is bounded above by a certain function of k,n, and p, where def(G) is the deficiency of G. (The deficiency of a graph measures how far a maximum matching is from being perfect; that is, def (G)&thinsp;=&thinsp;p&thinsp;-&thinsp;2&nu;(G), where &nu;(G) is the size of any maximum matching in G.) We then provide examples to show that this upper bound is sharp for each value of k and n. We then prove a result that is a type of converse to the above theorem in the following sense. Suppose that H is a connected graph and suppose that there exist constants &alpha; and &beta;, 0&thinsp;&le;&thinsp;&alpha;&thinsp;<&thinsp;1, such that every k-connected H-free graph G of sufficiently large order satisfies (G)&thinsp;&le;&thinsp;&alpha;|V(G)|&thinsp;+&thinsp;&beta;. Then the excluded subgraph H must be a K1,n, where n is bounded above by a certain function of &alpha; and k. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory
A multi-resolution AHB bus tracer for real-time compression of forward/backward traces in a circular buffer
Authors: Yi-Ting Lin, Wen-Chi Shiue, Ing-Jer Huang
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

The forward/backward trace refers to the trace captured after/before a target point is reached, respectively. Real time compression of the backward trace in a circular buffer is a challenging problem since the initial state of the trace currently under compression might be overwritten when wrapping around occurs. This paper presents a real time multi-resolution AHB on-chip bus tracer which is capable of capturing and compressing both forward and backward traces in a circular buffer. The backward trace is accomplished with a ping-pong organization of dual forward trace compression engines. While one module is compressing the trace, the other is clearing up its internal data structure. The roles of the two engines are exchanged periodically. The Bus Tracer, costs 60K gates and runs up to 500MHz in TSMC 0.13&mu;m technology. The experiments show that our approach achieves 2.32 to 3.98 times in effective trace depth than traditional circular buffer approaches.
Performance Evaluation of Wireless Network in Presence of Hidden Node: A Queuing Theory Approach
Authors: Anjana Jain, Akhilesh Kumar Dubey, Raksha Upadhyay, S. V. Charhate
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Hidden node is a fundamental problem that affects any wireless network where nodes cannot hear each other and leads to data packet collision. IEEE 802.11 wireless networks employ RTS/CTS mechanism for avoiding DATA packet collision .The main design assumption in this method is that all the nodes in the vicinity of a sender and a receiver must hear the RTS and CTS packets. They also defer their transmission appropriately. In this paper first scenarios are discussed which leads to DATA packet collision. In the later part of the paper an analytical model is developed by taking queuing and retransmissions. Expression for probability of packet collision is then derived. Finally detail simulation is performed. Analytical and simulation results are compared as well as the variation of packet error is calculated. Results are presented which show the variation of packet error with the variation of service time and packet arrival rate. These results can be used in future for the evaluation of throughput and delay of the system.