ppxscal/embedding_network huggingface dataset:
The modular covariance adjustment adaptive array for CDMA wireless communications
Authors: T.-C. Liu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

A new adaptive array system is integrated into a code division multiple access (CDMA) digital cellular communication system to solve the near-far problem. Specifically, the author considers combining additional covariance adjustment modules and a multiweight least mean square (LMS) adaptive array in a base station for cochannel interference cancellation to a large number of system users. The design enables reception of weak desired sources by using few antenna elements to cancel a large number of cochannel interference sources that are stronger than the desired sources and even when interference sources arrive from or close to the desired source directions. A modular adaptive implementation scheme is also given for the covariance adjustment that provides a computation benefit. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
On armstrong relations for strong dependencies
Authors: Vu Duc Thi, Nguyen Hoang Son
Venue: Acta Cybernetica (2006)

The strong dependency has been introduced and axiomatized in [2], [3], [4], [5]. The aim of this paper is to investigate on Armstrong relations for strong dependencies. We give a necessary and sufficient condition for an abitrary relation to be Armstrong relation of a given strong scheme. We also give an effective algorithm finding a relation υ such that υ is Armstrong relation of a given strong scheme G = (U, S) (i.e. Sr = S, where Sr is a full family of strong dependencies of r, and Sis a set of all strong dependencies that can be derived from S by the system of axioms). We estimate this algorithm. We show that the time complexity of this algorithm is polynomial in |U| and |S|.
Methods for automatically evaluating answers to complex questions
Authors: Jimmy Lin, Dina Demner-Fushman
Venue: Information Retrieval (2006)

Evaluation is a major driving force in advancing the state of the art in language technologies. In particular, methods for automatically assessing the quality of machine output is the preferred method for measuring progress, provided that these metrics have been validated against human judgments. Following recent developments in the automatic evaluation of machine translation and document summarization, we present a similar approach, implemented in a measure called POURPRE, an automatic technique for evaluating answers to complex questions based on n-gram co-occurrences between machine output and a human-generated answer key. Until now, the only way to assess the correctness of answers to such questions involves manual determination of whether an information "nugget" appears in a system's response. The lack of automatic methods for scoring system output is an impediment to progress in the field, which we address with this work. Experiments with the TREC 2003, TREC 2004, and TREC 2005 QA tracks indicate that rankings produced by our metric correlate highly with official rankings, and that POURPRE outperforms direct application of existing metrics.
Invited Paper: Consistent Query Answering: Opportunities and Limitations
Authors: Jan Chomicki
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

This paper briefly reviews the recent literature on consistent query answering, an approach to handle database inconsistency in a systematic and logical manner based on the notion of repair. It discusses some computational and semantic limitations of consistent query answering, and summarizes selected research directions in this area.
Bridging the Ethernet-Ethernot Performance Gap
Authors: Pavan Balaji, Wu-chun Feng, Dhabaleswar K. Panda
Venue: IEEE Micro (2006)

Ethernet seeks to reach the system-area-network performance of Ethernot networks by introducing 10-Gigabit Ethernet and adding the hardware-offloaded protocol stacks that give Ethernots their performance edge. As this study shows, such moves might indeed be closing the gap.
Software Reliability Prediction and Assessment Using both Finite and Infinite Server Queueing Approaches
Authors: Wei-Chih Huang, Chin-Yu Huang, Chuan-Ching Sue
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

Over the past 30 years, many software reliability growth models (SRGMs) have been proposed for estimation of reliability growth of software. In fact, effective debugging will not be easy because the fault may not be immediately obvious. In the past, some researchers ever used an infinite server queueing (ISQ) model to describe the software debugging behavior. An infinite-server queueing model is considered where access of customers to service is controlled by a gate and the gate is open only if all servers are free. However, the finite server queueing (FSQ) model is first advantageously modeled as an infinite-server system. Thus, in this paper, we will show how to incorporate both FSQ and ISQ models into software reliability estimation and prediction. In addition, here we also consider the factor of perfect/imperfect debugging. Experimental results show that the proposed framework to incorporate both fault detection and correction processes for SRGM has a fairly accurate prediction capability.
Bilinear algorithms for discrete cosine transforms of prime lengths
Authors: Venkatram Muddhasani, Meghanad D. Wagh
Venue: Signal Processing (2006)

