ppxscal/embedding_network huggingface dataset:
Capturing best practice for microarray gene expression data analysis
Authors: Gregory Piatetsky-Shapiro, Tom Khabaza, Sridhar Ramaswamy
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Analyzing gene expression data from microarray devices has many important application in medicine and biology, but presents significant challenges to data mining. Microarray data typically has many attributes (genes) and few examples (samples), making the process of correctly analyzing such data difficult to formulate and prone to common mistakes. For this reason it is unusually important to capture and record good practices for this form of data mining. This paper presents a process for analyzing microarray data, including pre-processing, gene selection, randomization testing, classification and clustering; this process is captured with "Clementine Application Templates". The paper describes the process in detail and includes three case studies, showing how the process is applied to 2-class classification, multi-class classification and clustering analyses for publicly available microarray datasets.
Learning XSLT
Authors: Michael Fitzgerald
Venue:  (2003)

Learning XSLT moves smoothly from the simple to complex, illustrating all aspects of XSLT 1.0 through step-by-step examples that you'll practice as you work through the book. Thorough in its coverage of the language, the book makes few assumptions about what you may already know. You'll learn about XSLT's template-based syntax, how XSLT templates work with each other, and gain an understanding of XSLT variables. Learning XSLT also explains how the XML Path Language (XPath) is used by XSLT and provides a glimpse of what the future holds for XSLT 2.0 and XPath 2.0.
Enterprise J2ME: Developing Mobile Java Applications
Authors: Michael Juntao Yuan
Venue:  (2003)

Industrial-strength J2ME™ for enterprise developers, architects, and decision-makersJ2ME offers an extraordinarily flexible and robust platform for developing mobile applications with enterprise-class performance, reliability, and value. Now, leading mobile developer Michael Yuan covers every aspect of building industrial-strength applications with J2ME: design, architecture, tools, processes, business issues, and more.Yuan introduces innovations that make the platform even more powerful, ranging from new J2ME profiles and wireless messaging APIs to mobile databases and web services tools. These innovations allow existing Java™ developers (especially J2EE™ developers) to leverage their skills and add mobility to enterprise applications. Yuan also presents more than a dozen complete sample applications-including the application that earned him the grand prize in Nextel, Sun, and Motorola's nationwide wireless developer contest. Coverage includes: Patterns and best practices for building end-to-end mobile applications Emerging mobile “killer applications”: driving productivity and cost reduction “Smart client” applications: architecture and construction Advanced HTTP techniques for authentication and session tracking Overcoming hardware and network limitations Leading-edge mobile enterprise messaging techniques Mobile databases and synchronization engines XML and mobile web services, including the J2ME Web Services Optional Package New options for mobile security in the enterprise
Semantic annotation of soccer videos: automatic highlights identification
Authors: Jürgen Assfalg, Marco Bertini, Carlo Colombo, Alberto Del Bimbo, Walter Nunziati
Venue: Computer Vision and Image Understanding (2003)

Automatic semantic annotation of video streams allows both to extract significant clips for production logging and to index video streams for posterity logging. Automatic annotation for production logging is particularly demanding, as it is applied to non-edited video streams and must rely only on visual information. Moreover, annotation must be computed in quasi real-time. In this paper, we present a system that performs automatic annotation of the principal highlights in soccer video, suited for both production and posterity logging. The knowledge of the soccer domain is encoded into a set of finite state machines, each of which models a specific highlight. Highlight detection exploits visual cues that are estimated from the video stream, and particularly, ball motion, the currently framed playfield zone, players' positions and colors of players' uniforms. The highlight models are checked against the current observations, using a model checking algorithm. The system has been developed within the EU ASSAVID project.
Magnetic properties of regular arrays of non-spherical ferromagnetic nanogranules
Authors: E. Z. Meilikhov, R. M. Farzetdinova
Venue: Microelectronic Engineering (2003)

Magnetic properties (ground state, magnetic phase diagram, phase transitions in a magnetic field) of two- and three-dimensional lattices of ferromagnetic granules with dipole intergranule interaction are studied. The basic attention is given to lattices of non-spherical granules (prolate and oblate ellipsoids of revolution) and their limiting shapes--rodlike and disk-like granules. The analysis shows that conclusions of the theory agree with results of a series of experiments.
Addressing the lack of direct translation resources for cross-language retrieval
Authors: Lisa Ballesteros, Mark Sanderson
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Most cross language information retrieval research concentrates on language pairs for which direct, rich, and often multiple translation resources already exist. However, for most language pairs, translation via an intermediate language is necessary. Two distinct methods for dealing with the additional ambiguity introduced by the extra translation step have been proposed and individually, shown to improve retrieval effectiveness. Two previous works indicated that in combination, the methods were ineffective. This paper provides strong empirical evidence that the methods can be combined to produce consistent and often significant improvements in retrieval effectiveness. The improvement is shown across a number of different intermediate languages and test collections.
An Analysis of a Shared Services Centre in E-Government
Authors: Marijn Janssen, René Wagenaar
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

