ppxscal/embedding_network huggingface dataset:
MRI-Based Patient-Specific Computational Modeling of Right Ventricular Response to Pulmonary Valve Insertion Surgery: A Passive Anisotropic FSI Model with Fiber Orientation
Authors: Chun Yang, Dalin Tang, Tal Geva, Pedro J. del Nido
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Right ventricular (RV) dysfunction is a common cause of heart failure in patients with congenital heart defects and often leads to impaired functional capacity and premature death. The current surgical approach, which includes pulmonary valve replacement/insertion (PVR), has yielded mixed results. MRI-based patient-specific RV/LV/Patch combination models which included fluid-structure interactions (FSI), anisotropic material properties and two-layer construction with fiber orientations were introduced to test the hypothesis that a PVR surgical design with a smaller patch and more aggressive scar tissue trimming would lead to improved RV cardiac function recovery. Results from our models validated by pre-operation data indicated that the small patch design had 10% improvement in RV function as measured by RV ejection fraction, compared to the conventional patch. Maximum Stress-P1 value from the anisotropic model was 149.6% higher than that from the isotropic model. Computational RV volume predictions agreed well with CMR-measured volume data (error
Classification of Dynamic Load Balancing Strategies in a Network of Workstations
Authors: Sandeep Singh Waraich
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper deals with the problem of load balancing in a network of workstations. Based on the study of recent work in the area, we propose a general classification of load balancing techniques. The load balancing strategies are classified on three parameters addressing initiation (sender or receiver), load balancer location (centralized or distributed) and decision–making (local or global). This gives a thorough overview of different load balancing strategies, helping designers to compare and choose the most suitable strategy for a given application.
Group chromatic number of planar graphs of girth at least 4
Authors: Hong-Jian Lai, Xiangwen Li
Venue: Journal of Graph Theory (2006)

Jeager et al. introduced a concept of group connectivity as a generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected graph is Z3-connected. For planar graphs, this is equivalent to that every planar graph with girth at least 5 must have group chromatic number at most 3. In this article, we show that if G is a plane graph with girth at least 4 such that all 4 cycles are independent, every 4-cycle is a facial cycle and the distance between every pair of a 4-cycle and a 5-cycle is at least 1, then the group chromatic number of G is at most 3. As a special case, we show that the conjecture above holds for planar graphs. We also prove that if G is a connected K3,3-minor free graph with girth at least 5, then the group chromatic number is at most 3. &copy; 2006 Wiley Periodicals, Inc. J Graph Theory 52: 51&ndash;72, 2006
Evaluating the cost reduction of static code analysis for software security
Authors: Dejan Baca, Bengt Carlsson, Lars Lundberg
Venue: Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security (2008)

Automated static code analysis is an efficient technique to increase the quality of software during early development. This paper presents a case study in which mature software with known vulnerabilities is subjected to a static analysis tool. The value of the tool is estimated based on reported failures from customers. An average of 17% cost savings would have been possible if the static analysis tool was used. The tool also had a 30% success rate in detecting known vulnerabilities and at the same time found 59 new vulnerabilities in the three examined products.
Ambulatory Urodynamics Monitoring System Using Personal Digital Assistance
Authors: K. S. Kim, Y. S. An, J. H. Seo, C. G. Song
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

The conventional urodynamics monitoring study is performed by filling artificially the bladder with saline. However, it is difficult to evaluate the physiological functions of the storage and voiding of the bladder. In this study, we constructed an ambulatory urodynamics monitoring system and proposed a novel method for estimating abdominal pressure by bio-impedance changes and EMG activity. The system was evaluated in 10 patients. As the intensity of the abdomen contraction increased, the amplitude of bio-impedance signal and the RMS value of EMG increased as compared to those observed during resting. The correlation coefficient was 0.72 for the “weak” contraction, 0.96 for “strong” contraction, 0.90 for “stronger” contraction, 0.84 for “vigorous” contraction and 0.78 for “maximal” contraction. Also, daily events such as coughing, sneezing and talking, were sensitively monitored by observing the amplitude change of the bio-impedance signals. However, the EMG signals could not be used to detect these events, therefore, bio-impedance method is a more useful tool to measure the changes in the abdominal pressure non-invasively for urodynamic monitoring.
An Analytical Model and Performance Evaluation of Transport Protocols for Wireless Ad Hoc Networks
Authors: Sirisha Medidi, Jin Ding, Ghayathri Garudapuram, Jiong Wang, Muralidhar Medidi
Venue: Proceedings of the 41st Annual Simulation Symposium (anss-41 2008) (2008)

Performance of Transport Control Protocol (TCP), designed for wired networks, degrades significantly over wireless links and provides abysmal throughput because TCP assumes that all packet losses are caused by congestion. However, in wireless ad-hoc networks, packet losses could be due to several reasons such as link loss, node mobility, and faulty nodes, to name a few. Current techniques for improving TCP do not consider packet drops by faulty nodes. We propose a novel idea of distinguishing between wireless and congestion lossesby using the concept of Kleinrock’s “power” metric. Based on this idea we propose two reliable transport protocols, TCP Monet and TCP-Sec, that classify packet losses based on current connection status and react accordingly. TCP-Monet distinguishes between congestion and wireless losses, while TCP-Sec distinguishes amongst losses due to congestion, wireless errors, and packet drops by faulty nodes. We develop an analytic model of throughput in the presence of wireless losses, congestion losses, and packet drops by faulty nodes. We conducted simulation experiments using the ns-2 simulator and our experiments demonstrate that this model is able to more accurately predict throughput when there are wireless losses and faulty nodes.
A pixel-based semi-empirical system for predicting vegetation diversity in boreal forest
Authors: Anthony J. Warren, Michael J. Collins
Venue: International Journal of Remote Sensing (2007)

We have designed a system that predicts species richness in the mixed wood boreal forest of Canada. The system is based on a simple multivariate linear model that uses four landscape characteristics as independent variables: canopy species type, distance from the nearest ridgeline, time since the last fire and canopy stem density. The model is shown to provide statistically significant estimates of richness when using observed independent variables. We developed models for estimating the four landscape characteristics from geospatial data consisting of remotely sensed imagery and a digital elevation model. We ran the model at the stand scale and the pixel scale and found that stand scale predictions were be more accurate that pixel scale predictions. We produced a map of vegetation species richness for Prince Alberta National Park in central Saskatchewan Canada that is consistent with our expectations. We also estimated the uncertainty in the four landscape characteristic estimates and developed a methodology for propagating this uncertainty through the system to produce estimates of uncertainty in the pixel-based richness predictions. While the uncertainty is significant, the estimation and management of uncertainty in a mapping system of this type represents an innovation.
A framework for linking advanced simulation models with interactive cognitive maps
Authors: Frank van Kouwen, Paul P. Schot, Martin J. Wassen
Venue: Environmental Modelling Software (2008)

There is a dichotomy between advanced simulation models and flexible, simple tools for supporting policy-making. The former is difficult to use for policy-makers and the latter lacks in analytical value. It is a step forward to link these two types of tools in a way that enables the analytical value of the advanced models, while retaining the flexibility and comprehensibility of the simple tools. This paper presents a framework for such a linkage. The framework is based on an interactive cognitive mapping tool, which uses the qualitative probabilistic network (QPN) formalism to make qualitative (sign-based) calculations. This paper shows that there are several differences that need to be bridged. Each of these is discussed and approaches are presented. It is shown that (1) QPNs can be linked consistently to models with deterministic functions and continuous variables; (2) it is possible to deal with spatially and temporally explicit information; (3) despite the fact that QPNs must be a-cyclic, it is possible to capture feedback loops in a QPN-based tool. To prevent that negative feedback loops automatically result in ambiguous influences, we used a heuristic approach. The framework has been illustrated by analysing two models from literature with the QPN-based method.
Wisdom from Randy Pausch
Authors: Leah Hoffmann
Venue: Communications of the ACM (2008)

Randy Pausch, author of the best-selling The Last Lecture and a virtual-world innovator, on computer science, Alice, and teaching.
Digital audio and internet radio broadcasting systems under a QoS perspective
Authors: N. Manouselis, P. Karampiperis, I. O. Vardiambasis, A. Maras, G. Liodakis
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

Examination of the Quality of Service (QoS) at the end-user level of multimedia broadcasting systems is necessary in order to retain the overall performance and the user's satisfaction level from the provided services, by revealing the possible weaknesses of the systems' specifications. Accordingly we examine Digital Audio Broadcasting (DAB) system's characteristics at the services level, with a view to propose some extensions to the DAB system and to examine QoS specifications for Internet radio broadcasting.
GREMLINS: a large sparse linear solver for grid environment
Authors: Raphaël Couturier, Christophe Denis, Fabienne Jézéquel
Venue: Parallel Computing (2008)

Traditional large sparse linear solvers are not suited in a grid computing environment as they require a large amount of synchronization and communication penalizing the performance on this architecture. This paper presents some features of the solver designed during the current GREMLINS (GRid Efficient Method for LINear Systems) project. The GREMLINS solver limits the amount of communication as it is based on a coarse grained iterative method called multisplitting method. Moreover, the solver can be executed either in a synchronous or an asynchronous mode. In the latter case, iterations are desynchronized and there is no more synchronization at all. It may result in a faster execution time compared to the synchronous case. Some experiments presented in this paper with the GRID'5000 architecture, a nation wide experimental grid in France, allowed us to highlight interesting features of this solver.
KDE 4 preview
Authors: Jes Hall
Venue: Linux Journal (2008)

A peek at the revolutionary new version of KDE.
Accurate and analytical statistical spatial correlation modeling for VLSI DFM applications
Authors: Jui-Hsiang Liu, Ming-Feng Tsai, Lumdo Chen, Charlie Chung-Ping Chen
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

With the significant advancement of statistical timing and yield analysis algorithms, there is a strong need for accurate and analytical spatial correlation models. In this paper, we propose a novel spatial correlation modeling method not only can capture the general spatial correlation relationship but also can generate highly accurate and analytical models. Our method, based on Singular Value Decomposition (SVD), can generate sequences of polynomial weighted by the singular values. Experimental results from foundry measurement data show that our proposed approach is 5X accuracy improvement over several distance based spatial correlation modeling methods.
Identification of dry and wet soil conditions using TRMM/TMI brightness temperatures and potential for drought monitoring
Authors: A. Gupta, P. K. Thapliyal, P. K. Pal
Venue: International Journal of Remote Sensing (2007)

In this study we present a methodology for monitoring drought conditions directly from microwave brightness temperature observations. Tropical Rainfall Measurement Mission (TRMM)/TRMM Microwave Imager (TMI) 10.7 GHz brightness temperatures were analysed along with TRMM merged rainfall products during June-August for 4 years to depict the spatial and temporal extent of dry and wet soil conditions. Comparison of brightness temperature anomalies with rainfall anomalies clearly shows the contrasting features of drought year 2002 and normal monsoon year 2001.
A Note on Algebraic Hypercube Colorings
Authors: Irene Finocchi, Emanuele Guido Fusco, Rossella Petreschi
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

An L(1, 1)-coloring of the n-dimensional hypercube Qn assigns nodes of Qn which are at distance ≤ 2 with different colors. Such colorings find application, e.g., in frequency assignment in wireless networks and data distribution in parallel memory systems. Let χ2(Qn) be the minimum number of colors used in any L(1, 1)-coloring. Finding the exact value of χ2(Qn) is still an open problem, and only 2-approximate solutions are currently known.In this paper we expose some connections between group theory and the L(1, 1)-coloring problem. Namely, we unfold the algebraic structure on which the best available L(1, 1)-coloring algorithms of Qn are based, thus giving a group theoretic flavour to existing L(1, 1)-colorings. We show that identifying groups such that the inverse of each element is the element itself yields a simple and efficient way to obtain L(1, 1)-colorings of the hypercube. We also prove that such colorings are balanced and that every coloring algorithm based on this algebraic structure cannot improve the current upper bound on χ2(Qn), independently of the choice of the group operation.
Java bytecode verification via static single assignment form
Authors: Andreas Gal, Christian W. Probst, Michael Franz
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2008)

