ppxscal/embedding_network huggingface dataset:
Determination of a matrix function using the divided difference method of Newton and the interpolation technique of Hermite
Authors: Mehdi Dehghan, Masoud Hajarian
Venue: Journal of Computational and Applied Mathematics (2009)

Computing a function f(A) of an n-by-n matrix A is a frequently occurring problem in control theory and other applications. In this paper we introduce an effective approach for the determination of matrix function f(A). We propose a new technique which is based on the extension of Newton divided difference and the interpolation technique of Hermite and using the eigenvalues of the given matrix A. The new algorithm is tested on several problems to show the efficiency of the presented method. Finally, the application of this method in control theory is highlighted.
Knowledge Acquisition within a Network of Industrial Laboratories Performing Quality Specifications Testing
Authors: Panayiotis Fotilas, Athanassios F. Batzias
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

This work deals with knowledge acquisition by an industrial small/medium enterprise (SME) using quality control services provided by external laboratories/agents, in order to establish functional relations between processing conditions and product properties. The laboratories are considered to constitute a formal Normal network or an informal Research network (N-NetLab or R-NetLab, respectively). A cognitive algorithm is designed/developed as an aid for suggesting the most proper cooperative schemes that might take place for the realization of this outsourcing procedure within both networks. As a case example, an enterprise producing aluminum-silicon casting alloys is examined by means of the suggested algorithmic procedure. Last, computer-aided (by means of case based reasoning --CBR) filtering-correction of information expressed in narrative mode is presented, using also contextual analysis within an ontological framework.
Spotlight On Word Processing, 2e, 2nd edition
Authors: Jennifer Gipp
Venue:  (2007)

These easy-to-follow, fun and visual books keep learners engaged and interested in what they are learning. Users are introduced to new concepts in the lessons and then gain valuable hands-on experience using these skills in a variety of cross-curricular scenarios. 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
Easy Calibration of a Multi-projector Display System
Authors: Takayuki Okatani, Koichiro Deguchi
Venue: International Journal of Computer Vision (2009)

In this paper, we present a method for the geometric calibration of a multi-projector display system. The method is such that in order to calibrate the system, the user is only required to place the projectors and capture a single image of the images projected from them onto a planar screen using a hand-held camera. The problem to be solved is divided into the image registration for stitching different projector images into a single seamless image and the image rectification for making the image have the correct rectangular shape. The proposed method is characterized by simultaneously solving both of them from only a single image, which makes the calibration procedures easy. The method assumes an uncalibrated camera and partially calibrated projectors in which only focal lengths are unknown among the internal parameters. In the paper, we first prove the uniqueness of solutions to the problem, which was unclear in the previous studies, and then present a stable numerical algorithm for actually finding the solution. We present several experimental results for synthetic data, in which we show the relation between the calibration accuracy and several factors, and also present experimental results for real data, in which we demonstrate that the proposed method can calibrate a real system with sufficient accuracy for a number of layouts of the projectors.
Who dotted that 'i'?: context free user differentiation through pressure and tilt pen data
Authors: Brian David Eoff, Tracy Hammond
Venue: Proceedings of Graphics Interface 2009 (2009)

With the proliferation of tablet PCs and multi-touch computers, collaborative input on a single sketched surface is becoming more and more prevalent. The ability to identify which user draws a specific stroke on a shared surface is widely useful in a) security/forensics research, by effectively identifying a forgery, b) sketch recognition, by providing the ability to employ user-dependent recognition algorithms on a multi-user system, and c) multi-user collaborative systems, by effectively discriminating whose stroke is whose in a complicated diagram. To ensure an adaptive user interface, we cannot expect nor require that users will self-identify nor restrict themselves to a single pen. Instead, we prefer a system that can automatically determine a stroke's owner, even when strokes by different users are drawn with the same pen, in close proximity, and near in timing. We present the results of an experiment that shows that the creator of an individual pen strokes can be determined with high accuracy, without supra-stroke context (such as timing, pen-ID, nor location), and based solely on the physical mechanics of how these strokes are drawn (specifically, pen tilt, pressure, and speed). Results from free-form drawing data, including text and doodles, but not signature data, show that our methods differentiate a single stroke (such as that of a dot of an 'i') between two users at an accuracy of 97.5% and between ten users at an accuracy of 83.5%.
Applying Multi-Agent System Technique to Production Planning in Order to Automate Decisions
Authors: Mats Apelkrans, Anne Håkansson
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

