ppxscal/embedding_network huggingface dataset:
Proceedings of the 14th International Conference on 3D Web Technology
Authors: Stephen N. Spencer
Venue: 3D technologies for the World Wide Web (2009)

Welcome to Web3D 2009 --- the fourteenth Symposium on 3D Web Technologies, taking place in Darmstadt, Germany, June 16th-17th, 2009. The Web3D 2009 is a continuation of the series of symposia bringing together professionals and enthusiasts from both the industry and the academia to share results of their research and development work, exchange experiences and ideas, and collaborate on development of new methods, models, standards and tools for building interactive 3D applications on the Web. Overall, 42 papers covering a wide range of topics were submitted to the symposium. Due to high quality of the submissions, 24 papers (57%) have been accepted for publication in these proceedings. The papers have been grouped into six thematic sessions: Haptics and Interaction, Rendering and Media Integration, Cameras and Narrativity, Semantics and Data Models, Geospatial Applications, and 3D Web Applications.
Linear Estimation and Detection in Krylov Subspaces, 1st edition
Authors: Guido K. E. Dietl
Venue: Foundations In Signal Processing, Communications And Networking (2007)

This book focuses on the foundations of linear estimation theory which is essential for effective signal processing. In its first part, it gives a comprehensive overview of several key methods like reduced-rank signal processing and Krylov subspace methods of numerical mathematics. Based on the derivation of the multistage Wiener filter in its most general form, the relationship between statistical signal processing and numerical mathematics is presented. In the second part, the theory is applied to iterative multiuser detection receivers (Turbo equalization) which are typically desired in wireless communications systems. The investigations include exact computational complexity considerations and performance analysis based on extrinsic information transfer charts as well as Monte-Carlo simulations.
Visual Design for the Modern Web, 1st edition
Authors: Penny McIntire
Venue:  (2007)

Just as great artists must understand their tools, great Web designers must understand the technology behind their art. In Visual Design for the Web, author Penny McIntire shows novice Web designers how to use their tools--including HTML, CSS, and JavaScript--in conjunction with the principles of aesthetics and usability to become masters of their craft. Chapters begin with explanations of the terminology and techniques of web structures, then demonstrate how to apply the rules of design to create beautiful sites. The book:Illustrates how fundamental principles of design apply to the webIncludes charts, diagrams, and graphics to enhance learning and retentionCovers site analysis, navigation, layout, color, graphics, typography and formsDemonstrates multiple techniques for getting just the right look and feel for your web sitesFocuses on the characteristics that make sites usable, engaging, and memorable 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
SDCC: A New Stable Double-Centroid Clustering Technique Based on K-Means for Non-spherical Patterns
Authors: Juifang Chang
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

Numerous existing partitioning clustering algorithms, such as K-means, are developed to discover clusters that fit some of the static models. These algorithms may fail if it chooses a set of incorrect parameters in the static model with respect to the objects being clustered, or when the objects consist of patterns that are of non-spherical or not the same size. Furthermore, they could produce an instable result. This investigation presents a new partition clustering algorithm named SDCC, which can improve the problem of instable results in partitioning-based clustering, such as K-means. As a hybrid approach that utilizes double-centroid concept, the proposed algorithm can eliminate the above-mentioned drawbacks to produce stable results while recognizing the non-spherical patterns and clusters that are not the same size. Experimental results illustrate that the new algorithm can identify non-spherical pattern correctly, and efficiently reduces the problem of long computational time when applying KGA and GKA. It also indicates that the proposed approach produces much smaller errors than K-means, KGA and GKA approaches in most cases examined herein.
Towards Automatic Model Generation by Optimization
Authors: Per Nyblom, Patrick Doherty
Venue: Proceeding of the 2008 conference on Tenth Scandinavian Conference on Artificial Intelligence: SCAI 2008 (2008)

The problem of automatically selecting simulation models for autonomous agents depending on their current intentions and beliefs is considered in this paper. The intended use of the models is for prediction, filtering, planning and other types of reasoning that can be performed with simulation models. The parameters and model fragments of the resulting model are selected by formulating and solving a hybrid constrained optimization problem that captures the intuition of the preferred model when relevance information about the elements of the world being modelled is taken into consideration. A specialized version of the original optimization problem is developed that makes it possible to solve the continuous subproblem analytically in linear time. A practical model selection problem is discussed where the aim is to select suitable parameters and models for tracking dynamic objects. Experiments with randomly generated problem instances indicate that a hillclimbing search approach might be both efficient and provides reasonably good solutions compared to simulated annealing and hillclimbing with random restarts.
A parallel preconditioner for octree meshes
Authors: John R. Gilbert
Venue:  (2008)