This paper presents a strategy to design bilinear discrete cosine transform (DCT) algorithms of prime lengths. We show that by using multiplicative groups of integers, one can identify and arrange the computation as a pair of convolutions. When the DCT length p is such that (p - 1)/2 is odd, the computation uses two (p - 1)/2 point cyclic convolutions. When (p - 1)/2 = 2m q with m > 0 and q odd, the computation requires one (p - 1)/2 point cyclic convolution and a combination of a q point cyclic convolution and a 2m point Hankel product. Using bilinear algorithms for convolutions and Hankel products, one gets a bilinear DCT algorithm. We also show that the additions required beyond the convolutions can be minimized by a small modification to the convolution algorithms. This minimization exploits the fact that efficient bilinear convolution algorithms are almost always based on Chinese Remainder Theorem.
Visualization methods for outdoor see-through vision
Authors: Takahiro Tsuda, Haruyoshi Yamamoto, Yoshinari Kameda, Yuichi Ohta
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

Visualizing occluded objects is a useful applications of Mixed Reality (MR), which we call "see-through vision." For this application, it is important to display occluded objects in such a manner that they can be recognized intuitively by the user.Here, we evaluated five visualization methods for see-through vision that help the user to intuitively recognize occluded objects in outdoor scenes: "elimination of occluding object," "ground grid," "overlaying model of occluding object," "top-down view," and "on-off switching of MR display." As we applied a new handheld MR device for outdoor see-through vision, we conducted subjective experiments to determine the best combination of methods. The experimental results indicated the combination of showing the ground grid, overlaying the wire-frame models of occluding objects, and top-down view to be optimal, while it is not necessary to display occluding objects for outdoor see-through vision with a handheld device, because users can see them with the naked eye.
Optimal sampling functions in nonuniform sampling driver designs to overcome the Nyquist limit
Authors: F. Papanfub, Y. Artyukh, E. Boole, D. Timmermann
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

In some applications the observed samples are inherently nonuniform. In contrast to that in this paper we take advantage of deliberate nonuniform sampling and perform DSP where the classical approaches leave off. For instance think about mobile communication or digital radio. Deliberate nonuniform sampling promises increased equivalent sampling rates with reduced overall hardware costs. The equivalent sampling rate is the sampling rate that a uniform sampling device would require in order to achieve the same processing bandwidth. While the equivalent bandwidth of a realizable system may well extend into the GHz range its mean sampling rate is usually in the MHz range. Current existing prototype systems achieve 40 times the bandwidth of a classic DSP system that would operate uniformly (cf. [Y. Artyukh, et al., Evaluation of Pseudorandom Sampling Process, 1997] and [Y. Artyukh, et al., virtual Oscilloscope of the DASP-Lab System 1997]). Throughout the literature on nonuniform sampling (e. g. [I. Bilinskis and A. Mikelsons, 1992], [F. Marvasti, 2001] and [J.J. Wojtiuk, 2000]) many sampling schemes have been investigated. In this paper the authors discuss a nonuniform sampling scheme that is especially suited to be implemented in digital devices, thus, fully exploiting state-of-the-art ADCs without violating their specifications. An analysis of the statistical properties of the algorithm is given to demonstrate common pitfalls and to prove its correctness.
Functional Neuroanatomy of the Semantic System: Divisible by What?
Authors: C. J. Mummery, K. Patterson, J. R. Hodges, C. J. Price
Venue: Journal of Cognitive Neuroscience (1998)

Studies of patients with brain damage suggest that specific brain regions may be differentially involved in representing/processing certain categories of conceptual knowledge. With regard to the dissociation that has received the most attention&mdash;between the domains of living things and artifacts&mdash;a debate continues as to whether these category-specific effects reflect neural implementation of categories directly or some more basic properties of brain organization. The present positron emission tomography (PET) study addressed this issue by probing explicitly for differential activation associated with written names of objects from the domains of living things or artifacts during similarity judgments about different attributes of these objects. Subjects viewed triads of written object names and selected one of two response words as more similar to a target word according to a specified perceptual attribute (typical color of the objects) or an associative attribute (typical location of the objects). The control task required a similarity judgment about the number of syllables in the target and response words. All tasks were performed under two different stimulus conditions: names of living things and names of artifacts. Judgments for both domains and both attribute types activated an extensive, distributed, left-hemisphere semantic system, but showed some differential activationparticularly as a function of attribute type. The left temporooccipito-parietal junction showed enhanced activity for judgments about object location, whereas the left anteromedial temporal cortex and caudate nucleus were differentially activated by color judgments. Smaller differences were seen for living and nonliving domains, the positive findings being largely consistent with previous studies using objects; in particular, words denoting artifacts produced enhanced activation in the left posterior middle temporal gyrus. These results suggest that, within a distributed conceptual system activated by words, the more prominent neural distinction relates to type of attribute.
Fabrication of submicron- or nano-sized mesa electrodes via AFM oxidation: Applications to metal ion detection
Authors: Younghun Kim, Inhee Choi, Sung Koo Kang, Kyunghee Choi, Jongheop Yi
Venue: Microelectronic Engineering (2005)

