ppxscal/embedding_network huggingface dataset:
An analytical approach to single scattering for anisotropic media and light distributions
Authors: Vincent Pegoraro, Mathias Schott, Steven G. Parker
Venue: Proceedings of Graphics Interface 2009 (2009)

Despite their numerous applications, efficiently rendering participating media remains a challenging task due to the intricacy of the radiative transport equation. While numerical techniques remain the method of choice for addressing complex problems, a closed-form solution to the air-light integral in optically thin isotropic media was recently derived. In this paper, we extend this work and present a novel analytical approach to single scattering from point light sources in homogeneous media. We propose a combined formulation of the air-light integral which allows both anisotropic phase functions and light distributions to be adequately handled. The technique relies neither on precomputation nor on storage, and we provide a robust and efficient implementation allowing for an explicit control on the accuracy of the results. Finally, the performance characteristics of the method on graphics hardware are evaluated and demonstrate its suitability to real-time applications.
Model-Driven Development for Enabling the Feadback from Warehouses and OLAP to Operational Systems
Authors: Lina Nemuraite, Jurgita Tonkunaite, Bronius Paradauskas
Venue: Proceeding of the 2007 conference on Databases and Information Systems IV: Selected Papers from the Seventh International Baltic Conference DB&IS'2006 (2007)

The goal of this paper is to demonstrate how interfaces of Data Warehouses and OLAP may be used in holistic Model-driven development process of applications of enterprise. Traditionally, the main responsibilities of Data Warehouses and OLAP are concerned with relation to data analyzing and reporting activities. However, the real power of data analysis lies in possibility to support dynamic formulation of queries and analyzable data structures to respond to emerging needs of users and other applications of enterprise and the Web. From the business goals and processes viewpoint, there is no difference between operational systems and Data Warehouses/OLAP. The proposed Model-driven methodology brings possibility to automate development of enterprise applications extended with analytical capabilities, incorporating feedback from OLAP tools into computerized business processes, and tendering analysis results for business improvement. Proposed metamodels and transformations are extension of our previous work, which was focused on generating normalized multidimensional data models on demand. In this paper, wider possibilities to obtaining well-formed warehouse schemas, ensuring completeness of warehouse data, and using them in Model-driven development process are considered. The work is supported by Lithuanian State Science and Studies Foundation according to Eureka programme project “IT-Europe” (Reg. No 3473).
Electrical properties of atomic-layer-deposited La2O3 films using a novel La formamidinate precursor and ozone
Authors: B. Lee, T. J. Park, A. Hande, M. J. Kim, R. M. Wallace, J. Kim, X. Liu, J. H. Yi, H. Li, M. Rousseau, D. Shenai, J. Suydam
Venue: Microelectronic Engineering (2009)

