ppxscal/embedding_network huggingface dataset:
GLOBULE of NON-STANDARD: an attempted clarification of globular identity politics in Japanese electronic &lsquo;sightseeing music&rsquo;
Authors: Terre Thaemlitz
Venue: Organised Sound (2003)

This article attempts to identify trends in non-academic Japanese electronic music related to the representation of identity issues including gender, sexuality, ethnicity and race. Simultaneously, it attempts to point out limitations in Western identity politics which complicate the identification and clarification of such themes. In particular, the Western desire to define cultural diversity through a multiplication of distinct identity constructs is contrasted with Japanese aversions to images of factionalism or political affiliation. It is postulated that the &lsquo;Globular&rsquo; identity politics found in Japanese electronic music suggest ways of thinking around Western ideological conundrums such as the tendency to use terms of &lsquo;equality&rsquo; (a notion of similarity) when negotiating for communal &lsquo;diversity&rsquo; (a notion of dissimilarity). This extends to current attempts at diversification among academic and commercial digital audio producers.
A Dynamic Information Retrieval System for the Web
Authors: Xiangzhu Gao, San Murugesan, Bruce Lo
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

In conventional information retrieval (IR), documentsin a collection are indexed before the retrieval process,and the document collection is generally static, organisedand homogeneous. But, information on the Web is vast,dynamic, unorganised and heterogeneous. Current searchengines and IR systems on the Web are based on theconventional indexing approach and have limitationsincluding the need for frequent update of the index. Wepropose a non-indexing approach for information retrievalon the Web and show that the IR system based on thisapproach performs better than popular search engines.
An efficient procedure to select a near-optimal subset of pattern classification features
Authors: Kwang Woon Lee
Venue:  (2003)

This dissertation proposes a feature subset selection method that combines several known techniques. Feature subset selection has been identified as one of the most important processes in various applications, especially in pattern classification problems. However, when too many attributes are involved, training a machine to classify patterns into their respective classes is difficult. Hence, selecting good feature subsets is important. Although numerous methods to select feature subsets have been proposed, no universal solution for this problem exists, and the Exhaustive Search method is not practical. Some heuristic techniques such as Sequential Forward Selection and Sequential Backward Elimination are feasible in terms of speed, but suffer from the effects of the local optima problem. The Exhaustive Search technique guarantees finding the optimal subset, but its computational time complexity is exponential. Hence, we propose to minimize the number of features by combining Sequential Forward Selection, Sequential Backward Elimination, and Branch and Bound techniques. This selection produces a subset that the Exhaustive Search technique can be applied to and produce results in a reasonable amount of time. By combining these techniques, the selected feature set is much better than those from heuristic selections, and the computation speed is much faster than the Exhaustive Search technique alone. The proposed combined feature subset selection technique is tested in an off-line signature verification task, using the University of California Irvine (UCI) Repository data sets, by comparing the proposed method with the Exhaustive Search method.
Critical graphs with connected complements
Authors: Matěj Stehlík
Venue: Journal of Combinatorial Theory Series B (2003)

We show that given any vertex x of a k-colour-critical graph G with a connected complement, the graph G - x can be (k - 1)-coloured so that every colour class contains at least 2 vertices. This extends the well-known theorem of Gallai, that a k-colour-critical graph with a connected complement has at least 2k - 1 vertices. Our proof does not use matching theory. It is considerably shorter, conceptually simpler and more general than Gallai's original proof.
Phrase-based vector space model in document retrieval
Authors: Wenlei Mao
Venue:  (2003)

With the advent of the Internet and the World Wide Web, information distribution has become more convenient than ever. However, such an unprecedented abundance of information makes the location of a specific piece of information ever more difficult. Since most of the current search targets are text documents, we study the effective retrieval of text documents in this research. Many document retrieval systems are based on the vector space model that represents a document as a vector of index terms. Concepts have been proposed to replace word stems as the index terms to improve the retrieval effectiveness. However, past research revealed that such system did not outperform the traditional stem-based systems. Incorporating conceptual similarity derived from knowledge sources should have the potential to improve retrieval effectiveness. Yet the incompleteness of the knowledge sources precludes significant improvement. To remedy this problem, we propose to represent documents using phrases. A phrase consists of a concept and several word stems. The similarity between two phrases is jointly determined by their conceptual similarity and their common word stems. The document similarity can in turn be derived from the phrase similarities. We demonstrate that the phrase-based vector space model is more effective in document retrieval than the traditional stem-based vector space model. Significant effectiveness improvements are observed in both the exhaustive search and a cluster-based retrieval. We also show that such significant increase in retrieval effectiveness can be achieved without sacrificing too much efficiency.
Information Sharing in a Supply Chain with Dynamic Consumer Demand Pattern
Authors: Li Yan, Tan Gek Woo
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

