ppxscal/embedding_network huggingface dataset:
Research of GIS-based Spatial Data Mining Model
Authors: Jinlin Wang, Xi Chen, Kefa Zhou, Haibo Zhang, Wei Wang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

In this paper, the theories of spatial data mining and geographic information system are described firstly, and the integration model of the spatial data mining is also researched and analyzed in-depth. On the basis of this, a new GIS system structure based on the spatial data mining is presented, which has the advantages of good universality, interaction and easy realization comparing with other structures.
Evaluating privacy threats in released database views by symmetric indistinguishability
Authors: Chao Yao, Lingyu Wang, X. Sean Wang, Claudio Bettini, Sushil Jajodia
Venue: Journal of Computer Security (2009)

A privacy violation occurs when the association between an individual identity and data considered private by that individual is obtained by an unauthorized party. Uncertainty and indistinguishability are two independent aspects that characterize the degree of this association being revealed. Indistinguishability refers to the property that the attacker cannot see the difference among a group of individuals, while uncertainty refers to the property that the attacker cannot tell which private value, among a group of values, an individual actually has. This paper investigates the notion of indistinguishability as a general form of anonymity, applicable, for example, not only to generalized private tables, but to relational views and to sets of views obtained by multiple queries over a private database table. It is shown how indistinguishability is highly influenced by certain symmetries among individuals, in the released data, with respect to their private values. The paper provides both theoretical results and practical algorithms for checking if a specific set of views over a private table provide sufficient indistinguishability.
Integrating Support for Collaboration-unaware VRML Models into Cooperative Applications
Authors: Werner Geyer, Martin Mauve
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

This paper presents design and architecture of the distributed virtual reality service (dvr) which allows collaboration-unaware VRML animations and simulations to be integrated into cooperative applications. The dvr service realizes the distribution of VRML content to a group of participants via multicast. User interactions with the VRML model are synchronized in a manner transparent to the VRML content. To demonstrate the feasibility of our novel approach, we have successfully integrated the distributed virtual reality service into the digital lecture board which is a shared whiteboard tailored to the specific needs of collaborative work, for instance, in the area of computer-based distance education.
A new min: fault-tolerant advance omega network
Authors: Rita Mahajan, Renu Vig
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

A new type of MIN, Advanced Omega network, which using 4×4 switches, is proposed on the basis of the idea of the Delta network and the Omega network. In this paper, it is proved that 4×4 switches have the better performance/cost ratios than 2×2 switches based on the current level of the VLSI technology. This paper expounds its topological properties and routing algorithm and makes performance/cost ratios comparisons. And furthermore a fault-tolerant Advanced Omega network is discussed in detail, which has a good reliability and nonblocking capability in complex parallel systems.
Fast phase-based registration of multimodal image data
Authors: Alexander Wong, Paul Fieguth
Venue: Signal Processing (2009)

An interesting problem in pattern recognition is that of image registration, which plays an important role in many vision-based recognition and motion analysis applications. Of particular interest among registration problems are multimodal registration problems, where the images exist in different feature spaces. State-of-the-art phased-based approaches to multimodal image registration methods have provided good accuracy but have high computational cost. This paper presents a fast phase-based approach to registering multimodal images for the purpose of initial coarse-grained registration. This is accomplished by simultaneously performing both globally exhaustive dynamic phase sub-cloud matching and polynomial feature space transformation estimation in the frequency domain using the fast Fourier transform (FFT). A multiscale phase-based feature extraction method is proposed that determines both the location and size of the dynamic sub-clouds being extracted. A simple outlier pruning based on resampling is used to remove false keypoint matches. The proposed phase-based approach to registration can be performed very efficiently without the need for initial estimates or equivalent keypoints from both images. Experimental results show that the proposed method can provide accuracies comparable to the state-of-the-art phase-based image registration methods for the purpose of initial coarse-grained registration while being much faster to compute.
Extending styles to hypermedia documents
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Abstract: In this paper, we extend the notion of style, widely used in modern desktop publishing systems, to hypermedia documents. We also show how such styles can be used to provide different views of the same hyperdocument (e.g. English vs. Japanese).
Cramer&ndash;Rao bound and minimum variance unbiased estimator for joint sampling clock offset and channel taps in MC-CDMA systems
Authors: Amir Seirafian, Vahid Tabataba Vakily
Venue: International Journal of Communication Systems (2009)

