ppxscal/embedding_network huggingface dataset:
Constraint-driven design: the next step towards analog design automation
Authors: Goeran Jerke, Jens Lienig
Venue: Proceedings of the 2009 international symposium on Physical design (2009)

The design of analog circuits has historically been a time consuming, manual task. The stringent constraints that must be considered simultaneously make the task particularly difficult, and are a major reason analog design has often not been automated. We believe that constraint-driven design is a prerequisite to analog design automation as it enables expert knowledge to be included in the design flow. This paper provides an introduction to the concept of constraint-driven physical design. First, we identify the major challenges in analog physical design, which we show are mostly constrained-related. We then provide an overview of the essential components of a constraint-driven design methodology. Finally, we discuss the impact this approach has on the analog design flow and design algorithms.
Programming ASP.NET 3.5, 4th edition
Authors: Jesse Liberty, Dan Maharry, Dan Hurwitz
Venue:  (2008)

With Programming ASP.NET 3.5, you'll quickly learn to create state-of-the-art applications using Microsoft's popular web development technology and Visual Studio 2008. This updated bestseller provides comprehensive and easy-to-understand information to help you use several .NET 3.5 technologies for faster development and better web application performance-including ASP.NET AJAX for interactive user interfaces, LINQ for data access, and Windows Communication Foundation (WCF) for web services.Programming ASP.NET 3.5 includes examples and sample code that let you explore development with ASP.NET in more depth. With this book, you will:Learn about AJAX and ASP.NET server controls included with Visual Studio 2008 Discover how to use the DataSource and data-bound controls in ADO.NET Use the new LINQ API and learn how to make use of it within ASP.NET pages Create a uniform look and feel throughout your application with Master Pages Use navigation controls to build site maps, menus, and breadcrumbs quickly and easily Build and use various web services with WCF Detect errors during development and handle them in your production code Learn how to configure and deploy your websiteWritten by Microsoft technology experts Jesse Liberty, Dan Hurwitz, and Dan Maharry, Programming ASP.NET 3.5 is the best book for learning how to build dynamic, interactive web applications using Microsoft's latest technologies.
Perfectly quilted rectangular snake tilings
Authors: Robert Brijder, Hendrik Jan Hoogeboom
Venue: Theoretical Computer Science (2009)

We introduce a particular form of snake tilings to define picture languages, and relate the obtained family to the recognizable picture languages (as defined by Wang tiles). The correspondence for substitution tilings is even closer, and hence is applicable to the Hilbert curve.
Fine-grained access control for GridFTP using SecPAL
Authors: Marty Humphrey, Sang-Min Park, Jun Feng, Norm Beekwilder, Glenn Wasson, Jason Hogg, Brian LaMacchia, Blair Dillaway
Venue: Proceedings of the 8th IEEE/ACM International Conference on Grid Computing (2007)

Grid access control policy languages today are generally one of two extremes: either extremely simplistic, or overly complex and challenging for even security experts to use. In this paper, we explicitly identify requirements for an access control policy language for Grid data and then consider six specific data access use-cases that have been problematic in today’s Grids: attribute-based access, role-based access, “role-deny” access, impersonation-based access, delegation-based access, and capability-based access. We evaluate the Security Policy Assertion Language (SecPAL) against those requirements, specifically in the context of these six use-cases involving GridFTP.NET. We find that while some of these six use-cases are individually possible via existing Grid authorization systems, we believe that SecPAL uniquely offers a single approach that meets the requirements of a Grid access control policy language, thereby creating support for a wide range of expanded scenarios for Grid data access.
A 3D face matching framework for facial curves
Authors: Frank B. ter Haar, Remco C. Veltkamp
Venue: Graphical Models (2009)

Among the many 3D face matching techniques that have been developed, are variants of 3D facial curve matching, which reduce the amount of face data to one or a few 3D curves. The face's central profile, for instance, proved to work well. However, the selection of the optimal set of 3D curves and the best way to match them has not been researched systematically. We propose a 3D face matching framework that allows profile and contour based face matching. Using this framework we evaluate profile and contour types including those described in the literature, and select subsets of facial curves for effective and efficient face matching. With a set of eight geodesic contours we achieve a mean average precision (MAP) of 0.70 and 92.5% recognition rate (RR) on the 3D face retrieval track of the Shape Retrieval Contest (SHREC'08), and a MAP of 0.96 and 97.6% RR on the University of Notre Dame (UND) test set. Face matching with these curves is time-efficient and performs better than other sets of facial curves and depth map comparison.
Brief paper: A parameter space approach to constrained variance PID controller design
Authors: P. B. Dickinson, A. T. Shenton
Venue: Automatica (Journal of IFAC) (2009)