Fully adaptive octree grids are a promising development in the solution of fluid flow problems. While fully adaptive grids make it easier to discretize the domain, solving the linear system is harder, due to the linear system being unsymmetric. Researchers would find it beneficial to solve large systems of equations with such grids, to simulate phenomena that occur at very fine grid spacing.In this work, we develop an octree grid generator which is meant to be a general purpose prototyping framework for researchers interested in octree grids. Using the grid generator, we analyze the structure of fully-adaptive octree grids to identify their salient properties. We evaluate various methods of solving linear systems arising from these grids and find iterative linear solvers like BiCGSTAB to be the most promising. We demonstrate that the performance of iterative solvers is improved considerably by the use of no-fill incomplete factors.We demonstrate that for large octree grids, the preconditioner forms the dominant computation that limits the performance of iterative linear systems on parallel machines. To attempt to speed up the performance of the preconditioner, we exploit the graph structure of the octree grids to develop a novel coloring. This coloring leads to an upper bound on the chromatic number of octree grids for the Poisson problem. Using this coloring, we develop a triangular solver that shows good performance on parallel computers. We demonstrate the performance of the triangular solver as a preconditioner for the BiCGSTAB iteration, which greatly improves the performance of the linear system for these grids.
Experimental study of geometric t-spanners
Authors: Mohammad Farshi, Joachim Gudmundsson
Venue: Journal of Experimental Algorithmics (JEA) (2009)

The construction of t-spanners of a given point set has received a lot of attention, especially from a theoretical perspective. In this article, we experimentally study the performance and quality of the most common construction algorithms for points in the Euclidean plane. We implemented the most well-known t-spanner algorithms and tested them on a number of different point sets. The experiments are discussed and compared to the theoretical results, and in several cases, we suggest modifications that are implemented and evaluated. The measures of quality that we consider are the number of edges, the weight, the maximum degree, the spanner diameter, and the number of crossings. This is the first time an extensive comparison has been made between the running times of construction algorithms of t-spanners and the quality of the generated spanners.
Automatic detection of dimension errors in spreadsheets
Authors: Chris Chambers, Martin Erwig
Venue: Journal of Visual Languages and Computing (2009)

We present a reasoning system for inferring dimension information in spreadsheets. This system can be used to check the consistency of spreadsheet formulas and thus is able to detect errors in spreadsheets. Our approach is based on three static analysis components. First, the spatial structure of the spreadsheet is analyzed to infer a labeling relationship among cells. Second, cells that are used as labels are lexically analyzed and mapped to potential dimensions. Finally, dimension information is propagated through spreadsheet formulas. An important aspect of the rule system defining dimension inference is that it works bi-directionally, that is, not only ''downstream'' from referenced arguments to the current cell, but also ''upstream'' in the reverse direction. This flexibility makes the system robust and turns out to be particularly useful in cases when the initial dimension information that can be inferred from headers is incomplete or ambiguous. We have implemented a prototype system as an add-in to Excel. In an evaluation of this implementation we were able to detect dimension errors in almost 50% of the investigated spreadsheets, which shows (i) that the system works reliably in practice and (ii) that dimension information can be well exploited to uncover errors in spreadsheets.
Degradation dynamics and breakdown of MgO gate oxides
Authors: E. Miranda, E. O'Connor, G. Hughes, P. Casey, K. Cherkaoui, S. Monaghan, R. Long, D. O'Connell, P. K. Hurley
Venue: Microelectronic Engineering (2009)

The degradation dynamics of magnesium oxide (MgO) layers in MOS structures has been investigated. It is shown that the shift of the conduction characteristics caused by both ramped and constant voltage stresses is well described by power-law models and that the signature of charge trapping is still visible even after the dielectric breakdown (BD) of the insulating film. The occurrence of progressive BD in 20-nm thick films is also reported.
FIMA: A Flexible Instructional Design Support Multi-Agent System
Authors: Toshinobu Kasai, Haruhisa Yamaguchi, Kazuo Nagano, Riichiro Mizoguchi
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

In Japan, the “Period of Integrated Study” program for elementary and secondary education emphasizes cultivating students' abilities to cope with various problems in daily life. Most goals of this program involve meta-ability, which cannot be fully learned by traditional Japanese instructional methods. For this reason, it is necessary and important to provide teachers with a powerful help system that can support them in designing instruction for enhancing students' meta-ability. In this paper, we propose a FIMA (Flexible Instructional design support Multi-Agent System) and describe its architecture, which complies with the FIPA specifications.
Analyzing stratified spaces using persistent versions of intersection and local homology
Authors: John Harer
Venue:  (2008)

