ppxscal/embedding_network huggingface dataset:
General Integrated System Architecture and Enterprise Modeling Framework Study
Authors: Qing Li, Jian Zhou, Dafeng Xu
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

General Integrated System Architecture is a set of models and methods that describes different aspects of the system and covers its life cycle. Its models are structuralized models with multi-layers and multiviews. They are descriptions and cognitions of the system at the top level and provide tools and methodology to understand, design, develop and implement the system. Therefore, they can supply references in enterprise diagnosis, business process reengineering and information system implementation. In order to meet the requirement in practicing enterprise information integration projects, this paper addresses General Integrated System Architecture and Description methods of its views. It also presents a framework and methods of the economic analysis based on enterprise modeling.
Tuning viewing parameters for efficient and accurate 3D interaction
Authors: Dong Wook Lee, Jinah Park
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

We hypothesize that one of the reasons for the depth perception problem is the difference between the result for the viewing frustum of virtual world and the scene of the real world. To verify our hypothesis, we experiment simple locating tasks whose viewing frustum consists of various fields of view (FOV) and viewing direction (VD). The task was performed with a 3D input device, and the results show that, while the changes in the FOV affected accuracy, the VD affected efficiency.
Generating sets for Beurling algebras
Authors: N. Blank
Venue: Journal of Approximation Theory (2006)

We characterize in terms of Beurling-Malliavin density, the generating sets for Beurling algebras Lw1(R), that is the sets Λ ⊂ R for which a function ϕ ∈ Lw1 (R) exists such that the Λ-translates {ϕ(x-λ)}, λ ∈ Λ, span Lw1 (R). Our main result extends a recent theorem from [J. Bruna, A. Olevskii, A. Ulanovskii, Completeness in L1 (R) of discrete translates, arXiv:math.CA/0307323v1, 2003, (Revista Mathematica Iberoamericana), submitted for publication.], which describes the generating sets for L1(R).
On the Subset Matching
Authors: Yangjun Chen
Venue: Proceedings of the Seventh International Conference on Web-Age Information Management Workshops (2006)

The subset matching problem is to find all occurrences of a pattern string p of length m in a text string t of length n, where each pattern and text location is a set of characters drawn from some alphabet. The pattern is said to occur at text position i if the set p[j] is a subset of the set t[i + j - 1], for all j (1 \leqslant j \leqslant m). This is an extension of the classic string matching and can be used for finding matching subtree patterns. In this paper, we propose a new algorithm and conduct a probabilistic analysis of its performance, which shows that we need only O(n + m \cdot n^{0.5} ) time to solve the problem on average.
Combining local features for robust nose location in 3D facial data
Authors: Chenghua Xu, Tieniu Tan, Yunhong Wang, Long Quan
Venue: Pattern Recognition Letters (2006)

Due to the wide use of human face images, it is significant to locate facial feature points. In this paper, we focus on 3D facial data and propose a novel method to solve a specific problem, i.e., locating the nose tip by one hierarchical filtering scheme combining local features. Based on the detected nose tip, we further estimate the nose ridge by a newly defined curve, the Included Angle Curve (IAC). The key features of our method are its automated implementation for detection, its ability to deal with noisy and incomplete input data, its invariance to rotation and translation, and its adaptability to different resolutions. The experimental results from different databases show the robustness and feasibility of the proposed method.
eBusiness Adoption Studies Focusing on Thai SMEs
Authors: Ly Fie Sugianto, Suttisak Jantavongso
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Rapid changes in the internet technology present businesses with challenges and opportunities. Businesses of various sizes are seeking to adopt eBusiness technologies to remain competitive in this digital economy. However, the lack of a suitable framework may seriously impede eBusiness proliferation, and as a result, businesses may not be able to achieve the benefits of the available technologies. To address this gap, we propose a holistic framework for eBusiness to assist organizations with their initiatives. In particular, our study focuses on Thai SMEs. The need to embrace eBusiness initiatives by Thai SMEs is motivated by the intent to remain competitive. In this paper, we propose a framework with five factors: Confidence and Trust, Technical Support, HR support, Standard of operations and Financial motivation. These factors were derived from an extensive review on existing literature from western models, critical/success factors and dotcom failures.
Shape-Based Approach to Robust Image Segmentation using Kernel PCA
Authors: Samuel Dambreville, Yogesh Rathi, Allen Tannen
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Segmentation involves separating an object from the background. In this work, we propose a novel segmentation method combining image information with prior shape knowledge, within the level-set framework. Following the work of Leventon et al., we revisit the use of principal component analysis (PCA) to introduce prior knowledge about shapes in a more robust manner. To this end, we utilize Kernel PCA and show that this method of learning shapes outperforms linear PCA, by allowing only shapes that are close enough to the training data. In the proposed segmentation algorithm, shape knowledge and image information are encoded into two energy functionals entirely described in terms of shapes. This consistent description allows to fully take advantage of the Kernel PCA methodology and leads to promising segmentation results. In particular, our shape-driven segmentation technique allows for the simultaneous encoding of multiple types of shapes, and offers a convincing level of robustness with respect to noise, clutter, partial occlusions, or smearing.
New cached-sufficient statistics algorithms for quickly answering statistical questions
Authors: Andrew Moore
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

