ppxscal/embedding_network huggingface dataset:
Pipelined IIR Filter Architecture Using Pole-Radius Minimization
Authors: Nigel Boston
Venue: Journal of VLSI Signal Processing Systems (2005)

An extension of a polynomial consists of the polynomial plus higher power terms. Given a polynomial with real coefficients and an integer larger than its degree, a method is given that produces a finite list of extensions of degree this larger integer such that this list necessarily contains the extension whose largest root is as small as possible. This extension is called the pole radius minimizer. The pole radius minimizer is then found by the finite check of comparing the polynomials in the list. The method is applied to obtain filter transformations that are optimal as regards throughput, but also have considerable savings in hardware overhead compared with standard methods such as Scattered Lookahead and Minimum Order Augmentation. The table in Section 5 gives an explicit comparison for various kinds of filters.
From design to analysis models: a kernel language for performance and reliability analysis of component-based systems
Authors: Vincenzo Grassi, Raffaela Mirandola, Antonino Sabetta
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

To facilitate the use of non-functional analysis results in the selection and assembly of components for component-based systems, automatic prediction tools should be devised, to predict some overall quality attribute of the application without requiring extensive knowledge of analysis methodologies to the application designer. To achieve this goal, a key idea is to define a model transformation that takes as input some "design-oriented" model of the component assembly and produces as a result an "analysis-oriented" model that lends itself to the application of some analysis methodology. However, to actually devise such a transformation, we must face both the heterogeneous design level notations for component-based systems, and the variety of non-functional attributes and related analysis methodologies we could be interested in. In this perspective, we define a kernel language whose aim is to capture the relevant information for the analysis of non-functional attributes of component-based systems, with a focus on performance and reliability. Using this kernel language as a bridge between design-oriented and analysis-oriented notations we reduce the burden of defining a variety of direct transformations from the former to the latter to the less complex problem of defining transformations to/from the kernel language. The proposed kernel language is defined within the MOF (Meta-Object Facility) framework, to allow the exploitation of MOF-based model transformation facilities.
An Efficient Clustering Algorithm Using Graphical Techniques
Authors: Quoc-Nam Tran
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

This paper aims at an efficient, reliable and scalable density-based clustering algorithm. Using efficient techniques from computational geometry and computer aided geometric design such as the algorithms for range searching, closest pair searching and splines, we are able to derive a clustering algorithm with O(n · log n) in time complexity using O(n · log n/ log log n) in space. In contrast to other density-based algorithms, our algorithm overcomes the use of the parameters for the radius and the minimum number of points in the neighborhood. Comparisons between our algorithm and other known clustering algorithms are provided.
CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions
Authors: John Black, Phillip Rogaway
Venue: Journal of Cryptology (2005)

We suggest some simple variants of the CBC MAC that enable the efficient authentication of arbitrary-length messages. Our constructions use three keys, K1, K2, K3, to avoid unnecessary padding and MAC any message M &#x2208; {0,1}* using max{1, &#x2308; |M|/n&#x2309;} applications of the underlying n-bit block cipher. Our favorite construction, XCBC, works like this: if |M| is a positive multiple of n then XOR the n-bit key K2 with the last block of M and compute the CBC MAC keyed with K1; otherwise, extend M&#x2019;s length to the next multiple of n by appending minimal 10&#x2113; padding (&#x2113; &#x2265; 0), XOR the n-bit key K3 with the last block of the padded message, and compute the CBC MAC keyed with K1. We prove the security of this and other constructions, giving concrete bounds on an adversary&#x2019;s inability to forge in terms of his inability to distinguish the block cipher from a random permutation. Our analysis exploits new ideas which simplify proofs compared with prior work.
Pyramid Surface Reconstruction from Normal
Authors: Yufeng Chen, Haitao Wang, Yangsheng Wang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

In this paper, a novel method is introduced to estimate height from surface normal and implemented in a photometric 3D reconstruction system, base on the improved optimization function in the height domain. To avoid the global distortion from local integration, a pyramid reconstruction ideal is proposed, which sample the surface every certain points to form the separated point sets called sub-surfaces, and then step by step the coarser sub-surfaces is combined into finer ones and eventually derive the whole surface. Experiment shows that our method is faster and more accurate than some of the main method in this field.
Efficient Algorithms for Pattern Matching on Directed Acyclic Graphs
Authors: Li Chen, Amarnath Gupta, M. Erdem Kurul
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Recently graph data models have become increasingly popular in many scientific fields. Efficient query processing over such data is critical. Existing works often rely on index structures that store pre-computed transitive relations to achieve efficient graph matching. In this paper, we present a family of stack-based algorithms to handle path and twig pattern queries for directed acyclic graphs (DAGs) in particular. With the worst-case space cost linearly bounded by the number of edges in the graph, our algorithms achieve a quadratic runtime complexity in the average size of the query variable bindings. This is optimal among the navigation-based graph matching algorithms.
NLP and IR approaches to monolingual and multilingual link detection
Authors: Ying-Ju Chen, Hsin-Hsi Chen
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