Java Virtual Machines (JVMs) traditionally perform bytecode verification by way of an iterative dataflow analysis. Bytecode verification is necessary to ensure type safety because temporary variables in the JVM are not statically typed. We present an alternative verification mechanism that transforms JVM bytecode into Static Single Assignment Form (SSA) and thereby propagates definitions directly to uses. Type checking at control flow merge points can then be performed in a single pass. Our prototype implementation of the new algorithm is faster than the standard JVM bytecode verifier. It has the additional benefit of generating SSA as a side effect, which may be immediately useful for a subsequent dynamic compilation stage.
Automated troubleshooting of a UMTS-WLAN test platform
Authors: Ronan Skehill, Sean McGrath, Carlos Antonio de Ramos
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

Amongst troubleshooting tasks, correct diagnosis of faults is a complex and time consuming task. Bayesian Networks provide a modelling approach suitable to cater for the uncertainty inherent in human reasoning. The method presented in this paper, valid towards any system, is applied to a UMTS/WLAN test platform which replicates a real world cellular networks. The results conclusively show Bayesian Networks automatically diagnoses faults in the test platform with a high success rate.
Efficient inference of partial types
Authors: D. Kozen
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

Partial types for the lambda -calculus were introduced by Thatte (1988) as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persistent data. He showed that type inference for partial types was semidecidable. Decidability remained open until O'Keefe and Wand gave an exponential time algorithm for type inference. The authors give an O(n/sup 3/) algorithm. The algorithm constructs a certain finite automaton that represents a canonical solution to a given set of type constraints. Moreover, the construction works equally well for recursive types.
Orness and parameterized RIM quantifier aggregation with OWA operators: A summary
Authors: Xinwang Liu, Shilian Han
Venue: International Journal of Approximate Reasoning (2008)

