ppxscal/embedding_network huggingface dataset:
Regularized locality preserving indexing via spectral regression
Authors: Deng Cai, Xiaofei He, Wei Vivian Zhang, Jiawei Han
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from Latent Semantic Indexing (LSI) which is optimal in the sense of global Euclidean structure, LPI is optimal in the sense of local manifold structure. However, LPI is not efficient in time and memory which makes it difficult to be applied to very large data set. Specifically, the computation of LPI involves eigen-decompositions of two dense matrices which is expensive. In this paper, we propose a new algorithm called Regularized Locality Preserving Indexing (RLPI). Benefit from recent progresses on spectral graph analysis, we cast the original LPI algorithm into a regression framework which enable us to avoid eigen-decomposition of dense matrices. Also, with the regression based framework, different kinds of regularizers can be naturally incorporated into our algorithm which makes it more flexible. Extensive experimental results show that RLPI obtains similar or better results comparing to LPI and it is significantly faster, which makes it an efficient and effective data preprocessing method for large scale text clustering, classification and retrieval.
The preference matrix as a course design tool
Authors: John Paxton
Venue: Proceedings of the 6th Baltic Sea conference on Computing education research: Koli Calling 2006 (2006)

The preference matrix is a theoretical tool based on principles of evolutionary psychology. This paper briefly introduces the theory and then describes how the preference matrix has been applied as a pedagogical design tool for an artificial intelligence course. After making a preliminary assessment of this experience, the paper concludes with several discussion questions.
Distribution-Based Face Detection using Calibrated Boosted Cascade Classifier
Authors: Hiromasa Takatsuka, Masayuki Tanaka, Masatoshi Okutomi
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

This study presents a distribution-based face detection. The proposed face detection integrates information over image space and scale because the face can be recognized even if a small warp is applied. We must calibrate raw classifier outputs for information integration. Two salient contributions of this paper are calibration for a boosted cascade classifier and a distribution-based face detection. We first propose a new calibration method that converts the raw classifier outputs into posterior probabilities. This calibration method enables us to obtain a "Face Likelihood Distribution" from an input scene. The second contribution is the distribution-based face detection , which evaluates the local face likelihood distribution over space and scale. In contrast, existing methods evaluate the face similarity value only at that point, which causes misdetection. Experimental results using 170 input scenes, which might or might not include faces, show that the proposed method improves the detection rate by about 5%.
Decoupling web application concerns through weaving operations
Authors: Antonio Cicchetti, Davide Di Ruscio
Venue: Science of Computer Programming (2008)

Today's Web applications require instruments and techniques able to face their complexity which has noticeably increased at the expense of productivity and quality factors. A number of design methodologies have been proposed in the process of trying to provide developers with languages and tools to abstract and capture Web applications under orthogonal views, like data, navigation and presentation. While the different modeling language constructs can be unified in a common metamodel, consistency among the distinct concerns is guaranteed by less formal relations. Usually, they are based on name conventions and/or ad hoc tool support that could affect reuse and maintenance ratings of specifications. In order to define rigorous and explicit correspondences between the artifacts produced during a system development, this paper proposes the exploitation of dedicated weaving models. The approach aims at providing structural mappings that do not interfere with the definition of the views on either side achieving a clear separation between them and their connections. Furthermore, following the ''everything is a model'' principle, this work can enable the use of general-purpose theories and tools. For example, model transformations can be applied to evaluate the given specifications or to derive alternative descriptions like Webile or WebML.
Optimizing Logarithmic Arithmetic on FPGAs
Authors: Haohuan Fu, Oskar Mencer, Wayne Luk
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

This paper proposes optimizations of the methods and parameters used in both mathematical approximation and hardware design for logarithmic number system (LNS) arithmetic. First, we introduce a general polynomial approximation approach with an adaptive divide-in-halves segmentation method for evaluation of LNS arithmetic functions. Second, we develop a library generator that automatically generates optimized LNS arithmetic units with a wide bit-width range from 21 to 64 bits, to support LNS application development and design exploration. The basic arithmetic units are tested on practical FPGA boards as well as software simulation. When compared with existing LNS designs, our generated units provide in most cases 6% to 37% reduction in area and 20% to 50% reduction in latency. The key challenge for LNS remains on the application level. We show the performance of LNS versus floating-point for realistic applications: digital sine/cosine waveform generator, matrix multiplication and radiative Monte Carlo simulation. Our infrastructure for fast prototyping LNS FPGA applications allows us to efficiently study LNS number representation and its tradeoffs in speed and size when compared with floating-point designs.
Design of an Integrated Location System for Fire Detecting Robot
Authors: Qingmei Yang, Jianmin Sun
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