This paper presents a parameter space approach to constrained variance and minimum variance PID controller design for LTI models. The technique is based on rational transfer functions of the plant and noise models. Loci corresponding to a fixed variance can be mapped into parameter planes for PID and PI type controllers to graphically display regions which satisfy the constraint, thereby guiding a design to appropriate controller gains. Requirements for tracking regulation can be readily achieved without excessively increasing the output variance. The usual advantages of parameter space techniques apply where other design criteria may be superimposed, allowing multiple objectives to be achieved non-conservatively. The superposition of the parameter space boundaries from existing robust control techniques thus allows non-conservative robust minimum variance PID design. A design example compares the technique to an algebraic minimum variance design using an integrator when tracking is required.
Feature detection of triangular meshes based on tensor voting theory
Authors: Hyun Soo Kim, Han Kyun Choi, Kwan H. Lee
Venue: Computer-Aided Design (2009)

This paper presents n-dimensional feature recognition of triangular meshes that can handle both geometric properties and additional attributes such as color information of a physical object. Our method is based on a tensor voting technique for classifying features and integrates a clustering and region growing methodology for segmenting a mesh into sub-patches. We classify a feature into a corner, a sharp edge and a face. Then, finally we detect features via region merging and cleaning processes. Our feature detection shows good performance with efficiency for various dimensional models.
BSMR: Byzantine-Resilient Secure Multicast Routing in Multihop Wireless Networks
Authors: Reza Curtmola, Cristina Nita-Rotaru
Venue: IEEE Transactions on Mobile Computing (2009)

Multihop wireless networks rely on node cooperation to provide multicast services. The multihop communication offers increased coverage for such services but also makes them more vulnerable to insider (or Byzantine) attacks coming from compromised nodes that behave arbitrarily to disrupt the network. In this work, we identify vulnerabilities of on-demand multicast routing protocols for multihop wireless networks and discuss the challenges encountered in designing mechanisms to defend against them. We propose BSMR, a novel secure multicast routing protocol designed to withstand insider attacks from colluding adversaries. Our protocol is a software-based solution and does not require additional or specialized hardware. We present simulation results that demonstrate that BSMR effectively mitigates the identified attacks.
Time Sensitive Ranking with Application to Publication Search
Authors: Xin Li, Bing Liu, Philip Yu
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Link-based ranking has contributed significantly to the success of Web search. PageRank and HITS are the best known link-based ranking algorithms. These algorithms do not consider an important dimension, the temporal dimension. They favor older pages because these pages have many in-links accumulated over time. Bringing new and quality pages to the users is important because most users want the latest information. Existing remedies to PageRank are mostly heuristic approaches. This paper investigates the temporal aspect of ranking with application to publication search, and proposes a principled method based on the stationary probability distribution of the Markov Chain. The proposed techniques are evaluated empirically using a large collection of high energy particle physics publication. The results show that the proposed methods are highly effective.
QoS Management for Distributed Multimedia Services
Authors: Ralf Seepold, Natividad Martínez Madrid, Javier Martínez Fernández
Venue: Proceedings of the 10th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services: Real-Time Mobile Multimedia Services (2008)

Currently, several multimedia devices support the UPnP protocol allowing automatic detection of devices, connection of devices and agreement on a certain quality of the communication established between a server of content (Media Server) and a player of content (Media Renderer). The focus of this paper is to add to the UPnP standard quality of service (QoS) some elements to incorporate better performance in the local networks. All these additions are compatible with the current standard.
Evaluation of voltage interpolation to address process variations
Authors: Kevin Brownell, Gu-Yeon Wei, David Brooks
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Post-fabrication tuning provides a promising design approach to mitigate the performance and power overheads of process variation in advanced fabrication technologies. This paper explores design considerations and VLSI-CAD support for a recently proposed postfabrication tuning knob called voltage interpolation. The paper discusses design tradeoffs between circuit tuning range and static power overheads that can be performed within the synthesis flow of the design process. The paper explores the scheme for a 64-core chip-multiprocessor machine using industrial-grade design blocks and shows that the scheme can be used to mitigate overhead arising from random and correlated within-die process variations. The analysis shows that the scheme can match the nominal delay target with a 10% power cost, or for the same power budget, incur only a 9% delay overhead after variations.
Investigation on the Behaviour of New Type Airbag
Authors: Hu Lin, Liu Ping, Huang Jing
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