This talk is about recent work on new ways to exploit preprocessed views of data tables for tractably solving big statistical queries. We'll describe deployments of these new algorithms in the realms of detecting killer asteroids and unnatural disease outbreaks.In recent years, several groups have looked at methods for pre-storing general sufficient statistics of the data in spatial data structures such as kd-trees and ball-trees so that both frequentist and Bayesian statistical operations become fast for large datasets. In this talk we will look at two other classes of optimization required in important statistical queries.The first involves iterating over all spatial regions (big and small). The second involves detection of tracks from noisy intermittent observations separated far apart in time and space. We will also discuss the implications that have arisen from making these operations tractable. We will focus particularly onDetecting all asteroids in the solar system larger than Pittsburgh's Cathedral of Learning (data to be collected over 2006-2010). Early detection of emerging diseases based on national monitoring of health-related transactions..
Deformation Modeling for Robust 3D Face Matching
Authors: Xiaoguang Lu, Anil K. Jain
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Human face recognition based on 3D surface matching is promising for overcoming the limitations of current 2D image-based face recognition systems. The 3D shape is invariant to the pose and lighting changes, but not invariant to the non-rigid facial movement, such as expressions. Collecting and storing multiple templates for each subject in a large database (associated with various expressions) is not practical. We present a facial surface modeling and matching scheme to match 2.5D test scans in the presence of both non-rigid deformations and large pose changes (multiview) to a neutral expression 3D face model. A geodesic-based resampling approach is applied to extract landmarks for modeling facial surface deformations. We are able to synthesize the deformation learned from a small group of subjects (control group) onto a 3D neutral model (not in the control group), resulting in a deformed template. A personspecific (3D) deformable model is built for each subject in the gallery w.r.t. the control group by combining the templates with synthesized deformations. By fitting this generative deformable model to a test scan, the proposed approach is able to handle expressions and large pose changes simultaneously. Experimental results demonstrate that the proposed matching scheme based on deformation modeling improves the matching accuracy.
Formal verification for real-world designs
Authors: Valeria Bertacco
Venue: Proceedings of the 19th annual symposium on Integrated circuits and systems design (2006)

This tutorial addresses state-of-the-art methods used to verify the correctness of sequential digital systems. The focus is on providing an overview of the main technologies and their applicability to complex designs. We cover the baseline algorithms involved in a range of verification methods, their application for specific aspects of formal verification and their deployment in verification software currently available both from industry and from academia. The tutorial is intended for designers and CAD engineers interested in a better understanding of current formal verification technologies, their growth potential, and the critical CAD needs in this area.
Pair programming productivity: Novice-novice vs. expert-expert
Authors: Kim Man Lui, Keith C. C. Chan
Venue: International Journal of Human-Computer Studies (2006)

Agile Software Development methodologies have grown in popularity both among academic researchers and industrial practitioners. Among the various methodologies or practices proposed, pair programming, which is concerned with two programmers collaborating on design, coding and testing, has become a controversial focus of interest. Even though some success stories have been reported with the use of pair-programming in real software development environment, many people remain rather skeptical of the claims on pair-programming productivity. Previous studies in pair programming have only addressed the basic understanding of the productivity of pairs and they have not addressed the variation in productivity between pairs of varying skills and experience, such as between novice-novice and expert-expert. Statistical productivity measurements reported by different researchers also seem to lead to contradictory conclusions. Until now, the literature has not addressed how those results and experiments were related to each other. In this paper, we propose a controlled experiment called repeat-programming which can facilitate the understanding of relationships between human experience and programming productivity. Repeat-programming can be performed when controversial issues in non-traditional programming methodologies and development productivity need to be investigated into. To illustrate how the proposed empirical experiment can put arguable, divisive problems into perspective, we have examined the productivity in pair programming as a case study. With repeat-programming, we are able to (i) better understand why results of previous pair programming control experiments reached different conclusions as to the productivity of pair programming and (ii) most importantly, present a case in which novice-novice pairs against novice solos are much more productive than expert-expert pairs against expert solos.
WSMO-MX: A Logic Programming Based Hybrid Service Matchmaker
Authors: Frank Kaufer, Matthias Klusch
Venue: Proceedings of the European Conference on Web Services (2006)

