ppxscal/embedding_network huggingface dataset:
Two-Tone Pseudo Coloring: Compact Visualization for One-Dimensional Data
Authors: Takafumi Saito, Hiroko Nakamura Miyamura, Mitsuyoshi Yamamoto, Hiroki Saito, Yuka Hoshiya, Takumi Kaseda
Venue: Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization (2005)

A new pseudo coloring technique for large-scale one-dimensional datasets is proposed. For visualization of a large-scale dataset, user interaction is indispensable for selecting focus areas in the dataset. However, excessive switching of the visualized image makes it dif- ficult for the user to recognize overview/detail and detail/detail relationships. The goal of this research is to develop techniques for visualizing details as precisely as possible in overview display. In this paper, visualization of a one-dimensional but very large dataset is considered. The proposed method is based on pseudo coloring, however, each scalar value corresponds to two discrete colors. By painting with two colors at each value, users can read out the value precisely. This method has many advantages: it requires little image space for visualization; both the overview and details of the dataset are visible in one image without distortion; and implementation is very simple. Several application examples, such as meteorological observation data and train convenience evaluation data, show the effectiveness of the method.
Formal derivation of optimal active shielding for low-power on-chip buses
Authors: M. Ghonemia, Y. Ismail
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

Passive shielding has been used to reduce capacitive coupling effects of adjacent bus lines by inserting passive ground or power lines (shields) between the bus lines. Active shielding is another shielding technique, in which the shield is allowed to switch depending on the switching pattern of its adjacent bus lines. This work formally derives the optimal active shielding logic function for minimum power dissipation. It is also shown that this optimal active shielding architecture depends on the ratio of coupling to ground capacitance (/spl gamma/ = C/sub c//C/sub g/). Optimal active shielding is shown to provide up to 25% reduction in bus power dissipation compared to conventional passive shielding. A sub-optimal active shielding architecture with simpler hardware is also proposed. Simulation results show that using the sub-optimal shielding architecture leads to less than 6% bus power penalty compared to the optimal active shielding logic circuit.
A new formalism for dynamic reconfiguration of data servers in a cluster
Authors: María S. Pérez, Alberto Sánchez, José M. Peòa, Víctor Robles
Venue: Journal of Parallel and Distributed Computing (2005)

The use of parallel file systems constitutes a high-performance solution to the problem known as I/O crisis in parallel or distributed environments. In the last years, clusters have become one of the most cheap and flexible frameworks for the deployment of parallel and distributed applications. Both parallel file systems and clusters have been successfully used in several scenarios, where it is possible to share and access data in an efficient way. In fact, clusters provide a huge number of advantages to this kind of systems, the wide availability of tools integrated with them being one of the most important. Nevertheless, clusters and, in general, high-availability distributed systems are characterized to be dynamically modified. Operations such as the addition or elimination of nodes are typical in a cluster environment. Therefore, it is necessary to use new approaches for the dynamic reconfiguration of the nodes that belong to a cluster. This paper describes a mathematical formalism for achieving high-performance and dynamic reconfiguration of data-based clusters with service maintenance.
Identifying Genes with The Concept of Customization
Authors: Dong Hua, Dechang Chen, Abdou Youssef
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

Gene selection with microarray data is an important task towards the study of genomics. The goal is to identify the optimal subset of genes such that maximum discrimination power across samples (e.g., tumor types) while minimum redundancy among genes are achieved. Essentially, it is NPcomplete. Approximation algorithms are usually solicited including individual ranking and sequential forward selection. Typically, from source input microarray data to output selected genes, multiple steps including preprocessing, discretization, discrimination modeling, redundancy modeling, optimization formularization, classification, and evaluation are involved in the presence of a number of options (techniques) for each of them. Putting them together, we form the concept of customization for gene selection in this paper, that is, configure the entire scenario such that various maybe trivial techniques can team work with superior performance rather than focus on certain technique within a single step (e.g., discrimination power modeling). One configuration following the principle of simplicity is constructed in this paper which identi?es genes effectively shown by experiments.
Detecting groups of co-changing files in CVS repositories
Authors: Giuliano Antoniol, Vincenzo Fabio Rollo, Gabriele Venturi
Venue: Proceedings of the Eighth International Workshop on Principles of Software Evolution (2005)

Software systems continuously evolve. CVS record almost all of the changes the system parts undergo. Hence, CVS repositories contain a great deal of information about software artifact evolution. Software artifacts of a system can evolve following similar evolution patterns as well as very different ones. A peculiar kind of similarity in evolution is the one among two or more artifacts having changed almost at the same times for a certain number of changes. We name these co-changing artifacts. Co-changing artifacts are relevant because cochanges can be inducted by not trivial dependencies among system parts. In this paper, we propose a definition of co-changes suitable of practical application. We assess the challenges arising in detection of groups of co-changing software parts, and we present a robust approach, based on Dynamic Time Warping, to detect groups of co-changing files in CVS repositories. We also report and discuss the results of a preliminary application of the approach to the Mozilla CVS repository.
Allocating Non-Real-Time and Soft Real-Time Jobs in Multiclusters
Authors: Ligang He, Stephen A. Jarvis, Daniel P. Spooner Hong Jiang, Donna N. Dillenberger
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

This paper addresses workload allocation techniques for two types of sequential jobs that might be found in multicluster systems, namely, non-real-time jobs and soft real-time jobs. Two workload allocation strategies, the Optimized mean Response Time (ORT) and the Optimized mean Miss Rate (OMR), are developed by establishing and numerically solving two optimization equation sets. The ORT strategy achieves an optimized mean response time for non-real-time jobs, while the OMR strategy obtains an optimized mean miss rate for soft real-time jobs over multiple clusters. Both strategies take into account average system behaviors (such as the mean arrival rate of jobs) in calculating the workload proportions for individual clusters and the workload allocation is updated dynamically when the change in the mean arrival rate reaches a certain threshold. The effectiveness of both strategies is demonstrated through theoretical analysis. These strategies are also evaluated through extensive experimental studies and the results show that when compared with traditional strategies, the proposed workload allocation schemes significantly improve the performance of job scheduling in multiclusters, both in terms of the mean response time (for non-real-time jobs) and the mean miss rate (for soft real-time jobs).
Towards lightweight checks for mass maintenance transformations
Authors: Niels Veerman
Venue: Science of Computer Programming (2005)

We propose a lightweight, practical approach to check mass maintenance transformations. We present checks for both transformation tools and transformed source code, and illustrate them using examples of real-world transformations. Our approach is not a fully fledged, formal one but provides circumstantial evidence for transformation correctness, and has been applied to the mass maintenance of industrial Cobol systems.
A Two-Level Approach for Ontology Management in Multi-Agent Systems
Authors: Michele Tomaiuolo, Paola Turci, Federico Bergenti, Agostino Poggi
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

The work presented in this paper is an attempt to bridge two co-existing realties: Semantic Web and Multi-Agent Systems. Agents should be enhanced with tools and mechanisms in order to autonomously achieve this strategic and ambitious objective. In this paper we focus on what we consider the central issue when moving towards the vision of semantic multiagent systems: the ontology support. Due to the heterogeneity of resources available and roles played by different agents of a system, a one-level approach with the aim of being omni-comprehensive seems not to be feasible. In our opinion, a good compromise is represented by a two-level approach: a light ontology support embedded in each agent and one or more ontology servers providing a more expressive and powerful ontology support to the agents of the systems.
Three Faces of Human-Computer Interaction
Authors: Jonathan Grudin
Venue: IEEE Annals of the History of Computing (2005)

Human-computer interaction is considered a core element of computer science. Yet it has not coalesced; many researchers who identify their focus as human-computer interaction reside in other fields. The author examines the origins and evolution of three HCI research foci: computer operation, information systems management, and discretionary use. Efforts to find common ground and forces that have kept them apart are described.
Designing better user interfaces for radiology interpretation
Authors: Adrian Moise
Venue:  (2003)

Since the 1980s, radiologists have started to interpret digital radiographs using modern computer systems, a process known as softcopy reading. For softcopy reading, Hanging Protocols are used to automatically arrange images for interpretation upon opening a case, thus minimizing the need for physicians to manipulate images. We have developed a strategy, called HP++, which extends current hanging protocols with support for &lsquo;scenario-based&rsquo; interpretation, matching the radiologist's workflow and ensuring a chronological presentation of information. We hypothesized that HP++ significantly reduces off-image eye fixations, the interpretation time, and the frequency and complexity of user input. We validated our hypothesis with inexpensive usability studies based on an abstraction of the radiologist's task, transferred to novice subjects. For a radiology look-alike task, we compared the performance of 20 graduate students using our HP++ based interaction technique with their performance using a conventional interaction technique. We observed a 15% reduction in the average interpretation time using the staged approach, with one third fewer interpretation errors, two thirds fewer mouse clicks, and over 65% less eye gaze over the workstation controls. User satisfaction with the staged interface was significantly higher than with the traditional interface. Preliminary external validation of these results with physician subjects indicate our usability results transfer to radiology softcopy reading. We conclude that designing radiology workstations with support for HP++ can improve the performance of workstation users.
A Framework for Dynamically Converting Components to Web Services
Authors: Roger Lee, Ashok Harikumar, Chia-Chu Chiang, Hae-Sool Yang, Haeng-Kon Kim, Byeongdo Kang
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

Components are the basic building blocks of enterprise and distributed applications. Componentbased development (CBD) is the technique of using a Component Framework to develop Components and it focuses on developing large software systems by integrating previously existing software components. Software Development based on component based architecture is already in wide use throughout the software industry. Component based development makes it possible to assemble an application from a repository of components developed in various languages by homogeneous or heterogeneous composition. Web Services provides an easy way to extend component based development by adopting open internet standards. Web services represent an evolution of the Web to allow the open and flexible interaction of applications over the Internet. Web services standards provide a high level of interoperability across platforms, programming languages and applications. In our current research we have created a model for automatically converting components created in different languages to web services. The components that are developed in various languages are deployed dynamically (just in time) in the web servers by using custom built deployers. Using this model the users can access the components that reside in the server using open internet standards, without having to worry about the language and platform restrictions. The security aspects to access the web services were also considered while implementing the model.
Using Solid Diagrams for Tangible Interface Prototyping
Authors: Alan F. Blackwell, Darren Edge, Lorisa Dubuc, Jennifer A. Rode, Mark Stringer, Eleanor Toye
Venue: IEEE Pervasive Computing (2005)

The authors describe an approach to early concept development for tangible user interfaces that uses a solid diagram-a 3D "sketch" created using simple construction materials. It is intended for use in the earliest stages of research and product concept development as an alternative to paper-and-pencil brainstorming sessions. This department is part of a special issue on rapid prototyping.
Handwriting Matching and Its Application to Handwriting Synthesis
Authors: Yefeng Zheng, David Doermann
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Since it is extremely expensive to collect a large volume of handwriting samples, synthesized data are often used to enlarge the training set. We argue that, in order to generate good handwriting samples, a synthesis algorithm should learn the shape deformation characteristics of handwriting from real samples. In this paper, we present a point matching algorithm to learn the deformation, and apply it to handwriting synthesis. Preliminary experiments show the advantages of our approach.
PORT: A Price-Oriented Reliable Transport Protocol for Wireless Sensor Networks
Authors: Yangfan Zhou, Michael R. Lyu
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

In wireless sensor networks, to obtain reliability and minimize energy consumption, a dynamic rate-control and congestion-avoidance transport scheme is very important. We notice that reporting packets may contribute to the sink's fidelity of its knowledge on the phenomenon of interest to different extents. Thus, reliability cannot simply be measured by the sink's total incoming packet rate as considered in current schemes. Also, communication costs between sources and the sink may be different and may change dynamically. Based on these considerations, we propose PORT (Price-Oriented Reliable Transport protocol) to facilitate the sink to achieve reliability. Under the constraint that the sink must obtain enough fidelity for reliability purpose, PORT minimizes energy consumption with two schemes. One is based on the sink's application-based optimization approach that feeds back the optimal reporting rates. The other is a locally optimal routing scheme according to the feedback of downstream communication conditions. PORT can adapt well to the communication conditions for energy saving while maintaining the necessary level of reliability. Simulation results in an application case study demonstrate the effectiveness of PORT.
A Distributed Problem Solving Environment (PSE) for Scientific Computing
Authors: Shigeo Kawata, Hideaki Fuju, Hideaki Sugiura, Yuichi Saitoh, Yoshikazu Hayase, Takayuki Teramoto, Takashi Kikuchi
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

A distributed Problem Solving Environment (PSE) is proposed to help users solve partial differential equation (PDE) based problems in scientific computing. The system inputs a problem description and outputs a program flow, a C-language source code for the problem and also a document for the program. Each module is distributed on distributed computers. The PSE contains all the information of the problem, PDEs, discretization scheme, mesh information, equation manipulation results, designed program structure, variable and constant definitions and program itself. Therefore the documentation support module generates a document for the generated program and the problem itself in the PSE. The module liaison module generates an adapter module among the distributed PSE modules. The job execution service module deploys programs generated or prepared on distributed computer resources and helps users run the programs on the distributed computers. The concept of the distributed PSE extends the potential of conventional PSE systems.
On Existence of Limit Occupational Measures Set of a Controlled Stochastic Differential Equation
Authors: Vivek Borkar, Vladimir Gaitsgory
Venue: SIAM Journal on Control and Optimization (2005)

We establish that, under certain conditions, the set of occupational measures as well as the set of mathematical expectations of occupational measures generated by the admissible controls and the corresponding solutions of a controlled stochastic differential equation (CSDE) converge (with the time horizon tending to infinity) to a set called limit occupational measures set (LOMS) and we show that this limit set coincides with the set of stationary marginal distributions of the CSDE. We also demonstrate the applicability of our results for averaging of singularly perturbed CSDE.
TCP Performance over Wireless MIMO Channels with ARQ and Packet Combining
Authors: Alberto Lopez Toledo, Xiaodong Wang
Venue: IEEE Transactions on Mobile Computing (2006)

Multiple-input multiple-output (MIMO) wireless communication systems that employ multiple transmit and receive antennas can provide very high-rate data transmissions without increase in bandwidth or transmit power. For this reason, MIMO technologies are considered as a key ingredient in the next generation wireless systems, where provision of reliable data services for TCP/IP applications such as wireless multimedia or Internet is of extreme importance. However, while the performance of TCP has been extensively studied over different wireless links, little attention has been paid to the impact of MIMO systems on TCP. This paper provides an investigation on the performance of modern TCP systems when used over wireless channels that employ MIMO technologies. In particular, we focus on two representative categories of MIMO systems, namely, the BLAST systems and the space-time block coding (STBC) systems, and how the ARQ and packet combining techniques impact on the overall TCP performance. We show that, from the TCP throughput standpoint, a more reliable channel may be preferred over a higher spectral efficient but less reliable channel, especially under low SNR conditions. We also study the effect of antenna correlation on the TCP throughput under various conditions.
Neo-tribes: the power and potential of online communities in health care
Authors: Grace J. Johnson, Paul J. Ambrose
Venue: Communications of the ACM (2006)

Online communities deserve better than their current treatment---where they are largely relegated to the fringes of health care.
Modelling of wireless TCP for short-lived flows: Research Articles
Authors: Sangheon Pack, Yanghee Choi
Venue: International Journal of Communication Systems (2005)

The transmission control protocol (TCP) is one of the most important Internet protocols. It provides reliable transport services between two end-hosts. Since TCP performance affects overall network performance, many studies have been done to model TCP performance in the steady state. However, recent researches have shown that most TCP flows are short-lived. Therefore, it is more meaningful to model TCP performance in relation to the initial stage of short-lived flows. In addition, the next-generation Internet will be an unified all-IP network that includes both wireless and wired networks integrated together. In short, modelling short-lived TCP flows in wireless networks constitutes an important axis of research. In this paper, we propose simple wireless TCP models for short-lived flows that extend the existing analytical model proposed in [IEEE Commun. Lett. 2002; 6(2):85&ndash;88]. In terms of wireless TCP, we categorized wireless TCP schemes into three types: end-to-end scheme, split connection scheme, and local retransmission scheme, which is similar to the classification proposed in [IEEE&#x002F;ACM Trans. Networking 1997; 756&ndash;769]. To validate the proposed models, we performed ns-2 simulations. The average differences between the session completion time calculated using the proposed model and the simulation result for three schemes are less than 9, 16, and 7 ms, respectively. Consequently, the proposed model provides a satisfactory means of modelling the TCP performance of short-lived wireless TCP flows. Copyright &copy; 2005 John Wiley & Sons, Ltd.A preliminary version of this paper has appeared in the Proceedings of the IEEE Vehicular Technology Conference (VTC) 2003-Spring, Jeju, Korea, April 2003.
Sequential Classification of Probabilistic Independent Feature Vectors by Mixture Models
Authors: Tomasz Walkowiak
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

The paper presents methods of sequential classification with predefined classes. The classification is based on a sequence, assumed to be probabilistic independent, of feature vectors extracted from signal generated by the object. Each feature vector is a base for calculation of a probability density function for each predefined class. The density functions are estimated by the Gaussian mixture model (GMM) and the t-Studentmixture model. The model parameters are estimated by algorithms based on the expectationmaximization (EM) method. The estimated densities calculated for a sequence of feature vectors are inputs to analyzed classification rules. These rules are derived from Bayes decision theory with some heuristic modifications. The performance of the proposed rules was tested in an automatic, text independent, speaker identification task. Achieved results are presented.