Previous research suggested that applying different information sharing strategy (ISS) to the supply chain under different demand pattern may improve the supply chain performance [14]. But the assumption was made in the scenario that only one kind of ISS was used throughout the entire supply chain when the end consumers' demand pattern does not change [14]. Inthis paper, we set out to explore what will happen if the end consumers' demand pattern changes and whether adjusting the ISS accordingly will improve the supply chain performance. Three different demand patterns and three different ISSs will be considered. Hypotheses are developed based on the analysis of the relationship among demand patterns, ISSs and supply chain performance. A simulation model of a two-tier supply chain based on the GPSS platform is built to explore different scenarios and to test the hypotheses. The simulation results show that adjusting ISS according to the changes of end consumers' demand pattern will benefit the supply chain performance. Implications for supply chain practitioners are drawn from the results.
The sensor spectrum: technology, trends, and requirements
Authors: Joseph M. Hellerstein, Wei Hong, Samuel R. Madden
Venue: ACM SIGMOD Record (2003)

Though physical sensing instruments have long been used in astronomy, biology, and civil engineering, the recent emergence of wireless sensor networks and RFID has spurred a renaissance in sensor interest in both academia and industry. In this paper, we examine the spectrum of sensing platforms, from billion dollar satellites to tiny RF tags, and discuss the technological differences between them. We show that battery powered sensor networks, with low-power multihop radios and low-cost processors, occupy a sweet spot in this spectrum that is rife with opportunity for novel database research. We briefly summarize some of our research work in this space and present a number of examples of interesting sensor network-related problems that the database community is uniquely equipped to address.
Collaborative Learning and Creative Writing
Authors: Luis A. Guerrero, Boris Mejías, César A. Collazos, José A. Pino, Sergio F. Ochoa
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

CSCL software tools must provide support for group work and should be based on a collaborative learning technique. The PBL based CCCuento tool is introduced here. It is intended to support apprentices groups in the collaborative creation of stories in order to improve language use and development of writing skills. The tool follows a model, which includes several positive interdependencies and is implemented as a sequence of individual activities followed by break periods. The break periods are used for reviewing and discussion. An experiment is reported in which several groups of high school students used the tool
Correlation of the use of computers by education faculty with national standards for preservice students
Authors: Robin T. Twery
Venue:  (2003)

The purpose of this research study was to provide information to faculty, administrators and state departments of education about the level of integration of computer technology into teacher education programs. The stated problem of this research was to determine the correlation of the use of computers by education faculty with national standards for preservice teachers. A review of the literature identified the continuing growth of computer use and a growing acceptance of national standards for computer literacy in K&ndash;12 and higher education settings. To determine the extent of computer use among education faculty, a three-part survey was developed. It including a Likert-type scale based on technology-use standards developed by the International Society for Technology in Education, questions regarding teaching experience and computer skills, and open-ended questions allowing for input on support for or obstacles to the integration of technology in the participating institutions. The study included only programs in Vermont which certified students to teach in K&ndash;12 settings. Surveys were sent to private and state institutions, with a total return rate of 46%. Once data gathering was completed, analysis was done using JMPin, a version of SAS. Data were analyzed using descriptive statistics, and significance was tested using Pearson's product-moment correlation for continuous data and chi-squares for ordinal data. Faculty were asked to what degree they modeled and/or required the specific standards for preservice teachers. Of those who responded, 83% reported modeling the standards to a low to moderate degree, while 90% reported requiring the standards at a low to moderate degree. Analysis of the correlation between teaching experience and the modeling and requiring of the standards showed little significance. There was a positive correlation to the faculty's rating of their own computer skills. The open-ended questions brought forth comments including appreciation of strong institutional support, and concerns about technology training and time to use the skills learned. The results indicated that there were faculty at all the colleges who were modeling and requiring technology skills, which are now being required for certification in Vermont and 42 other states.
Information requirement elicitation in mobile commerce
Authors: Jun Sun
Venue: Communications of the ACM (2003)

Using an interactive approach to facilitate information searching for mobile users.
A Prefetch Taxonomy
Authors: Viji Srinivasan, Edward S. Davidson, Gary S. Tyson
Venue: IEEE Transactions on Computers (2004)