La"2O"3 films were grown by atomic layer deposition technique using a novel formamidinate precursor, tris(N,N'-diisopropylformamidinato) lanthanum [La(^iPrfAMD)"3], with H"2O and O"3 as an oxidant. La"2O"3 films grown with H"2O in the film exhibited a parasitic chemical vapor deposition type growth possibly due to a La(OH)"x component. However, the use of O"3 as the oxidant revealed a stable ALD process window. A post-deposition annealing (PDA) of the deposited La"2O"3 films using O"3 significantly reduces leakage current density by four orders of magnitude relative to as-deposited samples. The dielectric constant of La"2O"3 films with a TaN metal gate is found to be ~29, which is higher than reported values for CVD and ALD La"2O"3 films.
Citation analysis for e-government research
Authors: Nuša Erman
Venue: Proceedings of the 10th Annual International Conference on Digital Government Research: Social Networks: Making Connections between Citizens, Data and Government (2009)

Various research papers question and analyze the maturity of the e-government research area and its stance as a scientific discipline. The common conclusion of these papers is the exposure of the deficiency in common research methodology in the EGR field. However, this lack of common methods characterizes the papers that analyze the field as well. The aim of this paper is to propose a common methodology for the research of the EGR field in social network and citation analysis terms. The paper introduces and describes a data set that allows for such analysis and outlines the prospects for further research.
Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem
Authors: Simon Görtz, Andreas Klose
Venue: Journal of Heuristics (2009)

The single-sink fixed-charge transportation problem (SSFCTP) consists of finding a minimum cost flow from a number of nodes to a single sink. Beside a cost proportional to the amount shipped, the flow cost encompass a fixed charge. The SSFCTP is an important subproblem of the well-known fixed-charge transportation problem. Nevertheless, just a few methods for solving this problem have been proposed in the literature. In this paper, some greedy heuristic solutions methods for the SSFCTP are investigated. It is shown that two greedy approaches for the SSFCTP known from the literature can be arbitrarily bad, whereas an approximation algorithm proposed in the literature for the binary min-knapsack problem has a guaranteed worst case bound if adapted accordingly to the case of the SSFCTP.
Distributed data collection: archiving, indexing, and analysis
Authors: Prashant Shenoy
Venue:  (2008)

As computing hardware becomes more powerful and systems become bigger, the amount of data we can collect within a system grows seemingly without bounds. These systems share a common characteristic: the volume of raw data available is far higher than can be handled by the application or user. The key problem is thus to identify some small amount of data which is of interest, obtaining it and presenting it to the user. In this thesis we examine distributed data collection environments, and advocate data-aware and storage-centric approaches. Collected raw data is stored within the network, and only the most relevant information is presented to the application. We apply two strategies: (i) archiving, indexing and querying to retrieve discrete portions of data, and (ii) mathematical modeling to extract relationships spread more diffusely across the data. We propose mechanisms for archiving, indexing, and analysis, and describe them in the context of systems incorporating them. First we address storage and indexing of high-speed event data in a resource-rich environment. A disk-based storage system operates on commodity hardware, yet guarantees writing at high rates to avoid loss. A signature file-based index allows indexing of high-speed data in real time, for efficient ad hoc querying. A network monitoring system based on these mechanisms is presented and evaluated. Next we leverage the resources of a few resource-rich systems within a resource-constrained environment to index and route queries to remote sensors. These sensors send summaries of stored data to more capable proxy nodes, which use a novel search structure, the Interval Skip Graph, representing multiple records by a single imprecise key. We present a prototype implementation of a sensor network storage system based on these mechanisms. Lastly we address analysis and model-building from feature-rich but poorly structured events. In our approach, statistical machine learning techniques are used to build models of application and system behavior in a data center, relying on an automated feature identification mechanism to identify model inputs from within the raw data stream. We present and evaluate Modellus , a data center monitoring and analysis system based on these mechanisms.
Robot assisted localization of sensor networks guided by rigidity
Authors: Saroja Kanchi, Changhua Wu
Venue: Proceedings of the 4th Annual International Conference on Wireless Internet (2008)

In this paper, we propose a robot assisted localization guided by rigidity checking. For a network to be localizable, it must be rigid, which means given the existing edge constraints, there is only one location for each node in it. Many networks, however, are not rigid. To localize these nonrigid network, a robot can be used to add additional distance measure between nodes so that the network becomes rigid and localizable. To facilitate the localization and reduce the travel cost of the robot, the rigid subregions of the network are first identified. The identification of rigid subregions provides a guide for the movement of robots. A brief introduction to rigidity theory is presented in this paper. Experiments that evaluate the performance of the proposed approach are presented. The experimental results prove that the proposed approach is sound and gives excellent results compared to previous approaches for localization.
Variational iteration method for Sturm-Liouville differential equations
Authors: D. Altıntan, Ö. Uğur
Venue: Computers Mathematics with Applications (2009)

In this article, He's variational iteration method is applied to linear Sturm-Liouville eigenvalue and boundary value problems, including the harmonic oscillator. In this method, solutions of the problems are approximated by a set of functions that may include possible constants to be determined from the boundary conditions. By computing variations, the Lagrange multipliers are derived and the generalised expressions of variational iterations are constructed. Numerical results show that the method is simple, however powerful and effective.
Modeling and Computations in Electromagnetics: A Volume Dedicated to Jean-Claude Ndlec, 1st edition
Authors: Habib Ammari
Venue:  (2007)

Modeling and computations in electromagnetics is a quite novel and growing discipline, expanding as a result of the steadily increasing demand for designing electrical devices, modeling electromagnetic materials, and simulating electromagnetic fields in nanoscale structures. The aim of this volume is to bring together prominent worldwide experts to review state-of-the-art developments and future trends of modeling and computations in electromagnetics. This volume is devoted to merging the expertise of scientists working in this dynamic discipline, and to raising interest for challenging issues. The most significant advances in computational techniques have been made only in the last few years, and several challenging technological applications are presented in this volume. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Ruby Programming for the Absolute Beginner, 1st edition
Authors: Jerry Lee Ford,  Jr.
Venue:  (2007)

Want to learn the fundamentals of Ruby programming but arent sure where to start? Look no further! Ruby is a free, easy-to-learn, yet powerful scripting programming language that can run on any operating system. These attributes have made Ruby an extremely popular language in recent years for almost any programming task. Ruby Programming for the Absolute Beginner teaches you the basics of computer programming with Ruby through the creation of simple computer games. Not only will this learn by doing approach provide you with an instant sense of accomplishment, but its also a fun way to learn. In addition to learning Ruby, youll also learn the basics of computer programming, so youll have a solid foundation from which you can confidently jump to other programming languages. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Equivalence of SQL queries in presence of embedded dependencies
Authors: Rada Chirkova, Michael R. Genesereth
Venue: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2009)