This paper considers several important issues for monolingual and multilingual link detection. The experimental results show that nouns, verbs, adjectives and compound nouns are useful to represent news stories; story expansion is helpful; topic segmentation has a little effect; and a translation model is needed to capture the differences between languages.
Intrusion Detection System to Detect Variant Attacks Using Learning Algorithms with Automatic Generation of Training Data
Authors: Akira Yamada, Yutaka Miyake, Keisuke Takemori, Toshiaki Tanaka
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Although there are many anomaly detection systems based on learning algorithms that are able to detect unknown attacks or variants of known attacks, most systems require sophisticated training data for supervised learning. Because it is difficult to prepare the training data, anomaly detection systems are not widely used in the practical environment. In this paper, we propose an anomaly detection system based on machine learning that requires no prepared training data. The system generates sophisticated training data that is applicable to the learning by processing alerts that a signature based Intrusion Detection System (IDS) outputs. We evaluated the system using two types of traffic: the 1999 DARPA IDS evaluation data and the security scanner data. The results show that the training data generated by the system is suitable for learning attack behaviors and the system is able to detect variants of worms and known attacks.
Jef Raskin, pioneer
Authors: Richard Karpinski
Venue: interactions (2005)

We note with sadness the passing of Jef Raskin on February 26, 2005. Jef Raskin, a mathematician, orchestral soloist and composer, professor, bicycle racer, model airplane designer, and pioneer in the field of human-computer interactions, died peacefully at home in California surrounded by his family and loved ones. He had recently been diagnosed with pancreatic cancer. Read his obituary at www.raskincenter.org/pressrelease.html.
Mobile Code Paradigms and Security Issues
Authors: R. R. Brooks
Venue: IEEE Internet Computing (2004)

Programs are no longer constrained to execute on the nodes where they reside, and many systems therefore support code mobility.Although mobile code has yet to fully realize its promise of increased system flexibility, scalability, and reliability, the marketplace has embraced mobile code implementations such as Java, Jini, PostScript, and .NET. Several mobile code paradigms exist, and mobile code use raises many security concerns. Here, the author maps a taxonomy of mobile code paradigms to a taxonomy of network security vulnerabilities, revealing that many important security issues are being ignored.
Enhancing Source-Location Privacy in Sensor Network Routing
Authors: Pandurang Kamat, Yanyong Zhang, Wade Trappe, Celal Ozturk
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

One of the most notable challenges threatening the successful deployment of sensor systems is privacy. Although many privacy-related issues can be addressed by security mechanisms, one sensor network privacy issue that cannot be adequately addressed by network security is source-location privacy. Adversaries may use RF localization techniques to perform hop-by-hop traceback to the source sensorýs location. This paper provides a formal model for the source-location privacy problem in sensor networks and examines the privacy characteristics of different sensor routing protocols. We examine two popular classes of routing protocols: the class of flooding protocols, and the class of routing protocols involving only a single path from the source to the sink. While investigating the privacy performance of routing protocols, we considered the tradeoffs between location-privacy and energy consumption. We found that most of the current protocols cannot provide efficient source-location privacy while maintaining desirable system performance. In order to provide efficient and private sensor communications, we devised new techniques to enhance source-location privacy that augment these routing protocols. One of our strategies, a technique we have called phantom routing, has proven flexible and capable of protecting the sourceýs location, while not incurring a noticeable increase in energy overhead. Further, we examined the effect of source mobility on location privacy. We showed that, even with the natural privacy amplification resulting from source mobility, our phantom routing techniques yield improved source-location privacy relative to other routing methods.
Network security architecture
Authors: Mohamad R. Neilforoshan
Venue: Journal of Computing Sciences in Colleges (2004)

One of the areas that should receive substantial attention in the CS curriculum is network security. The fact is that most CS curricula treat this issue as a subset of a course in networking, whereas it deserves its own place among other courses in the curriculum. In this paper we discuss various topics that could be included in such a course.We will first discuss different threats, their causes, and effects on the network. We will then address the measures that can be taken to secure the network. Our discussion will continue with factors that affect network security and the security services in OSI. Finally, we will cover the OSI security mechanisms to meet the network's security goals, and their relationship to each of the layers of OSI.
Constructing Different Learning Paths Through e-Learning
Authors: Kyoung Mi Yang, Rockford J. Ross, Seong Baeg Kim
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

