ppxscal/embedding_network huggingface dataset:
The spatial-perceptual design space: a new comprehension for data visualization
Authors: José Fernando Rodrigues,  Jr., Agma J. M. Traina, Maria Cristina F. de Oliveira, Caetano Traina,  Jr.
Venue: Information Visualization (2007)

We revisit the design space of visualizations aiming at identifying and relating its components. In this sense, we establish a model to examine the process through which visualizations become expressive for users. This model has lead us to a taxonomy oriented to the human visual perception. The essence of this taxonomy provides natural criteria in order to delineate a novel understanding for the design space of visualizations. From such understanding, we elaborate a model for generalized design. The model poses an intuitive comprehension for the visualization design space departing from fundamental pre-attentive stimuli and from perceptual phenomena. The paper is presented as a survey, its structure introduces an alternative conceptual organization for the space of techniques concerning visual analysis.
A simplex algorithm for minimum-cost network-flow problems in infinite networks
Authors: Thomas C. Sharkey, H. Edwin Romeijn
Venue: Networks (2008)

We study minimum-cost network-flow problems in networks with a countably infinite number of nodes and arcs and integral flow data. This problem class contains many nonstationary planning problems over time where no natural finite planning horizon exists. We use an intuitive natural dual problem and show that weak and strong duality hold. Using recent results regarding the structure of basic solutions to infinite-dimensional network-flow problems we extend the well-known finite-dimensional network simplex method to the infinite-dimensional case. In addition, we study a class of infinite network-flow problems whose flow balance constraints are inequalities and show that the simplex method can be implemented in such a way that each pivot takes only a finite amount of time. &copy; 2008 Wiley Periodicals, Inc. NETWORKS, 2008
Outline Detection for the HEp-2 Cell in Indirect Immunofluorescence Images Using Watershed Segmentation
Authors: Yu-Len Huang, Chia-Wei Chung, Tsu-Yi Hsieh, Yu-Lang Jao
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

An automatic inspection system for antinuclear autoantibodies (ANA) testing can be divided into HEp-2 cell detection, fluorescence pattern classification and computer aided diagnosis phases. This paper presented a multi-staged segmentation method for automatically detecting outlines of fluorescence cells in Indirect immunofluorescence (IIF) images. The similarity-based watershed algorithm performed the marker to prevent over-segmentation. This paper evaluated 2305 autoantibody fluorescence patterns with manual sketched outlines (including 456 diffuse patterns, 417 peripheral patterns, 719 coarse speckled patterns, 55 fine speckled patterns, 517 discrete speckled patterns and 141 nucleolar patterns) from 44 IIF images. The experimental results revealed that the proposed method can practically outline fluorescence cells from IIF images.
Routability-driven analytical placement by net overlapping removal for large-scale mixed-size designs
Authors: Zhe-Wei Jiang, Bor-Yiing Su, Yao-Wen Chang
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Routability is a challenging cost metric for modern large-scale mixed-size placement. Most existing routability-driven placement algorithms apply whitespace allocation to relieve the routing congestion. Nevertheless, we observe that whitespace allocation might worsen the routability of a placement. To remedy this deficiency, we propose in this paper a new direction/technique, called net overlapping removal, to optimize the routability during placement. Unlike most previous works that allocate whitespace among blocks, our approach moves nets apart from congested regions to improve the chip routability. To apply the net overlapping removal technique, we generalize a net bounding-box based congestion evaluation model to handle practical routing constraints and speed up the routability optimization during placement. We further propose a Gaussian smoothing technique to handle the challenging macro porosity issue, arising in modern mixed-size designs with large macros that require to preserve routing resources for inner routing of the macros. Experimental results show that our approaches lead to significantly better routability and running time than previous works for mixed-size placement.
Road Network Based Adaptive Query Evaluation in VANET
Authors: Jun Gao, Jinsong Han, Dongqing Yang, Tengjiao Wang
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

In the Vehicle Ad-hoc NETwork(VANET), moving vehicles organize into a mobile wireless Ad-hoc network to share online traffic information. Each vehicle can issue a declarative query for aggregating the traffic information from others in order to facilitate the navigation and avoid traffic jam. Existing query methods suffer from high latency, incomplete results, and large messages due to the movement of the vehicles in VANET. In this paper, we propose an adaptive query evaluation method based on the road network. In order to overcome the problems incurred by the movement, a relative static query evaluation plan is constructed based on the road network, and each vehicle can participate in the query evaluation plan autonomously. We also introduce control messages to notify the changed location of the query originator to other vehicles involved in the evaluation plan. In addition, we propose a one time message transferring based results collecting method to reduce the message cost. The optimization over the multiple queries is also discussed to reduce the messages further. We evaluate the performance of our method by extensive simulations. Experimental results show that our method can provide complete results within a short response time and small traffic overhead.
Automatic acoustic detection of the red palm weevil
Authors: J. Pinhas, V. Soroker, A. Hetzroni, A. Mizrach, M. Teicher, J. Goldberger
Venue: Computers and Electronics in Agriculture (2008)