Exact closed-form expressions of the Cramer&ndash;Rao bound (CRB) for joint sampling clock offset and channel taps are obtained in multi-carrier code division multiple access systems. CRB is undoubtedly the most well known variance's bound to determine. It provides a benchmark against which we can compare the performance of any unbiased estimator. Furthermore, minimum variance unbiased (MVU) estimator for these parameters is proposed. Moreover, maximum likelihood (ML) and least-squares estimators for joint sampling clock offset and channel taps are presented. Best linear unbiased estimator is also introduced just for channel taps. The performances of the estimators are compared through simulation results with the proposed CRB. Our results show the better performances of MVU and ML estimators with more computational complexity compared with the others. Copyright &copy; 2008 John Wiley & Sons, Ltd.
An improved DFT-IDFT based ICI cancellation scheme for OFDM systems
Authors: Arvind Kumar, Rajoo Pandey
Venue: Proceedings of the 5th conference on Applied electromagnetics, wireless and optical communications (2007)

Orthogonal frequency division multiplexing is widely known as the promising technique for the broadband wireless mobile communication system. The main drawback of OFDM systems is its sensitivity to frequency offset, which causes intercarrier interference (ICI) in the OFDM symbols. This ICI degrades the bit error rate (BER) performance of the system. In this paper an improved discrete Fourier transform-inverse discrete Fourier transform (DFT-IDFT) based ICI cancellation scheme is proposed to improve the system performance. The simulation results show that there is satisfactory improvement in the bit error rate (BER) performance of the present scheme.
Speed up Marouf and Friedman TSC berger codes checker
Authors: Hoda B. Abugharsa, Ali H. Maamar
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

As the scale of integrated circuit has increased so also has the occurrence of intermittent faults. The characteristics of these types of faults render them undetectable by standard test strategies. This is particularly problematic with the wide use of complex circuits in safety-critical applications. Ensuring the reliability of these systems is a major testing challenge. The detection of intermittent faults requires the use of Concurrent Error Detection (coding) techniques. Berger codes are optimal separable codes that detect all unidirectional errors. It can be Maximum Length Berger MLB code or Non Maximum length Berger NMLB code. Totally self checking (TSC) checkers are considered as an approach to achieve CED. Marouf and Freidman have proposed a TSC Berger codes checker [1]. They have presented two procedures for MLB and NMLB codes. This paper proposes to speed up the MLB code TSC checker in order to speed up the system.
Restricted shortest paths in 2-circulant graphs
Authors: T. Dobravec, B. Robič
Venue: Computer Communications (2009)

Semi-directed 2-circulant graph is a subgraph of an (undirected) 2-circulant graph in which the links of one type (i.e., short or long) are directed while the other links are undirected. The shortest paths in semi-directed circulant graphs are called the restricted shortest paths in 2-circulant graphs. In this paper we show that the problem of finding the restricted shortest paths is equivalent (1) to solving an optimization problem which involves Diophantine equations and (2) to the closest vector problem in a subset of a point lattice of all cyclic paths of the graph. We also present our new, efficient algorithm for constructing the restricted shortest paths which requires O(logn) arithmetic operations.
Ontology-oriented Petri Net Model of Semantics Service Composition
Authors: Xiaoping Yang, Xiangbing Zhou
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

In order to solve problems of semantics recognition and information extraction in the process of service composition, we proposed a Petri Net model of semantics service composition based on Ontology. Firstly, which build a described approach of semantics service composition ontology-oriented, and exploits property of WSMO to describe; Secondly,build Petri Net model of semantics service composition, which design grammar detected and semantics validated to implement the model in the process service composition, and apply greed genetic algorithm to optimize the model, which to meet demand of business logic. Finally, in the Aciera Ontology Library(AOL), application and analysis showed that efficiency of service composition is better than tradition method, and implemented function is more precision.
Rough set based hybrid algorithm for text classification
Authors: Duoqian Miao, Qiguo Duan, Hongyun Zhang, Na Jiao
Venue: Expert Systems with Applications: An International Journal (2009)

Automatic classification of text documents, one of essential techniques for Web mining, has always been a hot topic due to the explosive growth of digital documents available on-line. In text classification community, k-nearest neighbor (kNN) is a simple and yet effective classifier. However, as being a lazy learning method without premodelling, kNN has a high cost to classify new documents when training set is large. Rocchio algorithm is another well-known and widely used technique for text classification. One drawback of the Rocchio classifier is that it restricts the hypothesis space to the set of linear separable hyperplane regions. When the data does not fit its underlying assumption well, Rocchio classifier suffers. In this paper, a hybrid algorithm based on variable precision rough set is proposed to combine the strength of both kNN and Rocchio techniques and overcome their weaknesses. An experimental evaluation of different methods is carried out on two common text corpora, i.e., the Reuters-21578 collection and the 20-newsgroup collection. The experimental results indicate that the novel algorithm achieves significant performance improvement.
Parallel-processing a large scientific problem
Authors: Robert Hiromoto
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