Coordinate and deliver information is vital for the financial and operational success of a company. The information is used for understanding and evaluating performance of a manufacturing company and making decisions based on incoming information. Information about orders but also parts to be purchased, assembled for the final product to be delivered, can streamline the production line to provide good quality products in the right time and to right costs at highest profit. For profit, costs are cut by reducing storage and searching for lowest price from established suppliers and providers on web as well as handling production planning automatically. To increase profit, we apply a multi-agent technique to production planning, which can automate business decision-making for the production line. The agents handle incoming orders, the production line, and search for information about the products at the intranet and the extranet. The outcome is decisions about the production line. The multi-agent solution becomes a complement to the production planning brought about by the company's enterprise resource planning system.
DT-CWT Feature Structure Representation for Face Recognition under Varying Illumination Using EMD
Authors: Yuehui Sun, Di Zhang
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

We introduce a method for illumination detection and removal techinique using Empirical Mode Decomposition (EMD) to decompose subimages of Dual-Tree Complex Wavelet Transform (DT-CWT). The subimages are reconstructed without illumination distortion components for face recognition. Compared with others, this method has the following advantages: it can be directly applied without any prior information; it has perfectly reconstruction ability because of DT-CWT in low frequency. Experiments are carried out upon the Yale B and CMU PIE face databases, and the results demonstrate that the proposed method shows satisfactory recognition rates under varying illumination conditions.
Hypergraphs for Generic Lossless Image Compression
Authors: Luc Gillibert, Alain Bretto
Venue: Fundamenta Informaticae (2009)

Hypergraphs are a large generalisation of graphs; they are now used for many low-level image processing, by example for noise reduction, edge detection and segmentation [3, 4, 7]. In this paper we define a generic 2D and 3D-image representation based on a hypergraph. We present the mathematical definition of the hypergraph representation of an image and we show how this representation conducts to an efficient lossless compression algorithm for 2D and 3D-images. Then we introduce both 2D and 3D version of the algorithm and we give some experimental results on some various sets of images: 2D photo, 2D synthetic pictures, 3D medical images and some short animated sequences.
Logistic online learning methods and their application to incremental dependency parsing
Authors: Richard Johansson
Venue: Proceedings of the 45th Annual Meeting of the ACL: Student Research Workshop (2007)

We investigate a family of update methods for online machine learning algorithms for cost-sensitive multiclass and structured classification problems. The update rules are based on multinomial logistic models. The most interesting question for such an approach is how to integrate the cost function into the learning paradigm. We propose a number of solutions to this problem. To demonstrate the applicability of the algorithms, we evaluated them on a number of classification tasks related to incremental dependency parsing. These tasks were conventional multiclass classification, hiearchical classification, and a structured classification task: complete labeled dependency tree prediction. The performance figures of the logistic algorithms range from slightly lower to slightly higher than margin-based online algorithms.
Multi-execution: multicore caching for data-similar executions
Authors: Susmit Biswas, Diana Franklin, Alan Savage, Ryan Dixon, Timothy Sherwood, Frederic T. Chong
Venue: ACM SIGARCH Computer Architecture News (2009)