This research a new type airbag system (NAB) was developed in this study which consists of two flat layers and a middle layer with tube-type structure. The objective of the new airbag system is to enhance the occupant safety in passenger car collisions with reduction of injury risks for small and OOP occupants. A prototype of the airbag was built up with volume 40 litters. The performance of the prototype airbag was investigated using static deployment test and sled crash test with Hybrid III dummy. A FE model of the airbag was developed and validated using results from the airbag deployment test and sled crash test. In order to determine the potential for occupant protection, computer simulations of the OOP occupant with NAB and the normal driver-side airbag (DAB) are carried out using HYBRID-III FE model. Results indicated that the NAB airbag need less gas than the DAB to get the same load and displacement curve, and the leading velocity of NAB is lower than that of DAB. In the OOP simulation, the acceleration of dummy head using NAB is smaller than that using DAB.
Barrier Lyapunov Functions for the control of output-constrained nonlinear systems
Authors: Keng Peng Tee, Shuzhi Sam Ge, Eng Hock Tay
Venue: Automatica (Journal of IFAC) (2009)

In this paper, we present control designs for single-input single-output (SISO) nonlinear systems in strict feedback form with an output constraint. To prevent constraint violation, we employ a Barrier Lyapunov Function, which grows to infinity when its arguments approach some limits. By ensuring boundedness of the Barrier Lyapunov Function in the closed loop, we ensure that those limits are not transgressed. Besides the nominal case where full knowledge of the plant is available, we also tackle scenarios wherein parametric uncertainties are present. Asymptotic tracking is achieved without violation of the constraint, and all closed loop signals remain bounded, under a mild condition on the initial output. Furthermore, we explore the use of an Asymmetric Barrier Lyapunov Function as a generalized approach that relaxes the requirements on the initial conditions. We also compare our control with one that is based on a Quadratic Lyapunov Function, and we show that our control requires less restrictive initial conditions. A numerical example is provided to illustrate the performance of the proposed control.
Absolute limits on image processing
Authors: David G. Brown, Robert F. Wagner, Mary Pastel Anderson
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The metrology of image processing for medical diagnostic imaging systems can be developed from two different approaches. One method involves the comparison of actual clinical efficacy of one processing scheme versus another. A paradigm for this approach is the ROC analysis technique outlined by Metz and by Swets. The second method, taking as its starting point axioms of information theory proposed by Shannon, calculates the performance of an ideal observer from the system imaging parameters for some idealized imaging task. Image processing can only improve the performance of the human observer up to that of the ideal observer, in the limit of "ideal" processing.
A Geometry Calibration and Visual Seamlessness Method Based on Multi-projector Tiled Display Wall
Authors: Ya-Hui Liu, Qing-Xuan Jia, Han-Xu Sun, Jin-Ling Zhang, Jie Su
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

Multi-projector virtual environment based on PC cluster has characteristics of low cost, high resolution and widely visual angle, which has become a research hotspot in Virtual Reality application. Geometric distortion calibration and seamless splicing is key problems in multi-projector display. The paper does research on geometry calibration method and edge blending. It proposes an automatic calibration preprocessing algorithm based on a camera, which projects images to the regions expected in terms of the relation between a plane surface and a curved surface and texture mapping method. In addition, overlap regions, which bring about intensity imbalance regions, may be adjusted by an edge blending function. Implementation indicates that the approach can accomplish geometry calibration and edge blending on an annular screen.
Polarities, quasi-symmetric designs, and Hamada's conjecture
Authors: Dieter Jungnickel, Vladimir D. Tonchev
Venue: Designs, Codes and Cryptography (2009)

We prove that every polarity of PG(2k &minus; 1,q), where k&ge; 2, gives rise to a design with the same parameters and the same intersection numbers as, but not isomorphic to, PG k (2k,q). In particular, the case k = 2 yields a new family of quasi-symmetric designs. We also show that our construction provides an infinite family of counterexamples to Hamada&rsquo;s conjecture, for any field of prime order p. Previously, only a handful of counterexamples were known.
Customizable Search Engine with Semantic and Resource Aggregation Capability
Authors: Sunil Movva, Rahul Ramachandran, Sara Graves, Helen Conover
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

There is a need for specialized search engines focused on specific disciplines that can use domain knowledge to guide the user to find exactly the resources they are searching for. In addition, these engines should be able search multiple and heterogeneous resource catalogs simultaneously and aggregate results from these catalogs. Noesis, a customizable search engine with semantic and resource aggregation capabilities is presented in this paper. The Noesis architecture has been designed to be modular, allowing it to be adapted by projects in different disciplines. This paper describes the Noesis architecture, highlights its application in several projects, and presents a user scenario for one of the projects is presented in this paper.
A quality of service aware cross-layer approach for wireless ad hoc networks with smart antennas
Authors: J. C. Mundarath, P. Ramanathan, B. D. Van Veen
Venue: Ad Hoc Networks (2009)