Information systems engineering projects in e-government are confronted with high costs, lack of expertise and developing similar functionality over and over. A shared services centre might provide common services to local government organizations without affecting the autonomy of organizations and providing the flexibility to enhance and include additional functionality. As such a SSC promises tremendous economies of scale and scope. A promise is however not sufficient, research yields ambiguous results. A sound analysis of motives to use a shared services center and management issues determining success and failure is necessary.The goal of the research presented in this paper is to explore the concept of a shared services center by investigating the motives and management issues determining its successful implementation. We explore the concept by investigating a SSC at the Dutch judicial organization.
CASCH: a scheduling algorithm for "high level"-synthesis
Authors: P. Gutberlet, H. Krämer, W. Rosenstiel
Venue: Proceedings of the conference on European design automation (1991)

It is the goal of the recently developed and herewith presented scheduling algorithm to optimize the timing behaviour within automated circuit synthesis. The algorithm is a part of the CADDY-Synthesis-System (CAddy SCHeduling). Basis is a list scheduling algorithm which is controlled by a heuristic rating function. The allocated resources can be modelled in a flexible and detailed manner in order to specify component types for several different operations as well as different component types for the same operation. It is a special feature of this scheduling algorithm that the assignment of operations to component types is decided during the scheduling.
VSV: L2-Miss-Driven Variable Supply-Voltage Scaling for Low Power
Authors: Hai Li, Chen-Yong Cher, T. N. Vijaykumar, Kaushik Roy
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

Energy-efficient processor design is becoming moreand more important with technology scaling and with highperformance requirements. Supply-voltage scaling is anefficient way to reduce energy by lowering the operatingvoltage and the clock frequency of processorsimultaneously. We propose a variable supply-voltagescaling (VSV) technique based on the following keyobservation: upon an L2 miss, the pipeline performs someindependent computations but almost always ends upstalling and waiting for data, despite out-of-order issueand other latency-hiding techniques. Therefore, during anL2 miss we scale down the supply voltage of certainsections of the processor in order to reduce powerdissipation while it carries on the independentcomputations at a lower speed. However, operating at alower speed may degrade performance, if there aresufficient independent computations to overlap with the L2miss. Similarly, returning to high speed may degradepower savings, if there are multiple outstanding missesand insufficient independent computations to overlap withthem. To avoid these problems, we introduce two statemachines that track parallelism on-the-fly, and we scalethe supply voltage depending on the level of parallelism.We also consider circuit-level complexity concerns whichlimit VSV to two supply voltages, stability and signal-propagationspeed issues which limit how fast VSV maytransition between the voltages, and energy overheadfactors which disallow supply-voltage scaling of largeRAM structures such as caches and register file. Oursimulations show that VSV achieves an average of 20.7%total processor power reduction with 2.0% performancedegradation in an 8-way, out-of-order-issue processor thatimplements deterministic clock gating and softwareprefetching, for those SPEC2K benchmarks that have highL2 miss rates. Averaging across all the benchmarks, VSVreduces total processor power by 7.0% with 0.9%performance degradation.
Automated Testing of Security Functions Using a Combined Model and Interface-Driven Approach
Authors: Ramaswamy Chandramouli, Mark Blackburn
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Independent Security Functional Testing (Testing of security functions of a product or system for conformance to published behavior) is often given a low priority in traditional security evaluations, due to combination of cost and technical considerations, except in the case ofhigh assurance products. However we argue that the overall security of an Enterprise IT environment depends upon the weakest link and these weakest links are often commercial off the shelf software products involved in number crunching, data storage, transaction processing etc. In this paper we present an approach for improving the economics of security functional testing for many classes of commercial products by automating the process of test code generation through the use of formal models and interface information. The underlying framework is called TAF (Test Automation Framework) and the toolkit we have developed based on TAF is the TAF-SFT toolkit. The TAF approach uses the text-based specifications ofsecurity functions provided by the product vendor to develop a machine-readable specification of security functions using the SCR (Software Cost Reduction) formal language. The resultant behavioral specification model is then processed through the TAF-SFT Toolkit to generate test vectors. The behavioral model and the test vectors are then combined with product interface specifications to automatically generate test drivers (test execution code). The test code is executed against the product to be tested. The actual test results are compared with expected test results and a test report is generated. We illustrate the application of TAF-SFT toolkit for security functional testing of a commercial DBMS product.
On Twisted Odd Graphs
Authors: M. A. Fiol, E. Garriga, J. L. A. Yebra
Venue: Combinatorics, Probability and Computing (2000)