Abstract--The growing difference between processor and main memory cycle time demands the use of aggressive prefetch algorithms to reduce the effective memory access latency. However, prefetching can significantly increase memory traffic and unsuccessful prefetches may pollute the cache. Metrics such as coverage and accuracy result from a simplistic classification of individual prefetches as ¿good¿ or ¿bad.¿ They do not capture the full effect of each prefetch and, hence, do not accurately reflect the quality of the prefetch algorithm. Gross statistics such as changes in the number of misses, total traffic, and IPC are not attributable to individual prefetches. Such gross metrics are therefore useful only for ranking existing prefetch algorithms; they do not evaluate the effect of individual prefetches so that an algorithm might be tuned. In this paper, we introduce a new, accurate, and complete taxonomy, called the Prefetch Traffic and Miss Taxonomy (PTMT), for classifying each prefetch by precisely accounting for the difference in traffic and misses it generates, either directly or indirectly. We illustrate the use of PTMT by evaluating two data prefetch algorithms.
Is child internet access a questionable risk?
Authors: Charles Adetokunbo Shoniregun, Andrew Anderson
Venue: Ubiquity (2003)

The unlimited and pervasive use of the Internet by young people raises many concerns about child safety. What solutions are available and why aren't they being used?
Asymptotic Properties of Monotonic Nonexpansive Mappings
Authors: Sylvain Sorin
Venue: Discrete Event Dynamic Systems (2004)

Let T be a nonexpansive monotonic mapping from C to itself where C is a closed subset of a space of bounded real functions, with the supremum norm. We study asymptotic properties of several average iterates of T, related to the cycle time.
Tight Upper Bounds on the Minimum Precision Required of the Divisor and the Partial Remainder in High-Radix Division
Authors: Behrooz Parhami
Venue: IEEE Transactions on Computers (2003)

Digit-recurrence binary dividers are sped up via two complementary methods: keeping the partial remainder in redundant form and selecting the quotient digits in a radix higher than 2. Use of a redundant partial remainder replaces the standard addition in each cycle by a carry-free addition, thus making the cycles shorter. Deriving the quotient in high radix reduces the number of cycles (by a factor of about h for radix 2^h). To make the redundant partial remainder scheme work, quotient digits must be chosen from a redundant set, such as [-2, 2] in radix 4. The redundancy provides some tolerance to imprecision so that the quotient digits can be selected based on examining truncated versions of the partial remainder and divisor. No closed form formula for the required precision in the partial remainder and divisor, as a function of the quotient digit set and the range of the partial remainder, is known. In this paper, we establish tight upper bounds on the required precision for the partial remainder and divisor. The bounds are tight in the sense that each is only one bit over a well-known simple lower bound. We also discuss the implications of these bounds for the quotient digit selection process.
Nonlinear Confidence Estimates for Statistically Uncertain Systems
Authors: G. A. Timofeeva
Venue: Automation and Remote Control (2003)

Confidence sets are constructed for the phase state of a multistep nonlinear system, the description of whose dynamics contains both random perturbations with given distributions and uncertain perturbations with information defined by their value domains. The design of optimal confidence sets is reduced to optimization of a quantile function. Its solution is based on the information sets of a perturbed deterministic system. For linear multistep systems with Gaussian perturbations, the optimal confidence sets are determined by nonlinear estimation methods unlike in the case of complete statistical information. An example is given to illustrate that nonlinear estimation methods are far better in certain cases than the linear estimation methods.
Bitmap indexing method for complex similarity queries with relevance feedback
Authors: Guang-Ho Cha
Venue: Proceedings of the 1st ACM international workshop on Multimedia databases (2003)

The similarity indexing and searching is well known to be a difficult one for high-dimensional applications such as multimedia databases. Especially, it becomes more difficult when multiple features have to be indexed together. Moreover, few indexing methods are currently available to effectively support disjunctive queries for relevance feedback.In this paper, we propose a novel indexing method that is designed to efficiently handle complex similarity queries as well as relevance feedback in high-dimensional image and video databases. In order to provide the indexing method with the flexibility in control multiple features and multiple query objects, our method treats every dimension independently. The efficiency of our method is realized by a specialized bitmap indexing that represents all objects in a database as a set of bitmaps. The percentage of data accessed in our indexing method is inversely proportional to the overall dimensionality, and thus the performance deterioration with the increasing dimensionality does not occur.Our main contributions are three-fold: (1) We provide a novel way to index high-dimensional data; (2) Our method efficiently handles complex similarity queries; and (3) Disjunctive queries driven by relevance feedback are efficiently treated. Our empirical results demonstrate that our indexing method achieves speedups of 10 to 15 over the linear scan.
Search Control Techniques for Planning
Authors: Minh Tang, Amol Dattatraya Mali
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Signi.cant advances have been made in heuristic search for classical planning in the last six years. Most of these planners use A* style search. We report on two sound and complete domain-independent classical planners AWA* (Adjusted Weighted A*) and MAWA* (Modified AWA*) in this paper. AWA* is the .rst planner to use node-dependent weighting in A*. MAWA* uses a two-phase heuristic evaluation. MAWA* applies node-dependent weighting to a subsetof the nodes in the fringe, after the two-phase evaluation. We report on an empirical comparison of AWA*, MAWA* with classical planners AltAlt, FF and STAN 4. Both AWA* and MAWA* outperform AltAlt and STAN 4. Both AWA* and MAWA* solve many problems that FF does not. The ideas in AWA* and MAWA* are general enough to be applicable in solving other planning problems like temporal planning and planning with resources and numerical variables.
Computer simulation of ion-solid interaction processes
Authors: A. A. Dzhurakhalov
Venue: Microelectronic Engineering (2003)