In order to reduce the loss caused by fires in environmental sensitive regions, an integrated location system of an autonomous robot that is used to detect fire is studied. Based on the analysis of location methods, such as the global positioning system (GPS), inertial navigation system (INS), dead reckoning (DR) system and the vector electronic map, GPS and INS are integrated in the location system of the autonomous fire detecting robot. The GPS subsystem and the INS subsystem of the GPS/INS integrated location are designed. Kalman filter is used in the GPS/INS integrated location system. Data fusion of INS/GPS integrated location is simulated. The results show that the fusion location method can improve the movement precision and location reliability of fire detecting robot.
Formal modeling of BPEL workflows including fault and compensation handling
Authors: Máté Kovács, Dániel Varró, László Gönczy
Venue: Proceedings of the 2007 workshop on Engineering fault tolerant systems (2007)

Electronically executed business processes are frequently implemented using the Business Process Execution Language (BPEL). These workflows may be in control of crucial business processes of an organization, in the same time existing model checking approaches are still immature i.e. they either seem to loose to much information during the generation of the analysis model, or the state space explosion prevents from model checking. We present a formal modeling technique for BPEL workflows including fault and compensation handling providing exact semantics with a state space size that allows for model checking. Additionally, error propagation among variables is supported so the effect of a faulty activity on the entire process can be examined.
Apache and Eclipse: Comparing Open Source Project Incubators
Authors: Juan C. Dueñas, Hugo A. Parada G., Félix Cuadrado, Manuel Santillán, José L. Ruiz
Venue: IEEE Software (2007)

Open source development is often regarded as a chaotic environment where new initiatives' success or failure just happens by chance. However, successful open source communities are applying incubation processes for managing the risks associated with creating new projects. This article analyzes the qualitative and quantitative aspects of the incubation process, focusing on the Apache and Eclipse communities. After performing a quantitative and qualitative comparative analysis of these communities, the authors identified aspects that affect the incubation period's duration and community size. The similarities led them to propose a two-stage model for the incubation process, which might facilitate its applicability to other open source or industrial organizations.
Word Indexing for Mobile Device Data Representations
Authors: Henry Larkin
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Mobile devices often have limited available wireless bandwidth, as well as limited storage space both in active memory and device storage. A large portion of data stored in these locations can be classified as textual, such as emails, contact and calendar information, documents, etc. The vast majority of the words used in these textual data examples are known words from a relatively small vocabulary for each language. This paper analyses the use of using word indexing as a means of reducing storage requirements while not requiring any decompression time. Experiments show significant reductions in storage requirements compared to plain text, and similar storage requirements of existing compression algorithms.
Real-time Connectors for Deterministic Data-flow
Authors: Irfan Hamid, Elie Najm
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

In this paper we introduce deterministic bridge connectors, a type of construct that ensures deterministic data-flow communication in asynchronous real-time systems. We also present a methodology for generating these connectors automatically from the application's architecture description in order to reduce programmer effort and the chance of error. We provide a process algebraic verification of the determinism property of these connectors. We conclude by presenting arguments in favor of using this verification in lieu of expensive certification to qualify these constructs for onboard deployment.
Graph Laplacians and their Convergence on Random Neighborhood Graphs
Authors: Matthias Hein, Jean-Yves Audibert, Ulrike von Luxburg
Venue: The Journal of Machine Learning Research (2007)

Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the submanifold. The graph Laplacian of such a graph is used in several machine learning methods like semi-supervised learning, dimensionality reduction and clustering. In this paper we determine the pointwise limit of three different graph Laplacians used in the literature as the sample size increases and the neighborhood size approaches zero. We show that for a uniform measure on the submanifold all graph Laplacians have the same limit up to constants. However in the case of a non-uniform measure on the submanifold only the so called random walk graph Laplacian converges to the weighted Laplace-Beltrami operator.
Evaluation of datalog extended with an XPath predicate
Authors: Royi Ronen, Oded Shmueli
Venue: Proceedings of the 9th annual ACM international workshop on Web information and data management (2007)