The twisted odd graphs are obtained from the well-known odd graphs through an involutive automorphism. As expected, the twisted odd graphs share some of the interesting properties of the odd graphs but, in general, they seem to have a more involved structure. Here we study some of their basic properties, such as their automorphism group, diameter, and spectrum. They turn out to be examples of the so-called boundary graphs, which are graphs satisfying an extremal property that arises from a bound for the diameter of a graph in terms of its distinct eigenvalues.
Attention deficit disorder
Authors: Luke Skrebowski
Venue: interactions (2004)

Media companies are losing our attention and their profits. What can they do to regain both?
Distributed Garbage Collection by Timeouts and Backward Inquiry
Authors: Sung-Wook Ryu, Eul Gyu Im, B. Clifford Neuman
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

We present a practical and efficient garbage collectionmechanism for large scale distributed systems. Themechanism collects all garbage including distributed cyclicgarbage without global synchronization or backward links.The primary method used for local and remote garbagecollection is timeouts: each object has a time-to-live, andclients which have a link to an object must refresh the targetobject within the time-to-live to guarantee that the linkwill remain valid. For cyclic garbage collection: objectssuspected to be garbage are detected by last referenceabletimestamp propagation; and cyclic garbage is reclaimedby backward inquiry (back-tracing). Since, without additionaloverhead, the information about backward referencescan be obtained during the refreshing process, and sincemessages necessary for cyclic garbage collection are bundledwith the messages used for the refreshing, communication,computation and storage overhead is minimized. Thismechanism has been implemented and evaluated on Prosperodirectory service, and the performance results showthat it works well for large scale distributed systems.
Strategic models for the delivery of personal financial services: the role of infocracy
Authors: Steven Gordon, Paul Mulligan
Venue: Computing information technology: the human side (2003)

The growth of the Internet and the rapidly evolving regulatory climate in the United States and abroad have radically altered the environment of the financial service industry. This chapter focuses on integrated personal financial services (IPFS) -- the integration of services such as banking, insurance, and investing for the end consumer -- in this new, networked economy. It identifies three different business models for the delivery of IPFS. It explores the concept of an infocracy, a form of organization in which information provides the underpinning of structure and the basis of individual power, and addresses its implications for the management and success of the alternative IPFS business models.
Genuine sets, various kinds of fuzzy sets and fuzzy rough sets
Authors: Mustafa Demirci
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2003)

In this paper, deriving the type-m fuzzy sets, intuitionistic fuzzy sets, φ-fuzzy sets, rough sets, fuzzy rough sets and rough fuzzy sets as particular genuine sets, and establishing their connections with genuine sets, it is demonstrated that the theory of genuine sets provides a powerful tool to model various different kinds of uncertainty in a mathematical way. Furthermore, it is also shown that the genuine set theoretic descriptions of type-m fuzzy sets, intuitionistic fuzzy sets and fuzzy rough sets point out new features of these set notations, originated from the peculiar characteristics of genuine sets.
Green's function Monte Carlo algorithms for elliptic problems
Authors: I. T. Dimov, R. Y. Papancheva
Venue: Mathematics and Computers in Simulation (2003)