Conductive probe AFM local oxidation is a promising lithographic technique for use in fabricating submicron- or nano-scale structures. In this study, a metal ion detector with a submicron size electrode was fabricated by AFM lithography using a pre-programmed voltage and a non-etching method. The square frame of the mesa pattern was functionalized by APTES for the metal ion detection, and the remaining portion was used as an electrode by the self-assembly of MPTMS for Au metal deposition. In this module, no metal lining or lead line was required, because the conductive tip (mobile electrode) was in direct contact with the gold-deposited mesa portion (fixed electrode). The conductance changed with the quantity of adsorbed copper ions, due to electron tunneling between the mobile and surface electrodes.
Implementation of a Personalized Assessment Web Service
Authors: Lilia Cheniti-Belcadhi, Nicola Henze, Rafik Braham
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This paper describes the design, development and qualitative evaluation of a web-based personalized assessment service of an object-oriented programming course at the University of Sousse. The assessment service was integrated in the Personal Reader software, of the University of Hannover and was designed to select specific questions based on the progress and performance in the course of each learner individually. This paper identifies benefits to learners brought about with the use of a personalized assessment service. It describes and discusses a first experiment of this tool. The evaluation was completed with the assistance of a group of ten students with different levels of prior programming knowledge. The students are enrolled in a computer science degree program at the Informatics College (ISITC) of the University of Sousse. The personalized assessment framework is introduced, with a description of its architecture and functionalities. An analysis of learner's feedback following this experiment is also provided.
Implementation of the Fast H_\infty Filter in Real-Time Applications
Authors: Tomonori Katsumata, Kiyoshi Nishiyama, Katsuaki Sato
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)

A fast H_\infty filter (FHF) has been derived for identifying time-varying systems, which is capable of determining the forgetting factor that is optimal in the sense of H_\infty optimization. In this work, the performances of the FHF is evaluated in echo cancellation using a hand-made acoustic system.
Challenges of Acquisition Planning
Authors: Onur Demirors, Cigdem Gencel, Ayca Tarhan
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

Acquisition of software intensive systems demands significant work prior to establishing the contract. One of the significant challenges of precontract phase is acquisition planning. The activities such as estimation of required effort and determining proper structures for the acquisition project require unique approaches. In this study, experiences gained from two large innovative military applications are presented.
On continuity theorem for characteristic function of fuzzy variable
Authors: Lixing Yang, Baoding Liu
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2006)

Credibility distribution function is presented on the basis of credibility measure to describe fuzzy variable. Characteristic function of a fuzzy variable is defined as the Lebesgue-Stieltjes integral with respect to its credibility distribution function. In this paper, some mathematical properties of credibility distribution function are investigated. As a main result, continuity theorems of characteristic functions for fuzzy variables sequence are obtained.
GOB designs for authentication codes with arbitration
Authors: Gennian Ge, Ying Miao, L. Zhu
Venue: Designs, Codes and Cryptography (2006)

Combinatorial characterization of optimal authentication codes with arbitration was previously given by several groups of researchers in terms of affine ¿-resolvable + BIBDs and ¿-resolvable designs with some special properties, respectively. In this paper, we revisit this known characterization and restate it using a new idea of GOB designs. This newly introduced combinatorial structure simplifies the characterization, and enables us to extend Johansson's well-known family of optimal authentication codes with arbitration to any finite projective spaces with dimension greater than or equal to 3.
The NP-completeness column: The many limits on approximation
Authors: David S. Johnson
Venue: ACM Transactions on Algorithms (TALG) (2006)