It is a challenging problem to apply an efficient teaching-learning method to the situation where learners have diverse computing backgrounds and the learning content to be covered is also in the broad coverage. In this case, it's required that more sophisticated teaching-learning method should be devised. We have drawn a method which can be applied to that case efficiently by using web technology. In our approach, we focus on finding out classification methods for both learners and learning content based on the web. To make classification and manipulation of learning content ease, we reorganize learning content in order to have discrete form by introducing the concept of the knowledge unit which is extracted from each topic. Also, to make classification and diagnostic of learners ease, we develop questions to measure them and analyze each question using item response theory (IRT) on the web. From the experiment of students sampled using our method, we show that learners with various backgrounds and the learning content with distribution on the broad range can be categorized effectively into several groups. Also, we describe how to apply our method to the introductory courses at postsecondary level.
A scalable authorization approach for the Globus grid system
Authors: Jiageng Li, David Cordes
Venue: Future Generation Computer Systems (2005)

Grid computing has received widespread attention in recent years as a significant new research field. To date, there has been only limited work on the problem of grid system authorization. In this paper, we address the authorization problem in grid system environments and propose a solution for authorization within Globus system. Our authorization approach is based on distributed authorization servers and extensions to Globus' Metacomputing Directory Service (MDS). The goal is to provide a scalable authorization approach that is able to meet the requirements of a dynamic grid environment.
Information-Theoretic Active Polygons for Unsupervised Texture Segmentation
Authors: Gozde Unal, Anthony Yezzi, Hamid Krim
Venue: International Journal of Computer Vision (2005)

Curve evolution models used in image segmentation and based on image region information usually utilize simple statistics such as means and variances, hence can not account for higher order nature of the textural characteristics of image regions. In addition, the object delineation by active contour methods, results in a contour representation which still requires a substantial amount of data to be stored for subsequent multimedia applications such as visual information retrieval from databases. Polygonal approximations of the extracted continuous curves are required to reduce the amount of data since polygons are powerful approximators of shapes for use in later recognition stages such as shape matching and coding. The key contribution of this paper is the development of a new active contour model which nicely ties the desirable polygonal representation of an object directly to the image segmentation process. This model can robustly capture texture boundaries by way of higher-order statistics of the data and using an information-theoretic measure and with its nature of the ordinary differential equations. This new variational texture segmentation model, is unsupervised since no prior knowledge on the textural properties of image regions is used. Another contribution in this sequel is a new polygon regularizer algorithm which uses electrostatics principles. This is a global regularizer and is more consistent than a local polygon regularization in preserving local features such as corners.
Existence of the Exact CNOT on a Quantum Computer with the Exchange Interaction
Authors: Y. Kawano, K. Kimura, H. Sekigawa, M. Noro, K. Shirayanagi, M. Kitagawa, M. Ozawa
Venue: Quantum Information Processing (2005)

We prove the existence of the exact CNOT gate on aquantum computer with the nearest-neighbor exchange interaction in the serial operation mode. Its existence has been an open problem, though a concrete sequence of exchange operations, which is approximately locally equivalent to the exact CNOT, has already been found. We found the exact values of time parameters (exchange rates between qubits) by using computer algebraic techniques such as Gröbner bases and resultants. These techniques have been widely used for finding rigorous solutions of simultaneous algebraic equations, and here are applied to finding quantum gates on the decoherence-free subsystem for the first time.
Image processing algorithm of computer-aided diagnosis in lung cancer screening by CT
Authors: Shinji Yamamoto
Venue: Systems and Computers in Japan (2005)

This paper presents a systematic overview of our work for more than a decade on image-processing algorithms for lung cancer screening by CT. Most of the images handled at the mass-screening level are normal cases, and the rate of detection of lung tumors is no more than a few percent. In order to detect such rare tumors with high accuracy, there must be a technique that can correctly detect small changes in the image. On the other hand, the problem can arise that a large number of normal tissues are incorrectly detected. This paper outlines the image-processing algorithm developed by us to correctly detect tumors while reducing overdetection. In particular, we describe in detail the principles and properties of quoit filtering, which was devised for accurate detection of tumors in the first stage. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(7): 40&ndash;53, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20156
Aggregate nearest neighbor queries in spatial databases
Authors: Dimitris Papadias, Yufei Tao, Kyriakos Mouratidis, Chun Kit Hui
Venue: ACM Transactions on Database Systems (TODS) (2005)