We consider the problem of finding equivalent minimal-size reformulations of SQL queries in presence of embedded dependencies [1]. Our focus is on select-project-join (SPJ) queries with equality comparisons, also known as safe conjunctive (CQ) queries, possibly with grouping and aggregation. For SPJ queries, the semantics of the SQL standard treats query answers as multisets (bags), whereas the stored relations are treated either as sets, which is called bag-set semantics, or as bags, which is called bag semantics. (Under set semantics, both query answers and stored relations are treated as sets.) In the context of the above Query-Reformulation Problem, we develop a comprehensive framework for equivalence of CQ queries under bag and bag-set semantics in presence of embedded dependencies, and make a number of conceptual and technical contributions. Specifically, we develop equivalence tests for CQ queries in presence of arbitrary sets of embedded dependencies under bag and bag-set semantics, under the condition that chase [10] under set semantics (set-chase) on the inputs terminates. We also present equivalence tests for CQ queries with grouping and aggregation in presence of embedded dependencies. We use our equivalence tests to develop sound and complete (whenever set-chase on the inputs terminates) algorithms for solving instances of the Query-Reformulation Problem with CQ queries under each of bag and bag-set semantics, as well as for instances of the problem with aggregate queries. Our contributions are clearly applicable beyond the Query-Reformulation Problem considered in this paper. Specifically, the results of this paper can be used in developing algorithms for rewriting CQ queries and queries in more expressive languages (e.g., including grouping and aggregation, or arithmetic comparisons) using views in presence of embedded dependencies, under bag or bag-set semantics for query evaluation.
Shape and texture clustering: Best estimate for the clusters number
Authors: Mohammad Reza Daliri, Vincent Torre
Venue: Image and Vision Computing (2009)