The red palm weevil (RPW) is a key pest of horticultural and ornamental palm species in Asia, the Middle East and the Mediterranean region, currently dispersing in Mediterranean European countries, endangering the landscape. The RPW larvae bore deep into palm crowns, trunks and offshoots, concealed from visual inspection until the palms are nearly dead. Traded palm trees are intensively transported between and within countries, spreading the pest worldwide. Consequently, an urgent need exists to identify and monitor concealed RPW larvae. Acoustic signals of boring RPW larvae can be recorded from the infested palms using off-the-shelf recording devices, but the resolution of the signals emitted by healthy palms is often difficult to discriminate. The purpose of this research was to develop a mathematical method to automatically detect acoustic activity of RPW in offshoots and implement it in a prototype setup. The methodology applied was similar to techniques used in the field of speech recognition, utilizing Vector quantization (VQ) or Gaussian mixture modeling (GMM). The algorithm successfully achieved detection ratios as high as 98.9%. The study shows that it is feasible to detect RPW sounds using the mathematical method of speech recognition and commercial recording devices, which could be utilized to monitor trade and transportation of offshoots.
Repairing self-confident active-transductive learners using systematic exploration
Authors: Ron Begleiter, Ran El-Yaniv, Dmitry Pechyony
Venue: Pattern Recognition Letters (2008)

We consider an active learning game within a transductive learning model. A major problem with many active learning algorithms is that an unreliable current hypothesis can mislead the querying component to query ''uninformative'' points. In this work we propose a remedy to this problem. Our solution can be viewed as a ''patch'' for fixing this deficiency and also as a proposed modular approach for active-transductive learning that produces powerful new algorithms. Extensive experiments on ''real'' data demonstrate the advantage of our method.
Toward Increasing FPGA Lifetime
Authors: Suresh Srinivasan, Ramakrishnan Krishnan, Prasanth Mangalagiri, Yuan Xie, Vijaykrishnan Narayanan, Mary Jane Irwin, Karthik Sarpatwari
Venue: IEEE Transactions on Dependable and Secure Computing (2008)

Field Programmable Gate Arrays(FPGAs) have been aggressively moving to lower gate length technologies. Such a scaling of technology has an adverse impact on the reliability of the underlying circuits in such architectures. Various different physical phenomena have been recently explored and demonstrated to impact the reliability of circuits both in the form of transient error susceptibility and permanent failures. In this work, we analyze the impact of two different types of hard errors, namely, Time Dependent Dielectric Breakdown (TDDB) and Electro-migration (EM) on FPGAs. We also study the performance degradation of FPGAs over time caused by Hot Carrier Effects (HCE) and Negative Bias Temperature Instability (NBTI). Each such study is performed on the components of FPGAs most affected by the respective phenomena, both from performance and reliability perspective. Different solutions are demonstrated to counter each such failure and degradation phenomena to increase the operating lifetime of the FPGAs.
Computationally fast harmonic balance methods for unsteady aerodynamic predictions of helicopter rotors
Authors: Kivanc Ekici, Kenneth C. Hall, Earl H. Dowell
Venue: Journal of Computational Physics (2008)

A harmonic balance technique for the analysis of unsteady flows about helicopter rotors in forward flight and hover is presented in this paper. The aerodynamics of forward flight are highly nonlinear, with transonic flow on the advancing blade, subsonic flow on the retreating blade, and stalled flow over the inner portion of the rotor. Nevertheless, the unsteady flow is essentially periodic in time making it well suited for frequency domain analysis. The present method uses periodic boundary conditions that allows one to model the flow field on a computational grid around a single helicopter blade, no matter the actual blade count. Using this approach, we compute several solutions, each one corresponding to one of several instants in time over one period. These time levels are coupled to each other through a spectral time derivative operator in the interior of the computational domain and through the far-field and periodic boundary conditions around the boundary of the domain. In this paper, we apply the method to the three-dimensional Euler equations (although the method can also be applied to three-dimensional viscous flows), and examine the steady and unsteady aerodynamics about wings and rotors.
A Database Replication Protocol Where Multicast Writesets Are Always Committed
Authors: Jose Ramon Juarez-Rodriguez, J. E. Armendariz-Iñigo, J. R. Gonzalez de Mendivil, F. D. Muñoz-Escoi
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Database replication protocols based on a certification approach are usually the best ones for achieving good performance. The weak voting approach achieves a slightly longer transaction completion time, but with a lower abortion rate. So, both techniques can be considered as the best ones for replication when performance is a must, and both of them take advantage of the properties provided by atomic broadcast. We propose a new database replication strategy that shares many characteristics with such previous strategies. It is also based on totally ordering the application of writesets, using only an unordered reliable broadcast, instead of an atomic broadcast. Additionally, the writesets of transactions that are aborted in the final validation phase are not broadcast in our strategy. Thus, this new approach reduces the communication traffic and also achieves a good transaction response time (even shorter than those previous strategies in some system configurations).
A novel DTC scheme for a three-level voltage source inverter with GTO thyristors
Authors: R. Zaimeddine, E. M. Berkouk
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