XPathL is a logical language for processing XML and relational data. The language is essentially Datalog augmented with a new type of predicate, XPath Expression Predicate, which is dedicated to XPath processing. It may be used as an intermediate target language for higher level constructs within a programming language, or embedded directly within a programming language. Two approaches for processing XPathL queries are presented. The Static approach uses an XPath processor, prior to execution, without considering data binding. The On-Demand approach uses the XPath processor based on known bindings to variables at run-time. We constructed a prototype for experimenting with these approaches. The prototype provides a platform for leveraging the wealth of knowledge in Datalogprocessing for the purpose of integrative querying of both XML and relational data. The prototype also provides a platform to investigate the interaction between processors for arbitrary file-type-specific predicates within one query (in this paper the interaction between XML and relational file types is investigated). In that, XPathL takes a loosely-coupled approach towards data access, which fits well with web data.
Geometric Design of Developable Bezier and B-spline Parametric Surfaces
Authors: Junqing Yang, Min Zhou, Quanyi Lv, Hongchan Zheng
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Using the concept of duality between points and planes in 3D projective space, an explicit and efficient method of computer-aided design for developable surfaces based on Bezier and B-spline basis functions is proposed. By the result that a developable surface is the envelope of a single-parameter family of planes, we give the parametric equation of a Bezier and B-spline developable surface, and discuss respectively properties of Bezier and B-spline representations. Meanwhile, we also present a simplified geometric-construction for developable surfaces, that is, G2 Beta restraint condition algorithm for G2 continuity between two developable surfaces. It is shown that the geometric construction technique that exists for curves also can be generalized to the design of developable surfaces.
Handwritten Word Recognition Using Conditional Random Fields
Authors: S. Shetty, H. Srinivasan, S. Srihari
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

The paper describes a lexicon driven approach for word recognition on handwritten documents using Conditional Random Fields(CRFs). CRFs are discriminative models and do not make any assumptions about the underlying data and hence are known to be superior to Hidden Markov Models(HMMs) for sequence labeling problems. For word recognition, the document is first segmented into word im- ages using an existing neural network based algorithm. Each word image is then over segmented into a number of small segments such that the combination of segments forms character images. Segment(s) is/are labeled as characters with probability evaluated from the CRF model. The total probability of a word image representing an entry from the lexicon is computed using a dynamic programming algo- rithm which evaluates the optimal combination of segments.
Team collaboration in virtual worlds
Authors: Surinder S. Kahai, Elizabeth Carroll, Rebecca Jestice
Venue: ACM SIGMIS Database (2007)

Are virtual worlds more or less effective for virtual team collaboration? We suggest that the answer to this question is complicated and dependent upon a number of factors, and we propose a research agenda with theoretical bases to guide researchers in the area of virtual team collaboration for the next seven to ten years. While virtual teams are increasingly used by organizations, there has been little systematic research done to understand how collaboration in virtual worlds compares to collaboration supported by other media, or how characteristics of virtual teams influence the collaboration process and outcomes. The research agenda that we propose looks at basic differences between virtual worlds and other media, but also includes consideration of the specific contextual factors, and the influence that leadership might have on the collaboration process and outcomes.
Typing Staphylococcus aureus Using the spa Gene and Novel Distance Measures
Authors: Phaedra Agius, Barry Kreiswirth, Steve Naidich, Kristin Bennett
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2007)

We developed an approach for identifying groups or families of Staphylococcus aureus bacteria based on genotype data. With the emergence of drug resistant strains, S. aureus represents a significant human health threat. Identifying the family types efficiently and quickly is crucial in community settings. Here, we develop a hybrid sequence algorithm approach to type this bacterium using only its spa gene. Two of the sequence algorithms we used are well established, while the third, the Best Common Gap-Weighted Sequence (BCGS), is novel. We combined the sequence algorithms with a weighted match/mismatch algorithm for the spa sequence ends. Normalized similarity scores and distances between the sequences were derived and used within unsupervised clustering methods. The resulting spa groupings correlated strongly with the groups defined by the well-established Multi locus sequence typing (MLST) method. Spa typing is preferable to MLST typing which types seven genes instead of just one. Furthermore, our spa clustering methods can be fine-tuned to be more discriminative than MLST, identifying new strains that the MLST method may not. Finally, we performed a multidimensional scaling of our distance matrices to visualize the relationship between isolates. The proposed methodology provides a promising new approach to molecular epidemiology.
Virtual Machine Hosting for Networked Clusters: Building the Foundations for "Autonomic" Orchestration
Authors: Laura Grit, David Irwin, Aydan Yumerefendi, Jeff Chase
Venue: Proceedings of the 2nd International Workshop on Virtualization Technology in Distributed Computing (2006)