Given two spatial datasets P (e.g., facilities) and Q (queries), an aggregate nearest neighbor (ANN) query retrieves the point(s) of P with the smallest aggregate distance(s) to points in Q. Assuming, for example, n users at locations q1,&hellip;qn, an ANN query outputs the facility p &isin; P that minimizes the sum of distances &verbar;pqi&verbar; for 1 &le; i &le; n that the users have to travel in order to meet there. Similarly, another ANN query may report the point p &isin; P that minimizes the maximum distance that any user has to travel, or the minimum distance from some user to his/her closest facility. If Q fits in memory and P is indexed by an R-tree, we develop algorithms for aggregate nearest neighbors that capture several versions of the problem, including weighted queries and incremental reporting of results. Then, we analyze their performance and propose cost models for query optimization. Finally, we extend our techniques for disk-resident queries and approximate ANN retrieval. The efficiency of the algorithms and the accuracy of the cost models are evaluated through extensive experiments with real and synthetic datasets.
Advanced Modeling of Quantum Well Semiconductor Lasers Based on Wigner Function Approach
Authors: Marek S. Wartak, Philip Weetman
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

We describe the theory and first results obtained from a newly developed advanced model of semiconductor lasers based on Wigner functions. The approach makes it possible to simultaneously analyze spectral and dynamical properties of the laser. It incorporates classical and heterostructure potentials and classical electromagnetic interactions. Some numerical results are presented.
Experimental investigation of fabrication properties of electroformed Ni-based micro mould inserts
Authors: Chao-Min Cheng, Ren-Haw Chen
Venue: Microelectronic Engineering (2004)

In this work, Ni and Ni-Fe micro mould inserts with high aspect ratios are fabricated by Si-LIGA. Many analyses were performed to elucidate the material properties of Ni-based micro mould inserts. The surface properties were examined using a scanning probe microscope (SPM). Nanoindentation was used to measure the elastic modulus and hardness of Ni-Fe microstructures. When the iron content of Ni-Fe micro mould inserts exceeded 12%, the grain size of the Ni-Fe alloy was under 15 nm. Additionally, the mechanical properties of Ni-based microstructures obtained by electroforming are superior to those obtained by casting or powder metallurgy. Satisfactory electroforming current densities for obtaining a mould insert with a fine surface profile ranged from 4 ASD to 6 ASD.
The use of reliability techniques to predict the recovery rate of recovering alcohol addicts
Authors: K. E. B. Thornton, A. Lazzarini
Venue: Journal of the American Society for Information Science and Technology (2005)

In this article, we describe a new means of presenting and analyzing information regarding recovering alcoholics. We show that the use of reliability life-test techniques--specifically Weibull plots--can be used not only to gain an understanding of the recovery rate of alcoholics who are undergoing counseling during their recovery process, but also to present a visual indication of the speed and nature of their recovery. We show that by considering the movement of the recovering addicts with time--as a direct analogy with the degradation of samples on device life-test--it is possible to predict the time and path that will be taken for a recovering addict to reach a given recovery stage. We also show that, in a direct analogy with overstress life-tests, it is possible to predict the "time to recovery of addict" based upon the time taken to reach a "part-way" recovery step (or stage). The results also show that those presenting with different addiction types follow varying recovery models as do those from different locations. This information could be particularly useful in providing appropriate support to those recovering from multiple addictions as well as those living in different locations. The results of this work have great potential for use in this and any other therapeutic interventions, and in medical applications such as the observed stepwise recovery from major operations and RTAs (road traffic accidents). Hence the results of this work have the potential to affect the health of the nation by enabling appropriate patient support, and, by the ensuing cost-effective support, enable the maximum number possible of patients to be supported by the limited resources of the centralized health-care umbrella.
Building Bayesian Network Models in Medicine: The MENTOR Experience
Authors: Subramani Mani, Marco Valtorta, Suzanne McDermott
Venue: Applied Intelligence (2005)

An experiment in Bayesian model building from a large medical dataset for Mental Retardation is discussed in this paper. We give a step by step description of the practical aspects of building a Bayesian Network from a dataset. We enumerate and briefly describe the tools required, address the problem of missing values in big datasets resulting from incomplete clinical findings and elaborate on our solution to the problem. We advance some reasons why imputation is a more desirable approach for model building than some other ad hoc methods suggested in literature. In our experiment, the initial Bayesian Network is learned from a dataset using a machine learning program called CB. The network structure and the conditional probabilities are then modified under the guidance of a domain expert. We present validation results for the unmodified and modified networks and give some suggestions for improvement of the model.