The object of this paper is to study a new control structure for sensorless induction machine dedicated to electrical drives using a three-level voltage source inverter (VSI). Compared to classical Field Oriented Control (FOC), which necessitates generally three feedback loops with PI regulators, a current-regulated PWM converter, and two coordinate transformations, Direct Torque Control (DTC) uses only a couple of hysteresis comparators to perform both torque and flux dynamic control. The output voltages of the three-level VSI can be represented by four groups : the zero voltage vectors, the small voltage vectors, the middle voltage vectors and the large voltage vectors in (d, q) plane. Then, the amplitude and the rotating velocity of the flux vector can be controlled freely. Both fast torque and optimal switching logic can be obtained. The selection is based on the value of the stator flux and the torque. The results obtained with a novel DTC structure show superior performances over the FOC one without need to any mechanical sensor.
Low-cost Test of Timing Mismatch Among Time-Interleaved A/D Converters in High-speed Communication Systems
Authors: Qingqi Dou, Jacob A. Abraham
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

Time Interleaved A/D Converters (TIADCs)provide an attractive solution to the realization of analogfront ends in high speed communication systems. However,gain mismatch, offset mismatch, and sampling time mismatchbetween time-interleaved channels limit the performanceof TIADCs. This paper presents a low-cost test scheme tomeasure timing mismatch using an undersampling clock. Ourmethod is applicable to an arbitrary number of channels,achieving picosecond resolution with low power consumption.Both simulation and hardware measurements are presented tovalidate the proposed technique.
Time-space lower bounds for directed s-t connectivity on JAG models
Authors: G. Barnes
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