In this paper, we present an approach to hybrid semantic web service matching based on both logic programming, and syntactic similarity measurement. The implemented matchmaker, called WSMO-MX, applies different matching filters to retrieve WSMO-oriented service descriptions that are semantically relevant to a given query with respect to seven degrees of hybrid matching. These degrees are recursively computed by aggregated valuations of ontology based type matching, logical constraint and relation matching, and syntactic similarity as well.
A Rule-based Security Auditing Tool for Software Vulnerability Detection
Authors: Moohun Lee, Sunghoon Cho, Changbok Jang, Heeyong Park, Euiin Choi
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

We can use information and software of various forms without being restricted for place and time if ubiquitous computing age comes. However, its reverse function is causing security problems such as outflow of personal information, hacking, diffusion of virus. Specially, dissemination of software that has malicious purpose in ubiquitous computing environment causes serious damage. We have studied about malicious code detection and software vulnerability detection tool to prevent this. But, existent detection tools are not suited to general software, because they are limitative in specification area. In addition, they can not detect a newly appeared malicious code. We must update pattern of new malicious code, because they use a simple pattern matching technique. In this paper, we propose rule-based security auditing tool that analyzes structure of target code to solve these problems, define this as rule, and detect malicious codes and software vulnerabilities. Proposed auditing tool can construct secure ubiquitous computing environment, because it will be used by a common software audit tool that detects malicious codes and software vulnerabilities at the same time.
Extended Kalman Filter Neurocontrol for Neonate Incubator
Authors: V. Ortiz, D. Angeles, I. Chairez, A. Cabrera
Venue: Proceedings of the 15th International Conference on Computing (2006)

The temperature adaptive control for a neonatal incubator is shown in this paper: The control design is based on the neurofuzzy algorithm and the extended kalmanJilter technique. The Kalman filter adjusts the weights associated with the neural network structure, while the ANFIS (Artificial Neural Fuzzy System Inference System) structure (using the Back-propagation scheme) is applied to change the Gaussian membership function parameters in an adaptive way (using the delta rule scheme). The External Temperature Gradient (ETG) and the External Temperature Gradient Rate (ETGR) principles were used as input variables in the identifier-controller design. The results for this process were proved in numerical simulations and in a real incubator with a reference temperature around 3 7 C. The efficiency of the suggested method is shown by the convergence of the ETG and ETGR to its reference range while the temperature in the care unit is keep very near to the selected set point value.
Preparing Proprietary Systems for Continuous Education e-Learning for Inter-Operability: Exporting to SCORM
Authors: Victor Manso, Roberto Romero, Carlos Palau
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This document describes the procedure followed to prepare an existing framework for e-learning, to make the contents, produced during many years, exportable to a no proprietary standard (SCORM).
The use of simulation for productivity estimation based on multiple regression analysis
Authors: Seungwoo Han, Daniel W. Halpin
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Productivity estimation has been fundamental subject investigated in academia and industry. There are two common methods for estimation of productivity: (1) deterministic and (2) simulation methods. The deterministic method does not reflect actual conditions, such as randomness of work duration, whereas simulation method can overcome this limitation. However, the user without a background in simulation may struggle with implementation due to the difficulty of modeling. The presented productivity estimation model in this research was created using multiple regression analysis with data generated by WebCYCLONE. The model representing the mathematical relations between conditions and productivity allows planners or site personnel to estimate productivity by simply entering input data reflecting actual site conditions. In academia, the research methodology utilized in this research provides a framework for the user to establish other application models for estimating or evaluating the performances of new technologies.
On the progress of developing groupware to support notetaking
Authors: Dave Berque, LeAnn Gaerte, Tim Harrison, Matt Heitz, Ryan Ritz, Todd Witter, John Yoder
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