In many large-scale problems, one is interested to obtain directly an approximate value of a functional of the solution. Here, we consider a special class of grid-free Monte Carlo algorithms for direct computing of linear functionals of the solution of an elliptic boundary-value problem. Such kind of problems appear in environmental sciences, computational physics and financial mathematics. To create the algorithms, we use the Green's function analysis and define the conditions under which the integral transformation kernel of the integral representation for the boundary-value problem under consideration is non-negative. This analysis is done for a possible set of densities, and it is used to generate three different grid-free Monte Carlo algorithms based on different choices of the density of the radius of the balls used in Monte Carlo simulation. Only one of the generated algorithms was known before. We shall call it Sipin's algorithm. It was proposed and studied by Sipin. The aim of this work is to study the two new algorithms proposed here and based on two other (than in Sipin's algorithm) possible choices of the densities. The algorithms are described and analyzed. The performed numerical tests show that the efficiency of one of the new algorithms, which is based on a constant density is higher than the efficiency of Sipin's algorithm.
Increasing performances and personalization in the interaction with a call center system
Authors: Federica Cena, Ilaria Torre
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

This paper describes the innovative combination of speech recognition and personalized response generation with the adaptive routing of calls to the operator which best fits the caller's features. The project aims at supporting the user incrementally, starting from a personalized automatic support and moving to a proficient human one, when it is needed. In particular the paper shows the adaptive workflow of the answering process and focuses on the principles for providing the personalized speech response.
Dynamic configuration management for MANETs: an overview
Authors: John Paul O'Grady, Susan Rea, Sinead Cummins, Dirk Pesch, Rajiv Mathur
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

With the proliferation of wireless portable ubiquitous computer networking the area of mobile ad hoc networks (MANETs) is a focus of intense research. This paper discusses some of the issues (IP address assignment, routing, service provision) involved in effectively managing an ad hoc network.
Automatic high-quality reengineering of database programs by abstraction, transformation and reimplementation
Authors: Yossi Cohen, Yishai A. Feldman
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2003)

Old-generation database models, such as the indexed-sequential, hierarchical, or network models, provide record-level access to their data, with all application logic residing in the hosting program. In contrast, relational databases can perform complex operations, such as filter, aggregation, and join, on multiple records without an external specification of the record-access logic. Programs written for relational databases attempt to move as much of the application logic as possible into the database, in order to make the most of the optimizations performed internally by the database.This conceptual gap between the programming styles makes automatic high-quality translation of programs written for the older database models to the relational model difficult. It is not enough to convert just the database-access operations, since this would result in unacceptably inefficient programs. It is necessary to convert parts of the application logic from the procedural style of the hosting program (which is almost always Cobol) to the declarative style of SQL.This article describes an automatic system, called MIDAS, that performs high-quality reengineering of legacy database programs in this way. MIDAS is based on the paradigm of translation by abstraction, transformation, and reimplementation. The abstract representation is based on the Plan Calculus, with the addition of Query Graphs, introduced in this article in order to abstract the temporal behavior of database access patterns.The results of MIDAS's translation were found to be superior to those of the naive translation that only converts database-access operations in terms of readability, size of code, speed, and network data traffic. Initial industrial experience with MIDAS also demonstrates the high quality of its translations on large-scale programs.
Peer-to-Peer Suitability for Collaborative Multiplayer Games
Authors: Abdulmotaleb El Saddik, Andre Dufour
Venue: Proceedings of the Seventh IEEE International Symposium on Distributed Simulation and Real-Time Applications (2003)

Peer-to-peer communication is emerging as one of the most potentially disruptive technologies in the networking sector. If the interest in such technologies as Napster, Morpheus and Gnutella is any indication, peer-to-peer networks will be a major component in the future of computer communications and the Internet. In this work, we conducted a case study byimplementing the Xiangqi game using a P2P networking technology. In so doing, we gained a deeper understanding of P2P communication in general and a more in-depth knowledge of the specific technology used. We encountered a number of issues while implementing our multimedia application using the JXTA P2P framework, but we were nevertheless able to create a working prototype that functioned satisfactorily. We thus concluded that P2P was a feasible alternative to the current server-based multi-player gaming paradigm.
Structural analysis of communities of practice: an investigation of job title, location, and management intention
Authors: Joan T. Alatta
Venue: Communities and Technologies (2003)

The community of practice phenomenon has been extensively studied in qualitative terms, but there has been relatively little research using quantitative techniques. This study uses the common social network measures of connectedness, density, graph theoretic distance, and core / periphery fit to examine how groups defined by different characteristics align with community of practice theory. Specifically, it investigates the roles of job title, location, and management intention relative to the structural characteristics of communities of practice. Workers were assigned to groups based upon their job title, job group, division, location, and emergent behavior (results of hierarchical clustering). Initial results suggest that grouping employees by their emergent behavior yields network measures that are most closely related to community of practice theory.
Reality brings excitement to engineering education
Authors: Larry Leifer, Sheri Sheppard
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

The intellectual content and social activity of engineering product development are a constant source of surprise, excitement, and challenge for engineers. When our students experience product-based-learning (PBL), they experience this excitement (Brereton et al., 1995). They also have fun and perform beyond the limits required for simple grades. We, their teachers, experience these things too. Why, then, are so few students and faculty getting the PBL message? How, then, can we put the excitement back in engineering education? In part, we think this is because of three persistent mistakes in engineering education:1. We focus on individual students.2. We focus on engineering analysis versus communication between engineers.3. We fail to integrate thinking skills in engineering science and engineering practice.