Directed s-t connectivity is the problem of detecting whether there is a path from a distinguished vertex s to a distinguished vertex t in a directed graph. We prove time-space lower bounds of ST=/spl Omega/(n/sup 2//log n) and S/sup 1/2/T /spl Omega/(mn/sup 1/2/) for Cook and Rackoff's JAG model (1980), where n is the number of vertices and m the number of edges in the input graph, and S is the space and T the time used by the JAG. We also prove a time-space lower bound of S/sup 1/3/T=/spl Omega/(m/sup 2/3/n(2/3)) on the more powerful node-named JAG model of Poon (1993). These bounds approach the known upper bound of T=O(m) when S=/spl Theta/(n log n).
Emerging Research Architectures
Authors: Ralph Cavin, James A. Hutchby, Victor Zhirnov, Joe E. Brewer, George Bourianoff
Venue: Computer (2008)

Morphic architectures embrace a broad class of mixed-signal systems that focus on a particular application and draw inspiration for their structure from the application. In some cases, processing is carried out in the analog domain, offering orders-of-magnitude improvement in performance and power dissipation, albeit with reduced accuracy.
Issues for IT Governance in a Large Not-for-Profit Organization: A Case Study
Authors: Carla L. Wilkin, Jon L. Riddett
Venue: Proceedings of the 2008 International MCETECH Conference on e-Technologies (2008)

This paper reports on the implementation of IT Governance in a not-for-profit healthcare organization. The motivation behind such an undertaking was partly the need to run the IT Division as a business aligned to the strategic goals of the organization, and partly to be able to demonstrate the professional accountability of the IT decision-making investment process. Certainly, top management’s support for the roll out of IT Governance was related to the latter motive. In this case study the organizational gains in focusing on best value for the investment dollar, accountable time-frames and cost-controls, were real. As such, the move enhanced the professional status of the IT Department. However, the organizational structure imposed by IT Governance provided such transparency that the IT Department additionally achieved more widespread participation and buy in from the wider business.
SHARE: supporting large-scale rescue operations with communication and information services over mobile networks
Authors: Jobst Löffler, Jochen Schon, Joachim Köhler
Venue: Proceedings of the 2nd international conference on Mobile multimedia communications (2006)

This paper presents the EU project SHARE which is developing a mobile service architecture to support large-scale rescue operations with multimedia communication and information services. The task of planning and controlling large-scale rescue operations requires flexible and robust tools which help the rescue forces to do their search and rescue work with maximum efficiency. Today the main channels of communication are analog radio and paper text forms. The SHARE system introduces an advanced multimedia communication and information system to the highly mobile working environment which supports well established command hierarchies of the rescue organizations. Different operation scenarios for mobile networks using WiMAX, WLAN or UMTS are discussed regarding their usability for large-scale rescue operations.
A fair Non-repudiation service in a web services peer-to-peer environment
Authors: Berthold Agreiter, Michael Hafner, Ruth Breu
Venue: Computer Standards Interfaces (2008)

''Non-repudiation'', a well known concept in security engineering, provides measures to ensure that participants in a communication process cannot deny having participated. This concept is of eminent importance in business cases based on service oriented architectures (e.g. electronic billing). However, there is no sophisticated standard implementing fair Non-repudiation in such an environment. In this paper, we will introduce a framework providing fair Non-repudiation for Web service messages. It implements an arbitrary, pre-defined protocol using Web services technology, but completely hides the protocol execution from the target Web services. To allow the integration of security requirements in an early stage of the development cycle, a model-driven configuration approach is used. Furthermore, the procedure is not tied to Non-repudiation protocols only, which means that a broad range of protocols can be integrated in a similar way. The framework presented in this paper leverages existing standards and protocols for an efficient adoption in service oriented architectures.
Mobile medical diagnosis: an m-health initiative through service continuity in B3G
Authors: Letian Rong, Thomas Wallet, Manel Fredj, Nikolaos Georgantas
Venue: Proceedings of the 2007 ACM/IFIP/USENIX international conference on Middleware companion (2007)

The B3G (Beyond 3G) concept enables mobile users to roam freely through heterogeneous networks on an all-IP platform [1]. Specifically, we view B3G networks as an infrastructure-less aggregation of heterogeneous infrastructure-based and ad hoc networks. As part of the PLASTIC project [2], we are developing a middleware for service continuity in infrastructure-less B3G networks so that the solution does not depend on the deployment of a central infrastructure in the core network. This demo demonstrates that the proposal can be utilized efficiently in an m-Health (i.e., mobile-Health) system, which allows mobile medical professionals to attend patients remotely in an ad hoc manner in B3G. In this paper, Section 2 first presents the demonstration scenario. Then Section 3 details the proposed middleware solution for providing service continuity in B3G environments. Finally, Section 4 outlines the steps involved in the demonstration.
A new hp method for the - grad(div) operator in non-Cartesian geometries
Authors: M. Azaïez, M. O. Deville, R. Gruber, E. H. Mund
Venue: Applied Numerical Mathematics (2008)

This paper describes a new hp method for the numerical solution of the two-dimensional -grad(div) eigenvalue problem in primal variational formulation. In standard methods with triangular or quadrangular finite elements, or with spectral elements, the spectrum contains spurious modes if the mesh is non-Cartesian. With the new hp method described in this paper we show that, although it delivers a P"p-P"p approximation on the same grid for both velocity components, the spectrum is represented without any spurious mode whether a Cartesian or a non-Cartesian quadrangular grid is chosen. Spectra computed with standard high-order methods and with the new element are presented and compared with the analytic solutions.
Intelligent Assistance in Authoring Dynamically Generated Web Interfaces
Authors: José A. Macías
Venue: World Wide Web (2008)

Since its emergence in the early 1990s, the WWW has become not only an information system of unprecedented size, but a universal platform for the development of services and applications. However, most of the advances in web technologies are intended for professional developers, paying poor attention to end-users with no programming abilities but with explicit needs of creating and customizing web-based presentations. This provides a strong motivation for end-users to act as designers at some point, leading to an emerging role of new computing-related professionals to be considered. This paper is an effort to leverage such difficulties by providing intelligent mechanism to assist end-users in web-based authoring tasks. To carry out such a challenge, intelligent user-monitoring techniques are exploited to obtain high-level information that will be used to infer the user's preferences and assist him throughout the interaction. Furthermore, we report on how iteration patterns can be applied to avoid repetitive tasks that are automatically carried out on behalf of the user. In order to bring off a feasible trade-off between expressivity and ease of use, a user experiment to obtain the user's perception and evaluate the hit-rate of our system is also presented.
Soundness Conditions for Message Encoding Abstractions in Formal Security Protocol Models
Authors: Alfredo Pironti, Riccardo Sisto
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

In formal methods, security protocols are usually modeled with a high level of abstraction. In particular, marshalling/unmarshalling operations on transmitted messages are generally abstracted away. However, in real applications, errors in this protocol component could be exploited to break protocol security. In order to solve this issue, this paper formally shows that, under some constraints checkable on sequential code, if an abstract protocol model is secure, then a refined model, which takes into account a wide class of possible implementations of the marshalling/unmarshalling operations, is implied to be secure too. The paper also indicates possible exploitations of this result.