Teachers traditionally write on blackboards and similar devices while delivering their lectures. Often the majority of each student's energy is then devoted to copying what the instructor has written into his/her notebook. Only occasionally does a student find time to listen to the lecture, think about the associated ideas, and appropriately annotate the copied notes. The difficulties stemming from the need to copy a large amount of information arise in classes taught in many academic disciplines. However, the problem is perhaps most pronounced in science and mathematics classes where a large amount of information, usually expressed using potentially confusing symbols and notation, is frequently presented very rapidly. A mathematics teacher who is very familiar with the notation of the discipline may very quickly write a formula like: [EQUATION] on the blackboard, but students may require several minutes to copy it. Unfortunately, while the students are busy copying the formula they are often distracted from thinking about the instructor's discussion of its significance. A recent article in the Chronicle of Higher Education summarizes the problem with the following comment made by a student at Cornell University: "In some classes, you're so busy trying to write down what the professors say that you miss half of the information" [Collison 1992]. Statements like this are quite common and served as a primary motivation for our system design.
Symmetry Reduction for STE Model Checking
Authors: Ashish Darbari
Venue: Proceedings of the Formal Methods in Computer Aided Design (2006)

In spite of the tremendous success of STE model checking one cannot verify circuits with arbitrary large number of state holding elements. In this paper we present a methodology of symmetry reduction for STE model checking, using a novel set of STE inference rules. For symmetric circuit models these rules provide a very effective reduction strategy. When used as tactics, rules help decompose a given STE property to a set containing several classes of equivalent STE properties. A representative from each equivalence class is picked and verified using an STE simulator, and the correctness of the entire class of assertions is deduced, using a theorem that we provide. Finally inference rules are used in the forward direction to deduce the overall statement of correctness. Our experiments on verifying arbitrarily large CAMs and circuits with multiple CAMs, show that these can be verified using a fixed, small number of BDD variables.
The restrictions and improvement of the Adomian decomposition method
Authors: Bing-Quan Zhang, Xing-Guo Luo, Qing-Biao Wu
Venue: Applied Mathematics and Computation (2006)

The Adomian decomposition method is a creative and effective method for exactly solving functional equations of various kinds. In this paper, the principle of the decomposition method is described, and its restrictions are discussed. Then an improvement is proposed, which overcomes the restrictions and complements the ability of the Adomian decomposition method. Some concrete examples are also studied to illustrate the validity of the improvement.
Optimizing robot algorithms with simulation
Authors: Todd LeBaron, Joerg Domasche
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Maximizing equipment throughput on multi-chambered cluster tools is an ongoing objective for semiconductor fabs. The increasing use of dual-armed robots and the need to process multiple products simultaneously complicates this objective. Typically, when a new processing technology is introduced, one chamber inside the tool is dedicated to the new process, while the other chambers are assigned to run normal production wafers. This results in multiple wafer flows or "parallel routes" within the tool. Determining and implementing optimal robot schedulers to efficiently handle the complexities within the tool is key to maximizing equipment throughput. This paper introduces the components of a multi-chambered cluster tool and discusses how simulation was used at Infineon to develop, test, and optimize efficient wafer selection rules. Several real-world cases are detailed and reported.
The Role of Admission Control in Assuring Multiple Services Quality
Authors: Solange Rito Lima, Paulo Carvalho, Vasco Freitas
Venue: Proceedings of the 15th International Conference on Computing (2006)

Considering that network overprovisioning by itself is not always an attainable and everlasting solution, Admission Control (AC) mechanisms are recommended to keep network load controlled and assure the required service quality levels. This article debates the role of AC in multiservice IP networks, providing an overview and discussion of current and representative AC approaches, highlighting their main characteristics, pros and cons regarding the management of network services quality. In this debate, particular emphasis is given to an enhanced monitoringbased AC proposal for assuring multiple service levels in multiclass networks.
Face Recognition using 2.5D Shape Information
Authors: William A. P. Smith, Edwin R. Hancock
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

In this paper we investigate whether the 2.5D shape information delivered by a novel shape-from-shading algorithm can be used for illumination insensitive face recognition. We present a robust and efficient facial shape-fromshading algorithm which uses principal geodesic analysis to model the variation in surface orientation across a face. We show how this algorithm can be used to recover accurate facial shape and albedo from real world images. Our second contribution is to use the recovered 2.5D shape information in a variety of recognition methods. We present a novel recognition strategy in which similarity is measured in the space of the principal geodesic parameters. We also use the recovered shape information to generate illumination normalised prototype images on which recognition can be performed. Finally we show that, from a single input image, we are able to generate the basis images employed by a number of well known illumination-insensitive recognition algorithms. We also demonstrate that the principal geodesics provide an efficient parameterisation of the space of harmonic basis images.