We discuss a parallel-processing experiment that uses a particle-in-cell (PIC) code to study the feasibility of doing large-scale scientific calculations on multiple-processor architectures. A multithread version of this Los Alamos PIC code was successfully implemented and timed on a UNIVAC System 1100/80 computer. Use of a single copy of the instruction stream, and common memory to hold data, eliminated data transmission between processors. The multiple-processing algorithm exploits the PIC code's high degree of large, independent tasks, as well as the configuration of the UNIVAC System 1100/80. Timing results for the multithread version of the PIC code using one, two, three, and four identical processors are given and are shown to have promising speedup times when compared to the overall run times measured for a single-thread version of the PIC code.
Getting Started with SAS Enterprise Miner 5.3
Authors: SAS Publishing
Venue:  (2008)

SAS Enterprise Miner 5.3 is the SAS data mining solution that addresses the entire data mining process using an intuitive Java point-and-click interface. This guide introduces you to the core functionality of SAS Enterprise Miner and shows you how to perform basic data mining tasks. You will learn how to use the graphical user interface (GUI) tools to create and manage process flow diagrams and projects and to export mining results for reporting and integration with other SAS software. The data mining tasks you will learn include sampling, exploring, modifying, modeling, and assessing data in order to create and refine predictive models. Getting Started with Enterprise Miner 5.3 provides step-by-step examples that create a complete process flow diagram, including graphic results. This title is also available online and in hardcopy format.
More Efficient VLR Group Signature Satisfying Exculpability
Authors: Jingliang Zhang, Lizhen Ma, Rong Sun, Yumin Wang
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this letter, we improve NF'07 (Nakanishi and Funabiki) VLR group signature scheme such that it satisfies exculpability and has lower computation costs. In the proposed scheme, a group member generates his own private key together with the group manager in order to realize exculpability while the signature size is not made longer. Also, a new revocation check method is proposed at the step of verifying, and the computation costs of verifying are independent of the number of the revoked members, while they are linear with the number of the revoked members in the original scheme. Thus, the proposed scheme is more efficient than the original scheme and can be applicable to mobile environments such as IEEE 802.1x.
Succinct Greedy Graph Drawing in the Hyperbolic Plane
Authors: David Eppstein, Michael T. Goodrich
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

We describe a method for producing a greedy embedding of any n-vertex simple graph G in the hyperbolic plane, so that a message M between any pair of vertices may be routed by having each vertex that receives M pass it to a neighbor that is closer to M's destination. Our algorithm produces succinct drawings, where vertex positions are represented using O(logn) bits and distance comparisons may be performed efficiently using these representations.
Professional Microsoft SQL Server 2008 Integration Services
Authors: Brian Knight, Erik Veerman, Grant Dickinson, Douglas Hinson, Darren Herbold
Venue: Wrox Programmer To Programmer (2008)

The new edition of the successful previous version is 25 percent revised and packed with more than 200 pages of new material on the 2008 release of SQL Server Integration Services (SSIS) Renowned author Brian Knight and his expert coauthors show developers how to master the 2008 release of SSIS, which is both more powerful and more complex than ever Case studies and tutorial examples acquired over the three years since the previous edition will contribute to helping illustrate advanced concepts and techniques New chapters include coverage of data warehousing using SSIS, new methods for managing the SSIS platform, and improved techniques for ETL operations
A hybrid element approach to three dimensional problems of cracked anisotropic multi-material
Authors: Vincent Magnier, Géry de Saxcé
Venue: Finite Elements in Analysis and Design (2009)

This work deals with the extraction of stress intensity factors in the three dimensional problems. In order to have a good estimation of them, a special class of mixed finite element, named ''Metis'' element (mongrel element), coupled to a code evaluating overstress, is used. After a brief explanation of the asymptotic model leading to stress/displacement in the vicinity of a delamination crack or a singular line at the junction between different materials, a simple and accurate numerical method is proposed. Next, the singular part is included in Metis element to estimate simultaneously the structural variables and the stress intensity factors. Finally, a numerical example on a bimaterial is illustrated and compared with a case found in the literature.
Some preconditioning techniques for linear systems
Authors: Qingbing Liu
Venue: WSEAS Transactions on Mathematics (2008)

New convergence intervals of parameters αi are derived and applied for solving the modified linear systems, which enables a better understanding of how parameters should be chosen. The convergence theorem for H-matrix is given. Meanwhile, we discuss the convergence results for M-matrices linear systems and give some new preconditioners. Numerical examples are used to illustrate our results.
All I really need to know I learned in CS1
Authors: Elliot B. Koffman
Venue: ACM SIGCSE Bulletin (2009)

Over the last 45 years as a student and faculty member in Computer Science, I have been involved in learning, teaching, and writing for the CS1 course. I have authored or co-authored textbooks for CS1 in nine different programming languages from Fortran to Java. Each new language was used because of a particular set of features it provided to solve the critical problem in programming or software development of the day. This talk will take a look back at these languages and the extent to which they succeeded. I will also take a look ahead to see what direction CS1 might be taking in the future.
Defining and measuring physicians' responses to clinical reminders
Authors: Geva Vashitz, Joachim Meyer, Yisrael Parmet, Roni Peleg, Dan Goldfarb, Avi Porath, Harel Gilutz
Venue: Journal of Biomedical Informatics (2009)