Recent technological advances have led to a growing interest in multi-antenna wireless ad hoc networks in which each node has more than one antenna. This paper proposes a cross-layer approach called QoS-aware smart antenna protocol (QSAP) for such networks that assures quality of service (QoS) needs of applications with reduced energy consumption. The proposed scheme adaptively allocates the degrees of freedom present in the multi-antenna system at each node to reduce the transmit energy while meeting the QoS needs of the application. The effectiveness of the proposed approach is demonstrated through simulations. The simulations show that the cross-layer aspects of the proposed approach result in considerable energy savings compared to schemes which meet the QoS needs without the cross-layer interaction.
Epistemic Strategies and Games on Concurrent Processes
Authors: Konstantinos Chatzikokolakis, Sophia Knight, Prakash Panangaden
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

We develop a game semantics for process algebra with two interacting agents. The purpose of our semantics is to make manifest the role of knowledge and information flow in the interactions between agents and to control the information available to interacting agents. We define games and strategies on process algebras, so that two independent agents interacting according to their strategies determine the execution of the process, replacing the traditional scheduler. We show that different restrictions on strategies represent different amounts of information being available to a scheduler. We also show that a certain class of strategies corresponds to the syntactic schedulers of Chatzikokolakis and Palamidessi, which were developed to overcome problems with traditional schedulers modelling interaction. The restrictions on these strategies have an explicit epistemic flavour.
MLeXAI: biomedical term classification
Authors: Vasile Rus, Ingrid Russell, Zdravko Markov
Venue: Journal of Computing Sciences in Colleges (2009)

Machine Learning is an important area of Artificial Intelligence which is generally applicable to almost any field of science. Early exposure of students to the potential of machine learning could have a positive impact on their attitude towards Artificial Intelligence in particular and computer science in general. In this paper, we present a semester long machine learning project that was incorporated in an Introduction to Artificial Intelligence course. An assessment of the impact of the project on students' learning of core concepts of Artificial Intelligence and on their plans to pursue more or advanced classes related to Artificial Intelligence is reported. The conclusion of our study is that the semester-long machine learning project had extremely positive effects on students learning and perception of Artificial Intelligence.
Mesh independent superlinear convergence of an inner-outer iterative method for semilinear elliptic interface problems
Authors: István Antal, János Karátson
Venue: Journal of Computational and Applied Mathematics (2009)

We propose the damped inexact Newton method, coupled with preconditioned inner iterations, to solve the finite element discretization of a class of nonlinear elliptic interface problems. The linearized equations are solved by a preconditioned conjugate gradient method. Both the inner and outer iterations exhibit mesh independent superlinear convergence.
Linear Programming Bounds for Codes via a Covering Argument
Authors: Michael Navon, Alex Samorodnitsky
Venue: Discrete Computational Geometry (2009)

We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to show, interpreting the following notions appropriately, that if a code has a large distance, then its dual has a small covering radius and, therefore, is large. This implies the original code to be small. We also point out that this bound is a natural isoperimetric constant of the Hamming cube, related to its Faber&#x2013;Krahn minima. While our approach belongs to the general framework of Delsarte&#x2019;s linear programming method, its main technical ingredient is Fourier duality for the Hamming cube. In particular, we do not deal directly with Delsarte&#x2019;s linear program or orthogonal polynomial theory.
Provenance for nested subqueries
Authors: Boris Glavic, Gustavo Alonso
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Data provenance is essential in applications such as scientific computing, curated databases, and data warehouses. Several systems have been developed that provide provenance functionality for the relational data model. These systems support only a subset of SQL, a severe limitation in practice since most of the application domains that benefit from provenance information use complex queries. Such queries typically involve nested subqueries, aggregation and/or user defined functions. Without support for these constructs, a provenance management system is of limited use. In this paper we address this limitation by exploring the problem of provenance derivation when complex queries are involved. More precisely, we demonstrate that the widely used definition of Why-provenance fails in the presence of nested subqueries, and show how the definition can be modified to produce meaningful results for nested subqueries. We further present query rewrite rules to transform an SQL query into a query propagating provenance. The solution introduced in this paper allows us to track provenance information for a far wider subset of SQL than any of the existing approaches. We have incorporated these ideas into the Perm provenance management system engine and used it to evaluate the feasibility and performance of our approach.