This is the 25th edition of a column that covers new developments in the theory of NP-completeness. The presentation is modeled on that which M. R. Garey and I used in our book Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, 1979, hereinafter referred to as &ldquo;[G&J].&rdquo; Previous columns, the first 23 of which appeared in Journal of Algorithms, will be referred to by a combination of their sequence number and year of appearance, for example, [Col 1, 1981]. Full bibliographic details on the previous columns as well as downloadable unofficial versions of them can be found at http://www.reseach.att.com/~dsj/columns/. This edition of the column discusses the wide range of lower bounds on approximation guarantees for NP-hard optimization problems both in their functional forms and in the hypotheses on which they depend.
Solving stochastic mathematical programs with complementarity constraints using simulation
Authors: Ş. Ilker Birbil, Gül Gürkan, Ovidiu Listeş
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Recently, simulation-based methods have been successfully used for solving challenging stochastic optimization problems and equilibrium models. Here we report some of the recent progress we had in broadening the applicability of so-called the sample-path method to include the solution of certain stochastic mathematical programs with equilibrium constraints. We first describe the method and the class of stochastic mathematical programs with complementarity constraints that we are interested in solving and then outline a set of sufficient conditions for its almost-sure convergence. We also illustrate an application of the method to solving a toll pricing problem in transportation networks. These developments also make it possible to solve certain stochastic bilevel optimization problems and Stackelberg games, involving expectations or steady-state functions, using simulation.
Integrating XML and CORBA to support collaborative writing using off-the-shelf editing software
Authors: Kei Shiu Ho, Hong Va Leong, Wai Lam, Robert Wing Pong Luk
Venue: Information Systems (2006)

In this paper, collaborative writing is modeled as a workflow application comprising a number of activities. Each activity is assigned to a co-author to edit certain part(s) of the shared document. The order of editing is governed by a workflow schedule, which can be modified during execution. To enable concurrent editing, a data definition scheme is proposed whereby documents are transformed into the XML format for internal storage. Effectively, a hierarchical structure is superimposed on each document, allowing it to be broken down into a number of independent parts. These parts may then be separately edited in parallel. Unlike other approaches, the system supports the use of off-the-shelf editor software. Users can thus adapt to the system easily and existing documents can also be re-used rapidly. A prototype has been built which supports collaborative editing of Microsoft WordTM documents.
Plagiarism Detection in arXiv
Authors: Daria Sorokina, Johannes Gehrke, Simeon Warner, Paul Ginsparg
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

We describe a large-scale application of methods for finding plagiarism in research document collections. The methods are applied to a collection of 284,834 documents collected by arXiv.org over a 14 year period, covering a few different research disciplines. The methodology effi- ciently detects a variety of problematic author behaviors, and heuristics are developed to reduce the number of false positives. The methods are also efficient enough to imple- ment as a real-time submission screen for a collection many times larger.
Exploiting temporal uncertainty in process-oriented distributed simulations
Authors: Margaret L. Loper, Richard M. Fujimoto
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Existing research has defined a new type of simulation time called Approximate Time, where the simulation's knowledge about the values that represent time is uncertain. The approach is based on temporal uncertainty and uses time intervals rather than precise time values to represent time. Simulation language constructs are necessary to provide a convenient means of exploiting the temporal uncertainty to simulation modelers. To address this problem, a new time advance primitive for process-oriented simulations was developed, termed the Interval Hold construct. Interval Hold is an extension of the well-known hold primitive used in conventional simulation languages. This paper defines the interval time advance primitive and describes an algorithm for implementing it.
Common and Contrasting Areas of Activation for Abstract and Concrete Concepts: An H215O PET Study
Authors: Christine Whatmough, Louis Verret, Dion Fung, Howard Chertkow
Venue: Journal of Cognitive Neuroscience (2004)

Lesion studies indicate that the lateral and inferior temporal cortex is a critical area of semantic memory storage, but little is known about the cortical organization of semantics within this area. One proposition has been that dominant physical characteristics of objects (structure, motility) are determining factors. A positron emission tomography experiment using the H215O bolus method was performed to test this hypothesis by contrasting activation for concrete and abstract concepts. Unlike previous studies that considered this question, the task required explicit word meaning judgments, and blocks of trials were designed to be of equal difficulty for the two word classes. The task required elderly participants to read aloud the pair of words that was closer in meaning (e.g., spade&ndash;shovel vs. spade&ndash;carpet). Subtraction analyses that compared the semantic judgment tasks with a baseline condition indicated that both abstract and concrete concepts activated the left lateral temporal cortex. A direct comparison of abstract versus concrete scans indicated differences in the lateralization of fusiform activation. We conclude that although concreteness might be a critical factor in the fusiform cortex, it is not dominant in the lateral temporal cortex. A multistudy overview suggests that tasks that focus on one concept per trial activate areas posterior to y = &ndash;40, whereas those that invoke several concepts, as in the present study, activate areas anterior to this. Increased processing complexity may proceed in a posterior&ndash;anterior direction in the lateral temporal cortex.