A necessary and sufficient condition for the ordered weighted average (OWA) aggregation value of an arbitrary aggregated set to consistently increase with the orness level is proposed. The OWA operator properties associated with the orness level are extended. Then, with the generating function representation of Regular Increasing Monotone (RIM) quantifier, all these conditions and properties are extended to the case of RIM quantifiers, which can be seen as the continuous OWA operator with free dimension. Some families of consistency RIM quantifiers and their corresponding OWA operators are summarized. Some existing linguistic term RIM quantifiers are collected and two parameterized generalization forms of them are proposed, which can be useful for the selection and comparison of the linguistic quantifier in theory and applications.
Efficient Distributed Sensor Dispatch in Mobile Sensor Network
Authors: Nguyen Hoang Viet, Ngo Anh Vien, SeungGwan Lee, TaeChoong Chung
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In this paper, a hybrid sensor network consisting of static and mobile sensors is considered, where static sensors are used to detect events, and mobiles sensors can move to event locations to conduct more advanced analysis. This dispatching problem can be converted to maximum weighted maximum matching problem with the objective of minimizing the total energy consumption to move sensor or maximizing the average remaining energy of sensor after movement. We present a distributed algorithm for sensor dispatch using message passing rule. Simulation results show that the algorithm can solve sensor dispatch problem in optimal distributed way.
Web Page Dependent Vision Based Segementation for Web Sites
Authors: Pyungkwan Ko, Sanggil Kang, Harshit Kumar
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