While microprocessor designers turn to multicore architectures to sustain performance expectations, the dramatic increase in parallelism of such architectures will put substantial demands on off-chip bandwidth and make the memory wall more significant than ever. This paper demonstrates that one profitable application of multicore processors is the execution of many similar instantiations of the same program. We identify that this model of execution is used in several practical scenarios and term it as "multi-execution." Often, each such instance utilizes very similar data. In conventional cache hierarchies, each instance would cache its own data independently. We propose the Mergeable cache architecture that detects data similarities and merges cache blocks, resulting in substantial savings in cache storage requirements. This leads to reductions in off-chip memory accesses and overall power usage, and increases in application performance. We present cycle-accurate simulation results of 8 benchmarks (6 from SPEC2000) to demonstrate that our technique provides a scalable solution and leads to significant speedups due to reductions in main memory accesses. For 8 cores running 8 similar executions of the same application and sharing an exclusive 4-MB, 8-way L2 cache, the Mergeable cache shows a speedup in execution by 2.5x on average (ranging from 0.93x to 6.92x), while posing an overhead of only 4.28% on cache area and 5.21% on power when it is used.
Enabling analysts in managed services for CRM analytics
Authors: Indrajit Bhattacharya, Shantanu Godbole, Ajay Gupta, Ashish Verma, Jeff Achtermann, Kevin English
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Data analytics tools and frameworks abound, yet rapid deployment of analytics solutions that deliver actionable insights from business data remains a challenge. The primary reason is that on-field practitioners are required to be both technically proficient and knowledgeable about the business. The recent abundance of unstructured business data has thrown up new opportunities for analytics, but has also multiplied the deployment challenge, since interpretation of concepts derived from textual sources require a deep understanding of the business. In such a scenario, a managed service for analytics comes up as the best alternative. A managed analytics service is centered around a business analyst who acts as a liaison between the business and the technology. This calls for new tools that assist the analyst to be efficient in the tasks that she needs to execute. Also, the analytics needs to be repeatable, in that the delivered insights should not depend heavily on the expertise of specific analysts. These factors lead us to identify new areas that open up for KDD research in terms of 'time-to-insight' and repeatability for these analysts. We present our analytics framework in the form of a managed service offering for CRM analytics. We describe different analyst-centric tools using a case study from real-life engagements and demonstrate their effectiveness.
Augmenting paper-based learning with mobile phones
Authors: Po-Yao Chao, Gwo-Dong Chen
Venue: Interacting with Computers (2009)

Paper and traditional books have been serving as useful tools in supporting knowledge-intensive tasks and school learning. Although learning strategies such as selective verbatim note-taking or question-asking may foster intentional recall or resolve comprehension difficulties in paper-based learning practice, improvement in learning may depend on the opportunity and quality of which students apply note-taking, review notes, or enhance comprehension through questioning. This study aims to complement a paper textbook with a mobile phone and to treat the combination as a whole to facilitate verbatim note-taking, resolving comprehension questions, and receiving reading recommendations. The textbook paragraphs were augmented with line numbers to facilitate coordination between the mobile phone and the paper textbook. An eight-week comparative study was conducted to explore the use of two reading vehicles. The results and findings show that using a mobile phone to augment paper-based learning is technically feasible and seems to promote the application of verbatim note-taking and posting comprehension questions for discussion. However, the results of two course tests indicate that consequent learning improvement seemed inconsistent among the students. A six-week case study was also conducted to explore the implications of the augmented support to students' learning practice. The findings show that mobile phones as learning supportive tools to augment paper-based learning could support students' planning and management of learning strategies or activities. The portability of mobile phones and paper textbooks and the ubiquitous connection of paper-based learning with an online learning community may provide the flexibility in planning ahead for suitable learning strategies or activities and may enhance students' assessment for management of students' learning goals.
Performance of equivalent frequency-dependent damping
Authors: Yo-An Lim, Hyo Sung Ahn, Jeha Ryu
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

An analog input shaper (AIS) was proposed as a means for increasing the virtual impedance range that could be stably displayed by haptic interfaces. The AIS reduces high frequency inputs to haptic interfaces, since high frequency inputs that usually occur during collisions with very stiff virtual objects can induce instabilities. The AIS is composed of an analog high-pass filter, two half-wave rectifiers, and an adder. In this paper, we show analytically that how the AIS works as equivalent frequency-dependent damping. In addition, we present both the numerical simulation results and the virtual wall experiment results using a custom-built 1-DOF haptic interface and show that the AIS can significantly increase the Z-Width.
Single and multi-cpu performance modeling for embedded systems
Authors: Alberto Sangiovanni-Vincentelli
Venue:  (2008)