The most difficult problem in automatic clustering is the determination of the total number of final clusters N"c"l"u"s"t"e"r. In the present paper, a new method for finding N"c"l"u"s"t"e"r is proposed and is compared with previously developed methods. The proposed method is based on the minimization of the functional @q(N"c"l"u"s"t"e"r)=@aN"c"l"u"s"t"e"r+@b@?iN"c"l"u"s"t"e"r1n"i+1N"c"l"u"s"t"e"r@?i=1N"c"l"u"s"t"e"rdist(C"i) where n"i is the number of shapes and textures in cluster C"i, dist(C"i) is the intra-cluster distance and @a and @b are two parameters controlling the grain of the clustering. The proposed method provides almost perfect clustering for the Kimia-25, Kimia-99, MPEG-7 shape databases, subset of Brodatz, full Brodatz and UIUCTex texture databases and provides better results than all previously proposed methods for automatic clustering.
Modeling for dynamic aspect-oriented development
Authors: Farhana Eva Alam, Joerg Evermann, Adrian Fiech
Venue: Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering (2009)

Aspect Oriented Software Development (AOSD) has its roots in the need to deal with requirements that cut across the primary modularization of a software system. On the programming level, mature, industrial-strength tools like the de-facto standard AspectJ exist. However, on the modeling level, there is as yet little support for AOSD. Building on previous work, this paper develops UML modeling support for dynamic AOSD, using standard UML extension mechanisms. We present a generic profile that allows existing UML tools to express AOSD models. We also provide automatic code generation into AspectS, an aspect extension to Smalltalk, and AspectML, an aspect oriented flavor of the ML language. Examples throughout the paper illustrate our approach.
Extending the Soar Cognitive Architecture
Authors: John E. Laird
Venue: Proceeding of the 2008 conference on Artificial General Intelligence 2008: Proceedings of the First AGI Conference (2008)

One approach in pursuit of general intelligent agents has been to concentrate on the underlying cognitive architecture, of which Soar is a prime example. In the past, Soar has relied on a minimal number of architectural modules together with purely symbolic representations of knowledge. This paper presents the cognitive architecture approach to general intelligence and the traditional, symbolic Soar architecture. This is followed by major additions to Soar: non-symbolic representations, new learning mechanisms, and long-term memories.
Data Mining Approach to Analysis of Computer Logs Using New Patterns
Authors: Krzysztof Cabaj
Venue: Proceeding of the 2008 conference on New Trends in Multimedia and Network Information Systems (2008)

Due to the huge amount of currently collected data, only computer methods are able to analyze it. Data Mining techniques could be used for this purpose, but most of currently used techniques discovering global patterns loose information about local changes. In this paper the new patterns are proposed: frequent events and groups of events in data stream. They have two advantages: information about local changes in distribution of patterns is obtained and the number of discovered patterns is smaller than in other methods. Described experiments prove that patterns give valuable knowledge, for example, in analysis of computer logs. Analysis of firewall logs reveals interest of user, its favourite web pages and used portals. By using described methods for analysis of HoneyPot logs, detailed knowledge about malicious code and time of its activity could be received. Additionally, information about infected machines IP addresses and authentication data is automatically discovered.
Principal Manifolds for Data Visualization and Dimension Reduction, 1st edition
Authors: Alexander N. Gorban, Balzs Kgl, Donald C. Wunsch, Andrei Zinovyev
Venue:  (2007)

In 1901, Karl Pearson invented Principal Component Analysis (PCA). Since then, PCA serves as a prototype for many other tools of data analysis, visualization and dimension reduction: Independent Component Analysis (ICA), Multidimensional Scaling (MDS), Nonlinear PCA (NLPCA), Self Organizing Maps (SOM), etc. The book starts with the quote of the classical Pearson definition of PCA and includes reviews of various methods: NLPCA, ICA, MDS, embedding and clustering algorithms, principal manifolds and SOM. New approaches to NLPCA, principal manifolds, branching principal components and topology preserving mappings are described as well. Presentation of algorithms is supplemented by case studies, from engineering to astronomy, but mostly of biological data: analysis of microarray and metabolite data. The volume ends with a tutorial "PCA and K-meansdecipher genome". The book is meant to be useful for practitioners in applied data analysis in life sciences, engineering, physics and chemistry; it will also be valuable to PhD students and researchers in computer sciences, applied mathematics and statistics.
Surface Mapping Using Consistent Pants Decomposition
Authors: Xin Li, Xianfeng Gu, Hong Qin
Venue: IEEE Transactions on Visualization and Computer Graphics (2009)

Surface mapping is fundamental to shape computing and various downstream applications. This paper develops a pants decomposition framework for computing maps between surfaces with arbitrary topologies. The framework first conducts pants decomposition on both surfaces to segment them into consistent sets of pants patches (a pants patch is intuitively defined as a genus-0 surface with three boundaries), then composes global mapping between two surfaces by using harmonic maps of corresponding patches. This framework has several key advantages over existing techniques. First, it is automatic. It can automatically construct mappings for surfaces with complicated topology, guaranteeing the one-to-one continuity. Second, it is general and powerful. It flexibly handles mapping computation between surfaces with different topologies. Third, it is flexible. Despite topology and geometry, it can also integrate semantics requirements from users. Through a simple and intuitive human-computer interaction mechanism, the user can flexibly control the mapping behavior by enforcing point/curve constraints. Compared with traditional user-guided, piecewise surface mapping techniques, our new method is less labor intensive, more intuitive, and requires no user's expertise in computing complicated surface maps between arbitrary shapes. We conduct various experiments to demonstrate its modeling potential and effectiveness.
A Guided Tour of Creative Suite 3 Design Standard, 1st edition
Authors: Chris Botello
Venue:  (2007)

This CD of movie tutorials will help you get up to speed quickly on the new Creative Suite 3 from Adobe. You'll learn the key information about the CS3 suite, and explore features of Photoshop, InDesign, and Illustrator. Engaging, interactive movie tutorials are presented by Adobe expert and author Chris Botello. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Optimization of Structural Systems and Industrial Applications: Computer Aided Optimum Design of Structures 91, 1st edition
Authors: S. Robert Hernandez, C. A. Brebbia
Venue:  (2007)

Papers presented at the Second International Conference on Computer Aided Optimum Design of Structures, sponsored by the Wessex Institute of Technology, and held at Cambridge, MA, USA, June 1991.
Detailed author index
Authors: Dimitri Van Landuyt, Eddy Truyen, Wouter Joosen
Venue: Proceedings of the 2009 ICSE Workshop on Aspect-Oriented Requirements Engineering and Architecture Design (2009)

Domain-driven aspect design aims to support effective reuse of aspects within a product-line or family of software systems. In this paper, we explore the feasibility of automating our approach to discover stable domain abstractions in requirements for the purpose of defining reusable pointcuts. This approach was introduced in earlier work mainly as a manual method. This paper defines an algorithmic procedure for each activity, and discusses to which degree each activity can be automated. The generalization activity (activity 3) is given specific attention, as it is the most complex activity at the heart of the approach. The end result is an algorithmic procedure for (semi-)automatically discovering stable domain abstractions to design effectively reusable pointcuts.
Using Self-response System and Online Learning Environment to Promote Science Learning in A Large College Class
Authors: BaoHui Zhang, Ronald Patterson, Gail Richmond, Joyce Parker, John Merrill, Mark Urban-Lurain, Scott Rollins, Everett Weber, Tammy Long
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

How can large undergraduate classes be made more interactive? How can students be engaged to think deeply and to gain conceptual understanding of course content? This paper describes a Peer Instruction and Model-based Reasoning approach to address these questions. We describe an instructional design and present empirical data to show how two learning technologies: an online teaching and research tool (www.lon-capa) and a self-response system (clickers) were used in an introductory undergraduate biology course (N=448). Implication for how to adopt this type of technology for teaching and research purposes are also provided.