We introduce a web page segmentation system through mobile device. By providing segmented web pages service, the problem of the limitation of resource of mobile devices can be solved. In this paper, we propose a method that conflates DOM Based and vision based segmentation technique which improved an existing vison based web page segmentation.
An initial study of the growth of eclipse defects
Authors: Hongyu Zhang
Venue: Proceedings of the 2008 international working conference on Mining software repositories (2008)

We analyze the Eclipse defect data from June 2004 to November 2007, and find that the growth of the number of defects can be well modeled by polynomial functions. Furthermore, we can predict the number of future Eclipse defects based on the nature of defect growth.
On fans in multigraphs
Authors: David Cariolaro
Venue: Journal of Graph Theory (2006)

We introduce a unifying framework for studying edge-coloring problems on multigraphs. This is defined in terms of a rooted directed multigraph $\cal F$, which is naturally associated to the set of fans based at a given vertex u in a multigraph G. We call $\cal F$ the &ldquo;Fan Digraph.&rdquo; We show that fans in G based at u are in one-to-one correspondence with directed trails in $\cal F$ starting at the root of $\cal F$. We state and prove a central theorem about the fan digraph, which embodies many edge-coloring results and expresses them at a higher level of abstraction. Using this result, we derive short proofs of classical theorems. We conclude with a new, generalized version of Vizing's Adjacency Lemma for multigraphs, which is stronger than all those known to the author. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory 51: 301&ndash;318, 2006 written in memory of Prof. C. St. J. A. Nash-Williams.
Utility maximization in peer-to-peer systems
Authors: Minghua Chen, Miroslav Ponec, Sudipta Sengupta, Jin Li, Philip A. Chou
Venue: Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2008)

In this paper, we study the problem of utility maximization in P2P systems, in which aggregate application-specific utilities are maximized by running distributed algorithms on P2P nodes, which are constrained by their uplink capacities. This may be understood as extending Kelly's seminal framework from single-path unicast over general topology to multi-path multicast over P2P topology, with network coding allowed. For certain classes of popular P2P topologies, we show that routing along a linear number of trees per source can achieve the largest rate region that can be possibly obtained by (multi-source) network coding. This simplification result allows us to develop a new multi-tree routing formulation for the problem. Despite of the negative results in literature on applying Primal-dual algorithms to maximize utility under multi-path settings, we have been able to develop a Primal-dual distributed algorithm to maximize the aggregate utility under the multi-path routing environments. Utilizing our proposed sufficient condition, we show global exponential convergence of the Primal-dual algorithm to the optimal solution under different P2P communication scenarios we study. The algorithm can be implemented by utilizing only end-to-end delay measurements between P2P nodes; hence, it can be readily deployed on today's Internet. To support this claim, we have implemented the Primal-dual algorithm for use in a peer-assisted multi-party conferencing system and evaluated its performance through actual experiments on a LAN testbed and the Internet.