Decision-support systems, and specifically rule-based clinical reminders, are becoming common in medical practice. Despite their potential to improve clinical outcomes, physicians do not always use information from these systems. Concepts from the cognitive engineering literature on users' responses to warning systems may help to define physicians' responses to reminders. Based on this literature, we suggest an exhaustive set of possible responses to clinical reminders, consisting of four responses named ''Compliance'', ''Reliance'', ''Spillover'' and ''Reactance''. We suggest statistical measures to estimate these responses and empirically demonstrate them on data from a large-scale clinical reminder system for secondary prevention of cardiovascular diseases. There was evidence for Compliance, probably since the physicians found the reminders informative, but not for Reliance, in line with the notion that Compliance and Reliance are two distinct types of trust in information from decision-support systems. Our research supports the notion that CDSS can promote closing the treatment gap and improve physicians' adherence to guidelines.
Determinants of service quality and continuance intention of online services: The case of eTax
Authors: Paul Jen-Hwa Hu, Susan A. Brown, James Y. L. Thong, Frank K. Y. Chan, Kar Yan Tam
Venue: Journal of the American Society for Information Science and Technology (2009)

This article examines the determinants of service quality and continuance intention of online services. We proposed and empirically tested a model with both service and technology characteristics as the main drivers of service quality and subsequent continuance intention of eTax, an electronic government (eGovernment) service that enables citizens to file their taxes online. Our data were collected via a two-stage longitudinal online survey of 518 participants before and after they made use of the eTax service in Hong Kong. The results showed that both service characteristics (i.e., security and convenience) and one of the technology characteristics (i.e., perceived usefulness, but not perceived ease of use) were the key determinants of service quality. Another interesting and important finding that runs counter to the vast body of empirical evidence on predicting intention is that perceived usefulness was not the strongest predictor of continuance intention but rather service quality was. To provide a richer picture of these relationships, we also conducted a post-hoc analysis of the effects of service and technology characteristics on the individual dimensions of service quality and their subsequent impact on continuance intention and found assurance and reliability to be the only significant predictors of continuance intention. We present implications for research and practice related to online services. &copy; 2009 Wiley Periodicals, Inc.
The role of stacking faults and their associated 0.13ev acceptor state in doped and undoped ZnO layers and nanostructures
Authors: K. Thonke, M. Schirra, R. Schneider, A. Reiser, G. M. Prinz, M. Feneberg, J. Biskupek, U. Kaiser, R. Sauer
Venue: Microelectronics Journal (2009)

An emission band at 3.31eV is frequently observed in low-temperature photoluminescence (PL) measurements on ZnO p-doped with group-V elements, and also on nominally undoped ZnO layers and nanostructures. It has alternatively been ascribed to LO- or TO-phonon replicas of free excitons, to acceptor-bound excitons, to donor-acceptor pair transitions, to two-electron satellites of donor-bound excitons, or to free-to-bound transitions. This band frequently dominates the PL of ZnO nanostructures and layers at room temperature. Annealing leads to drastic changes in its intensity. We report on low-temperature cathodoluminescence measurements with very high spatial resolution and high-resolution transmission electron microscope investigations carried out on the same pieces of hetero-epitaxial ZnO samples with unusual layer orientation. These data allow us to correlate this emission unambiguously with c-plane stacking faults. The emission is found to be due to the recombination of a free electron with a hole bound to a relatively shallow acceptor state ~130meV above the valence band edge. Locally, these acceptor states occur in high concentrations of up to some 10^1^8cm^-^3, and thus lead to strong two-dimensional perturbations of the free carrier concentration. They have severe implications for the conductivity of layers and nanostructures in general, and on the interpretation of Hall and luminescence data in particular. Literature data are critically reviewed in the light of these findings.
Modified movement force vector in an electromagnetism-like mechanism for global optimization
Authors: Ana Maria A. C. Rocha, Edite M. G. P. Fernandes
Venue: Optimization Methods Software (2009)

This paper presents an algorithm for solving global optimization problems with bounded variables. The algorithm is a modification of the electromagnetism-like mechanism proposed by Birbil and Fang [An electromagnetism-like mechanism for global optimization, J. Global Optim. 25 (2003), pp. 263-282]. The differences are mainly on the local search procedure and on the force vector used to move each point in the population. Several widely-used benchmark problems were solved in a performance evaluation of the new algorithm when compared with the original one. A comparison with other stochastic methods is also included. The algorithm seems appropriate for large dimension problems.