This dissertation places intersection homology and local homology within the framework of persistence, which was originally developed for ordinary homology by Edelsbrunner, Letscher, and Zomorodian. The eventual goal, begun but not completed here, is to provide analytical tools for the study of embedded stratified spaces, as well as for high-dimensional and possibly noisy datasets for which the number of degrees of freedom may vary across the parameter space. Specifically, we create a theory of persistent intersection homology for a filtered stratified space and prove several structural theorems about the pair groups associated to such a filtration. We prove the correctness of a cubic algorithm which computes these pair groups in a simplicial setting. We also define a series of intersection homology elevation functions for an embedded stratified space and characterize their local maxima in dimension one. In addition, we develop a theory of persistence for a multi-scale analogue of the local homology groups of a stratified space at a point. This takes the form of a series of local homology vineyards which allow one to assess the homological structure within a one-parameter family of neighborhoods of the point. Under the assumption of dense sampling, we prove the correctness of this assessment at a variety of radius scales.
continual service improvement using balanced scorecard
Authors: Dzenana Donko, Ismet Traljic
Venue: Proceedings of the 8th Wseas international conference on Telecommunications and informatics (2009)

This paper studied perspectives of Balanced Scorecard and how they can be used to align Service Operation as the part of IT Service Lifecycle with business strategy in a service provider company. An organization framework based on Balanced Scorecard is presented. Objectives and indicators that are linked to the Service Operation processes and functions are identified and they are mapped to the particular performance key indicators and performance management process. The final result is identification of quantitative approach for identification of possible loss caused by poor performance of service management and understanding of complex interdependency between IT services and business processes.
The Digital Wallet: Opportunities and Prototypes
Authors: Rajesh Krishna Balan, Narayan Ramasubbu
Venue: Computer (2009)

Example digital wallet applications support secure P2P mobile cash transactions and alleviate point-of-sale confusion for consumers using multiple payment, discount, and loyalty cards.
Web site evaluation index: a systematic methodology and a metric system for the assessment of the quality of web sites
Authors: Dimitrios Xanthidis, Paris Argyrides, David Nicholas
Venue: Proceedings of the 8th Wseas international conference on Telecommunications and informatics (2009)

In a previous paper the authors introduced a template for the evaluation of web sites. This was tested using a sample of a number of Greek companies' web sites and it proved to be useful enough as a general evaluation tool. Soon thereafter the authors realized the need to come up with a measurement and a metric system as a step ahead of that evaluation template. The WSEI (Web Site Evaluation Index) can be used not just to evaluate if a website is good or not, but also, how good it is especially when compared with other of similar quality.
The Two-Variable Situation Calculus
Authors: Yilan Gu, Mikhail Soutchanski
Venue: Proceeding of the 2006 conference on STAIRS 2006: Proceedings of the Third Starting AI Researchers' Symposium (2006)

We consider a modified version of the situation calculus built using a two-variable fragment of the first-order logic extended with counting quantifiers. We mention several additional groups of axioms that need to be introduced to capture taxonomic reasoning. We show that the regression operator in this framework can be defined similarly to regression in the Reiter's version of the situation calculus. Using this new regression operator, we show that the projection problem (that is the main reasoning task in the situation calculus) is decidable in the modified version. We mention possible applications of this result to formalization of Semantic Web services.
Computer-Mediated Face-to-Face Interaction Supporting for Peer Tutoring
Authors: Ya-Wei Chang, Emily Ching, Chih-Ti Chen, Tak-Wai Chan
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)

It has already been proven that peer tutoring is an effective way to engage students in learning. However, without technology support, it can be difficult to conduct peer tutoring program in a classroom. We propose a system called P3T that supports peer tutoring in one-to-one digital learning environment. P3T facilitates peer tutoring by scaffolding both tutors and tutees to prepare for the tutorial session and facilitating their elaborations during the face-to-face tutoring. An experiment was executed to test if the P3T system can help the activity go more smoothly than those without P3T system. This paper discusses the design of P3T models and system, and reports what is found in our experiment.
Foreign Exchange Rates Forecasting with a C-Ascending Least Squares Support Vector Regression Model
Authors: Lean Yu, Xun Zhang, Shouyang Wang
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

In this paper, a modified least squares support vector regression (LSSVR) model, called C-ascending least squares support vector regression (C-ALSSVR), is proposed for foreign exchange rates forecasting. The generic idea of the proposed C-ALSSVR model is based on the prior knowledge that different data points often provide different information for modeling and more weights should be given to those data points containing more information. The C-ALSSVR can be obtained by a simple modification of the regularization parameter in LSSVR, whereby more weights are given to the recent least squares errors than the distant least squares errors while keeping the regularized terms in its original form. For verification purpose, the performance of the C-ALSSVR model is evaluated using three typical foreign exchange rates. Experimental results obtained demonstrated that the C-ALSSVR model is very promising tool in foreign exchange rates forecasting.
Fingerprint Matching Based on Neighboring Information and Penalized Logistic Regression
Authors: Kai Cao, Xin Yang, Jie Tian, Yangyang Zhang, Peng Li, Xunqiang Tao
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