The combination of increasing design complexity, increasing concurrency, growing heterogeneity, and decreasing time to market windows has caused a crisis for embedded system developers. To deal with this problem, dedicated hardware is being replaced by a growing number of microprocessors in these systems, making software a dominant factor in design time and cost. The use of higher level models for design space exploration and early software development is critical. Much progress has been made on increasing the speed of cycle-level simulators for microprocessors, but they may still be too slow for large scale systems and are too low-level (i.e. they require a detailed implementation) for effective design space exploration. Furthermore, constructing such optimized simulators is a significant task because the particularities of the hardware must be accounted for. For this reason, these simulators are hardly flexible. This thesis focuses on modeling the performance of software executing on embedded processors in the context of a heterogeneous multi-processor system on chip in a more flexible and scalable manner than current approaches. We contend that such systems need to be modeled at a higher level of abstraction and, to ensure accuracy, the higher level must have a connection to lower-levels. First, we describe different levels of abstraction for modeling such systems and how their speed and accuracy relate. Next, the high-level modeling of both individual processing elements and also a bus-based microprocessor system are presented. Finally, an approach for automatically annotating timing information obtained from a cycle-level model back to the original application source code is developed. The annotated source code can then be simulated without the underlying architecture and still maintain good timing accuracy. These methods are driven by execution traces produced by lower level models and were developed for ARM microprocessors and MuSIC, a heterogeneous multiprocessor for Software Defined Radio from Infineon. The annotated source code executed between one to three orders of magnitude faster than equivalent cycle-level models, with good accuracy for most applications tested.
Is There an On-line Advertisers' Dilemma? A Study of Click Fraud in the Pay-Per-Click Model
Authors: Tamara Dinev, Qing Hu, Ali Yayla
Venue: International Journal of Electronic Commerce (2008)

This study develops a theoretical model, based on the theory of reasoned action and the concept of behavioral calculus, for understanding on-line advertiser behavior. Structural equation modeling and survey data are used to test hypotheses on how beliefs about on-line pay-per-click advertising shape the attitudes and subjective norms that lead advertisers to advertise on-line. The roles of trust, third-party tools, and support from search engine providers are explored. The study confirms that attitudes and subjective norms significantly influence intention to advertise on-line using the pay-per-click model, but trust in search engine providers and third-party monitoring and filtering tools are also found to have central roles. Trust can significantly increase the perceived benefits, in addition to its direct positive impact on attitude and subjective norms. The perceived effectiveness of third-party tools has a positive impact on attitude and trust, and thus on intention to advertise on-line.
A novel approach for multi-agent-based Intelligent Manufacturing System
Authors: Qinglin Guo, Ming Zhang
Venue: Information Sciences: an International Journal (2009)

In the recent years, the competition of shortening the development cycle of new products is more and more fierce. Given the shortcomings of traditional scheduling algorithm in Intelligent Manufacturing, the architecture of multi-agent-based Intelligent Manufacturing System is put forward, which represents the basic processing entity. The architecture is based on the methodology of multi-agent systems (MAS) in distributed artificial intelligence (DAI). The multi-agent system has some common characteristics, such as distribution, autonomy, interaction and openness, which are helpful to transform the traditional architecture into a distributed and cooperative architecture in an Intelligent Manufacturing System. To develop a multi-agent-based scheduling system for Intelligent Manufacturing, it is necessary to build various functional agents for all the resources and an agent manager to improve the scheduling agility. In this paper, the proposed architecture consists of various autonomous agents that are capable of communicating with each other and making decisions based on their knowledge. The architecture of Intelligent Manufacturing, the scheduling optimization algorithm, the negotiation processes and protocols among the agents are described in detail. A prototype system is built and validated in an illustrative example, which demonstrates the feasibility of the proposed approach. The experiments prove that the implementation of multi-agent technology in Intelligent Manufacturing System makes the operations much more flexible, economical and energy-efficient.
Distributed XML design
Authors: Serge Abiteboul, Georg Gottlob, Marco Manna
Venue: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2009)

A distributed XML document is an XML document that spans several machines or Web repositories. We assume that a distribution design of the document tree is given, providing an XML tree some of whose leaves are "docking points", to which XML subtrees can be attached. These subtrees may be provided and controlled by peers at remote locations, or may correspond to the result of function calls, e.g., Web services. If a global type τ, e.g. a DTD, is specified for a distributed document T, it would be most desirable to be able to break this type into a collection of local types, called a local typing, such that the document satisfies τ if and only if each peer (or function) satisfies its local type. In this paper we lay out the fundamentals of a theory of local typing and provide formal definitions of three main variants of locality: local typing, maximal local typing, and perfect typing, the latter being the most desirable. We study the following relevant decision problems: (i) given a typing for a design, determine whether it is local, maximal local, or perfect; (ii) given a design, establish whether a (maximal) local, or perfect typing does exist. For some of these problems we provide tight complexity bounds (polynomial space), while for the others we show exponential upper bounds. A main contribution is a polynomial-space algorithm for computing a perfect typing in this context, if it exists.