The results of computer simulation on the investigations and applications of the ion scattering, sputtering and implantation processes on the crystal surfaces under low-energy (1-15 keV) grazing ion bombardment have been presented. The peculiarities of the mentioned processes have been investigated by computer simulation. It has been shown that the elastic energy losses of the scattered particles are considerably smaller than the inelastic ones in a region of glancing scattering. In the case of grazing ion bombardment the layer-by-layer sputtering is possible and its optimum are observed within the small angle range of the glancing angles near the threshold sputtering angle. At grazing ion incidence, from a correlation of the experimental and calculated energy distributions of the scattered particles, one may determine a spatial extension of the isolated atomic steps on the single crystal surface. The behaviour of the scattering loops gives the possibility to determine the lying-down adsorption sites of diatomic molecules in lateral plane relative to target atom.
From diffusion processes to adherence properties in NiTi microactuators
Authors: I. Jarrige, P. Holliger, T. P. Nguyen, J. Ip, P. Jonnard
Venue: Microelectronic Engineering (2003)

Diffusion processes taking place at the NiTi/Si, NiTi/SiO2 and NiTi/Si3N4 interfaces under annealing are studied in order to understand the adherence properties of these systems after annealing. Secondary ion mass spectrometry (SIMS), X-ray photoelectron spectroscopy (XPS) assisted by argon etching and electron-induced X-ray emission spectroscopy (EXES) are combined in order to analyse at a nanometric scale the interfaces before and after annealing. Considerable differences between diffusion processes in NiTi/Si and NiTi/SiO2 are observed and can explain the difference between adherence properties of these systems after annealing. Among the three studied systems, NiTi/Si3N4 is shown to be the most suited for low voltage microactuation applications.
Enriching Scanner Panel Models with Choice Experiments
Authors: Joffre Swait, Rick L. Andrews
Venue: Marketing Science (2003)

This research examines the methods, viability, and benefits of pooling scanner panel choice data with compatible preference data from designed choice experiments. The fact that different choice data sources have diverse strengths and weaknesses suggests it might be possible to pool multiple sources to achieve improved models, due to offsetting advantages and disadvantages. For example, new attributes and attribute levels not included in the scanner panel data can be introduced via the choice experiment, while the scanner panel data captures preference dynamics, which is, at best, difficult with experimental data. Our application, involving liquid laundry detergent, establishes the feasibility and desirability of doing such augmentations of scanner panel data: The joint scanner panel/choice experiment model has significantly better prediction performance on a holdout data set than does a pure scanner panel model. Thus, we extend the concept of choicedata enrichment into another domain and demonstrate that data enrichment can add significantly to one's understanding of preferences reflected in scanner panel data.
A Fuzzy Controller for Adaptive Filtering Applications
Authors: Juan López Hernández, J. Alejandro Díaz Méndez, J. Luis Vázquez González
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

The characteristic of the electronic systems can bealtered by the means that surrounds them, inconsequence the performance can be degraded. It isfor this reason that adaptive systems are required,able to modify their characteristics and to conserve agood performance. In this work a Fuzzy Controller isdesigned for Adaptive Filtering applications, wherethe controller is the intelligent part of the system andable to adapt the filter characteristics.
Z-transformation graphs of maximum matchings of plane bipartite graphs
Authors: Heping Zhang, Rijun Zha, Haiyuan Yao
Venue: Discrete Applied Mathematics (2004)

Let G be a plane bipartite graph. The Z-transformation graph Z(G) and its orientation Z(G) on the maximum matchings of G are defined. If G has a perfect matching, Z(G) and Z(G) are the usual Z-transformation graph and digraph. If G has neither isolated vertices nor perfect matching, then Z(G) is not connected. This paper mainly shows that some basic results for Z-transformation graph (digraph) of a plane elementary bipartite graph still hold for every nontrivial component of Z(G) (Z(G)). In particular, by obtaining a result that every shortest path of Z(G) from a source of Z(G) corresponds to a directed path of Z(G), we show that every nontrivial component of Z(G) has exactly one source and one sink. Accordingly, it follows that the block graph of every nontrivial component of Z(G) is a path. In addition, we give a simple characterization for a maximum matching of G being a cut-vertex of Z(G).