This paper proposes a novel minutiae-based fingerprint matching algorithm. A fingerprint is represented by minutiae set and sampling points on all ridges. Therefore, the foreground of a fingerprint image can be accurately estimated by the sampling points. The similarity between two minutiae is measured by two parts: neighboring minutiae which are different in minutiae pattern and neighboring sampling points which are different in orientation and frequency. After alignment and minutiae pairing, Nine features are extracted to represent the matching status and penalized logistic regression (PLR) is adopted to calculate the matching score. The proposed algorithm is evaluated on fingerprint databases of FVC2002 and compared with the participants in FVC 2002. Experimental results show that the proposed algorithm achieves good performance and ranks 5th according to average equal error rate.
On topological properties of generalized rough sets
Authors: Michiro Kondo
Venue: Proceeding of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005 (2005)

In this note we consider topological properties of generalized rough sets. In any approximation space (X,R) of a generalized rough set we show that 1. If R is reflexive, then the set OR={A⊆X|R-(A)=A} defined by R-is a topology on X; 2. If R is reflexive and symmetric, then the topology OR has the following property (Clop) A : open A : closed 3. Conversely, for any topology O with (Clop), there is a reflexive and symmetric relation R on X such that O=OR.
Discover SAP, 1st edition
Authors: Nancy Muir, Ian Kimbell
Venue:  (2007)

Are you new to SAP and want to learn more about it? Are you a decision-maker, consultant, or manager, who needs to gain a holistic understanding of SAP? If so, this book is for you. This practical, reader-friendly guide for busy professionals provides insight into SAP's history, vision, and strategies. You'll learn about the key areas of SAP, including Financials, CRM, SAP NetWeaver, enterprise SOA, Business Intelligence, and more. Discover the Overall SAP Landscape Gain a solid understanding about SAP the company and its suite of products by exploring the company history and future plans. Explore Core SAP Applications Learn how to benefit from SAP products, including Financials, CRM, HCM, SCM, SRM, Analytics, and the Small to Midsize Business offerings (SAP Business One, SAP Business All-in-One, and SAP Business By Design). Understand the SAP Technology Platform Explore the details of SAP's Enterprise Service-Oriented Architecture (Enterprise SOA) approach, and the technology that enables it SAP NetWeaver. Learn How SAP Works in the Real World Case studies show you how SAP products and solutions are used in real-world companies, and notes and tips demystify the features of SAP's products. Navigate Topics as You Like Read the book by chapter or from start to finish, and take advantage of the useful glossary, SAP roadmaps, and Web resources. Highlights:Enterprise Computing Financials Human Capital Management Customer Relationship Management Supplier Relationship Management Strategy for Small to Midsize Businesses SAP xApps and Composite Applications Duet and SAP Interactive Forms by Adobe Governance, Risk, and Compliance SAP Implementation Support SAP NetWeaver and Enterprise SOA
Mixed deterministic and probabilistic networks
Authors: Robert Mateescu, Rina Dechter
Venue: Annals of Mathematics and Artificial Intelligence (2008)

The paper introduces mixed networks, a new graphical model framework for expressing and reasoning with probabilistic and deterministic information. The motivation to develop mixed networks stems from the desire to fully exploit the deterministic information (constraints) that is often present in graphical models. Several concepts and algorithms specific to belief networks and constraint networks are combined, achieving computational efficiency, semantic coherence and user-interface convenience. We define the semantics and graphical representation of mixed networks, and discuss the two main types of algorithms for processing them: inference-based and search-based. A preliminary experimental evaluation shows the benefits of the new model.
Solving the fuzzy shortest path problem on networks by a new algorithm
Authors: Sadollah Ebrahimnejad, Reza Tavakoli-Moghaddam
Venue: Proceedings of the 10th WSEAS international conference on Fuzzy systems (2009)

In This paper we presentes the fuzzy shortest path (FSP) problem to find the best fuzzy path among other fuzzy paths sets. To solve this problem, we propose a new and efficient algorithm, based on a new definition of an ideal fuzzy set (IFS), in order to find the shortest path. Further, we extend this algorithm for a fuzzy network problem consisting of three criteria: time, cost, and quality risk of activities. Some numerical examples are illustrated and the experimental results are then compared against the fuzzy minimum algorithm with reference to the multiple labeling algorithm, based on the similarity degree, to show the efficiency of the proposed algorithm. Our computational results and statistical analyses suggest that our proposed algorithm outperforms the fuzzy minimum algorithm.