Virtualization technology offers powerful resource management mechanisms, including performance-isolating resource schedulers, live migration, and suspend/resume. But how should networked virtual computing systems use these mechanisms? A grand challenge is to devise practical policies to drive these mechanisms in a self-managing or .autonomic . system, without relying on human operators. This paper explores architectural and algorithmic issues for resource management policy and orchestration in Shirako, a system for on-demand leasing of shared networked resources in federated clusters. Shirako enables a flexible factoring of resource management functions across the participants in a federated system, to accommodate a range of models of distributed virtual computing. We present extensions to Shirako to provision fine-grained virtual machine .slivers. and drive virtual machine migration. We illustrate the interactions of provisioning and placement/migration policies, and their impact.
A pixel-based regularization approach to inverse lithography
Authors: Amyn Poonawala, Peyman Milanfar
Venue: Microelectronic Engineering (2007)

Inverse lithography attempts to synthesize the input mask which leads to the desired output wafer pattern by inverting the forward model from mask to wafer. In this article, we extend our earlier framework for image prewarping to solve the mask design problem for coherent, incoherent, and partially coherent imaging systems. We also discuss the synthesis of three variants of phase shift masks (PSM); namely, attenuated (or weak) PSM, 100% transmission PSM, and strong PSM with chrome. A new two-step optimization strategy is introduced to promote the generation and placement of assist bar features. The regularization framework is extended to guarantee that the estimated PSM have only two or three (allowable) transmission values, and the aerial-image penalty term is introduced to boost the aerial image contrast and keep the side-lobes under control. Our approach uses the pixel-based mask representation, a continuous function formulation, and gradient-based iterative optimization techniques to solve the inverse problem. The continuous function formulation allows analytic calculation of the gradient in O(MNlog(MN)) operations for an MxN pattern making it practically feasible. We also present some results for coherent and incoherent imaging systems with very low k"1 values to demonstrate the effectiveness of our approach.
ROGAND: A Discretization Model
Authors: Lin Shang, Shaoyue Yu, Xiuyi Jia, Yangsheng Ji
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

A discretization model called ROGAND ( ROugh sets, Genetic Algorithm and Neural network based Discretiza- tion ) is presented in the paper, which combines Rough set theory with the genetic algorithm to build a four-layer neu- ral network. This model consists of the data preprocessor (DP), the discretization module(DM) and the optimization module (OM). The discretized intervals obtained through the ROGAND model is independent on the candidates of cut-point sets and the denoted values can be more precise. The experiments indicate that the method is effective and the output cut-points are accurate and easy-set.
A High Speed CABAC Algorithm Based on Probability Estimation Update
Authors: Bin Guo, Wei-dong Wang, Yu-li Shen, Hong Zhang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Context Adaptive Binary Arithmetic Coding (CABAC) is a highly efficient entropy coding way, but its coding speed is restricted by high computational complexity, which becomes a major bottleneck in its application. Based on the analysis of the CABAC algorithm and its computational complexity, by improving the probability estimation update part, an effective way to improve its coding speed will be proposed in this paper. The experimental results show that the coding speed of CABAC has been substantially raised meanwhile coding efficiency decline a little.
Awareness in the Wild: Why Communication Breakdowns Occur
Authors: Daniela Damian, Luis Izquierdo, Janice Singer, Irwin Kwan
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

Global software teams face challenges when collaborating over long distances, such as communicating changes in the project. During a four-month case study at IBM Ottawa Software Lab we observed the collaboration patterns of a multi-site development project team. In this period, we inspected project documentation, interviewed team leaders, attended project meetings, and spoke with developers to identify problems originated by the lack of awareness of changes related to the implementation of work items. Our observations show (1) that organizational culture has an effect on how developers are made aware; (2) that communication- based social networks revolving around particular work items are dynamic throughout development, and therefore awareness needs to be maintained in infrastructures of work; and (3) that information overload and communication breakdowns contributed to the generation of a broken integration build. We discuss these breakdowns in communication and implications for the design of collaboration tools that could mitigate these problems.