ppxscal/embedding_network huggingface dataset:
A comparative study of mobile map displays in a geographic orientation task
Authors: Claudius Pfendler, Christopher Schlick
Venue: Behaviour & Information Technology (2007)

In an ergonomic experiment, different mobile map displays were compared in a simulated geographical orientation task. Subjects had to cross mazes while the corresponding maps were presented on a hand-held display, two helmet-mounted displays (a retinal scanning and a liquid crystal display) or on paper. The simulated mazes were projected on a backlit screen and the subjects could cross them using a joystick. The displays were compared with regard to subjects' speed when crossing the mazes, experienced task difficulty, visual fatigue and simulator sickness. The results show that speed was lowest with the paper map and experienced task difficulty was highest, whereas no significant differences were found between the electronic displays. Visual fatigue and simulator sickness were low and no significant differences were observed between all displays. The conclusion is drawn that all electronic map displays can be used for short time periods (15 - 30 minutes); however, long term effects have to be analysed in future experimental studies.
The domination and competition graphs of a tournament
Authors: David C. Fisher, J. Richard Lundgren, Sarah K. Merz, K. B. Reid
Venue: Journal of Graph Theory (1998)

Vertices x and y dominate a tournament T if for all vertices z &ne; x, y, either x beats z or y beats z. Let dom(T) be the graph on the vertices of T with edges between pairs of vertices that dominate T. We show that dom(T) is either an odd cycle with possible pendant vertices or a forest of caterpillars. While this is not a characterization, it does lead to considerable information about dom(T). Since dom(T) is the complement of the competition graph of the tournament formed by reversing the arcs of T, complementary results are obtained for the competition graph of a tournament. &copy; 1998 John Wiley & Sons, Inc. J. Graph Theory 29: 103&ndash;110, 1998
Hierarchical games and fair systems of taxation
Authors: Alexey L. Sadovski
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

Mathematical model of income and corporative taxes is considered as an hierarchical game of different social groups. Existence of equilibrium solution is proven, and constructive method of determining this equilibrium is discussed.
Finding bipartition respecting natural dense clusters
Authors: Abhijit S. Deshpande, Sachin B. Patkar, H. Narayanan
Venue: Proceedings of the 9th International Conference on Circuits (2005)

We present an efficient heuristic for finding good bipartitioning of the vertex set of a hypergraph, which respects the dense clusters inside. In a hypergraph modeling a VLSI netlist, these dense clusters typically correspond to dense combinational blocks and are better kept intact for some obvious VLSI design benefits. Our approach to identify the dense clusters is based on the theory of submodular functions. Once these clusters are identified, we make use of FM algorithm to get a good bipartition, providing some hints to FM to keep these clusters intact. This approach not only respects the natural clusters, but also produces bipartitions with better net-cut in quite a few cases. Hence, we propose that this approach can be used as an alternate strategy to find a good bipartition, which respects the dense clusters.
A Hybrid Intelligent Algorithm for Stochastic Dependent-Chance Programming
Authors: Xiao Ning, Zeng Jianchao
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

The stochastic dependent-chance programming belongs to a class of stochastic programming problems, which has wide application backgrounds, in order to search an algorithm which can more effectively solve this problem, in the paper, stochastic simulation is used to produce training samples for BP neural networks, and a hybrid intelligent algorithm for stochastic dependent-chance programming combined PSO algorithm with BP neural networks for approximation of the chance function is presented. Finally, the simulation results of two examples are given to show the correctness and effectiveness of the algorithm.
Cost sharing mechanisms for near-optimal traffic aggregation and network design
Authors: Baruch Awerbuch, Rohit Khandekar
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

A fundamental network design problem is the one of Traffic Aggregation or Network Design. The goal is to design a network which is able to support a unit flow for each commodity, at a time, between its source-sink pair, e.g., to support buffered multicast traffic. When the flows are unsplittable, this corresponds to the Steiner forest problem and to the problem of sharing cost of multicast by different users. As a result of greedy selfish behavior of users in the network design game, the overall quality of the resulting solution is often not as good as the globally optimum solution of the underlying problem. We are therefore interested in the problem of designing distributed cost sharing mechanisms that induce the selfish agents to converge to the near-optimum solutions. In this paper, our main contribution is showing that (1+ε) ratio can be achieved by (non-obvious) unfair cost sharing mechanism, at least for the fractional version of the problem. Our second contribution is showing how to implement our cost sharing mechanism which guarantees fast convergence to a near-optimum equilibrium.
Medical Record Privacy and Security in a Digital Environment
Authors: Stasia Kahn, Vikram Sheshadri
Venue: IT Professional (2008)

Quality healthcare increasingly means addressing the security, privacy, and confidentiality of medical records in both wire-line and wireless environments.
A hybrid method based on artificial immune system and fuzzy k-NN algorithm for diagnosis of heart valve diseases
Authors: Abdulkadir Sengur, Ibrahim Turkoglu
Venue: Expert Systems with Applications: An International Journal (2008)

The use of artificial intelligence methods in medical analysis is increasing. This is mainly because the effectiveness of classification and detection systems has improved in a great deal to help medical experts in diagnosing. In this paper, we investigate the performance of an artificial immune system (AIS) based fuzzy k-NN algorithm to determine the heart valve disorders from the Doppler heart sounds. The proposed methodology is composed of three stages. The first stage is the pre-processing stage. The feature extraction is the second stage. During feature extraction stage, Wavelet transforms and short time Fourier transform were used. As next step, wavelet entropy was applied to these features. In the classification stage, AIS based fuzzy k-NN algorithm is used. To compute the correct classification rate of proposed methodology, a comparative study is realized by using a data set containing 215 samples. The validation of the proposed method is measured by using the sensitivity and specificity parameters. 95.9% sensitivity and 96% specificity rate was obtained.
NUCLiB - The virtual nuclear engineering library on the Internet
Authors: Rafael Ball, Jürgen Goebelbecker
Venue: Information Services and Use (2007)

The majority of publications in the field of nuclear engineering appear as reports and are therefore classed as grey literature. They are not usually available in bookshops and in general can only be obtained directly from the publishing institution. To the best of our knowledge, indexed collections do not exist in Germany. The libraries of both research centres in J&uuml;lich and Karlsruhe have been building up collections of primary and secondary literature within the field of nuclear technology and related sub-disciplines, as well as related subject areas, for decades. In order to help maintain competence in nuclear engineering, they are currently developing a virtual nuclear engineering portal, NUCLiB (Nuclear Library), which they will use to make a unique repository of full texts available to science, research and practical applications in the future. The reports are successively digitized and after optical character recognition is performed, they are then automatically indexed with metadata. This objective indexing will allow scientists and technicians to search through and make use of the collections. Furthermore, a sophisticated portal with all of the modern functions will be developed and made available. A demo version of the portal can be accessed online at www.nuclib.de.
Exploring ocean data
Authors: James G. Bellingham, Mike Godin
Venue: ACM SIGMOD Record (2008)

In fall of 2004, we met Jim Gray and began to converse about the data needs of ocean scientists. The conversations ultimately led to the development of a unique portal for exploring multidisciplinary data sets, which we call the Metadata Oriented Query Assistant (MOQuA). At the time, we were working with an extremely rich data set which included measurements from ships, satellites, aircraft, moorings, and a variety of underwater robots. The data set also included output from both atmospheric and ocean models. We initially made the data available via a state-of-the-art data server. However, serious users did not use the server, instead approaching us for copies of the relevant portions. Our experience convinced us that we needed a far more capable portal, but framing the seemingly divergent needs of ocean scientists in a way which could be satisfied via an intuitive interface was challenging. In the course of many conversations and interactions with Jim, we realized that we needed to structure the interaction around questions rather than visualizations, and this simple insight lead to the development of MOQuA system.
Smoothing Lipschitz functions
Authors: Gleb Beliakov
Venue: Optimization Methods Software (2007)

This paper describes a new approach to multivariate scattered data smoothing. It is assumed that the data are generated by a Lipschitz continuous function f, and include random noise to be filtered out. The proposed approach uses known, or estimated value of the Lipschitz constant of f, and forces the data to be consistent with the Lipschitz properties of f. Depending on the assumptions about the distribution of the random noise, smoothing is reduced to a standard quadratic or a linear programming problem. We discuss an efficient algorithm which eliminates the redundant inequality constraints. Numerical experiments illustrate applicability and efficiency of the method. This approach provides an efficient new tool of multivariate scattered data approximation.
Information-theory based optimal location management schemes for integrated multi-system wireless networks
Authors: Archan Misra, Abhishek Roy, Sajal K. Das
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

In a multi-system environment where a mobile node can utilize multiple interfaces and simultaneously connect to multiple providers, new opportunities exist for efficient location management strategies spanning heterogeneous cellular wireless networks. In this paper, an integrated framework is developed for location management in such a multi-system, fourth generation (4G) wireless networks. This information-theoretic framework allows each individual sub-system to operate fairly independently, and does not require the knowledge of individual sub-network topologies. An efficient location management in such a loosely coupled network is designed by having a mobile node view its movement as a vector-valued sequence, and then transmit this sequence in an entropy coded form to the network. We demonstrate how an intelligent, integrated paging strategy must consider the joint residence probability distribution of a mobile node in multiple sub-networks. We prove that the determination of an optimal paging sequence is NP-complete, and also propose an efficient greedy heuristic to compute the paging sequence, both without and with bounds on the paging delay. Three different location tracking strategies are proposed and evaluated; they differ in their degrees of centralized control and provide tradeoff between the location update and paging costs. Simulation experiments demonstrate that our proposed schemes can result in more than 50% savings in both update and paging costs, in comparison with the basic movement-based, multi-system location management strategy.
Design and Implementation of the Pervaho Middleware for Mobile Context-Aware Applications
Authors: Patrick Eugster, Benoît Garbinato, Adrian Holzer
Venue: Proceedings of the 2008 International MCETECH Conference on e-Technologies (2008)

Context-aware applications offer a great potential for the future of mobile computing. In order to be developed in an optimal way, such applications need appropriate middleware services. This paper introduces Pervaho, an integrated middleware aimed specifically for supporting the development and testing of mobile context-aware applications. To illustrate the use of Pervaho, we walk through the development of a concrete mobile context-aware application and show how it can be elegantly built on top of Pervaho's location-based publish/subscribe service. We also illustrate how a specialized mobility testing tool significantly simplifies the process of testing proximity-based semantics.We then present the implementation of Pervaho, which is based on a set of communication protocols geared at mesh networks. Finally, we provide a performance analysis of our implementation.
Extreme data mining
Authors: Sridhar Ramaswamy
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

At Google, the quality and speed of statistical data mining algorithms directly affects the usefulness of our search results and the relevance of our targeted advertising. One of the things that makes planet-wide, high throughput, 24/7 data mining so interesting is that all parts of the software stack are involved. This talk will walk up the stack, from the physical machines in warehouse-sized data centers, through networking and secondary storage abstractions to the distributed numerical methods and high throughput training and serving algorithms needed to support online logs processing and machine learning. We will also discuss the significant infrastructure and algorithmic impacts of batch versus online training: both data mining modes have essential roles in Google.
Dominant Substrate Noise Coupling Mechanism for Multiple Switching Gates
Authors: Emre Salman, Eby G. Friedman, Radu M. Secareanu, Olin L. Hartin
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

The dominant substrate noise coupling mechanism is determined for multiple switching gates based on a physically intuitive model. The model exhibits reasonable accuracy as compared to SPICE. The regions where ground coupling and source/drain coupling dominate are described based on this model. The impact of multiple parameters such as the rise time, number of switching gates, decoupling capacitance, and parasitic inductance on the dominant noise coupling mechanism is investigated. The dominance of ground coupling in large scale circuits, as generally assumed, is shown to be invalid if sufficient decoupling capacitance is used or the circuit exhibits a low parasitic inductance such as a flip-chip package. The efficacy of several noise reduction techniques is discussed based on the application of the dominant noise analysis model.
An upper bound on the number of planar k-sets
Authors: J. Pach
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

Given a set S of n points, a subset X of size k is called a k-set if there is a hyperplane II that separates X from X/sup c/. It is proved that O(n square root k/log/sub */k) is an upper bound for the number of k-sets in the plane, thus improving the previous bound of P. Erdos et al. (A Survey of Combinatorial Theory, North-Holland, 1983, p.139-49) by a factor of log/sub */k. The method can be extended to give the bound O(n square root k/(log k)/sup epsilon /). The proof only establishes the weaker result; it uses the geometry and combinatorics together in a stronger way than in the earlier work.
Research and Design for Unify XML-Based Management System Framework
Authors: Jiang Hanping, Shang Lei
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

With the developing of the fast services integration and customization, it is challenge to design a unify management framework to meet the requirement of multi-services management. We design an unify XML-based management framework named UMS. The UMS constitutes a tri-partite intelligent framework that delivers unprecedented time-saving benefits in threeways: The first is UMS configuration manager that contains pre-defined XML-based network service configuration schemes to readily manage the complex depth of networking features; secondly, the UMS provides an open and flexible environment to easily extend complex services and applications by integrating additional features; finally, XML file that can be processed through XIPC and interface with the UMS configuration manager, it incorporates modular user interfaces called UMS clients. The UMS can assimilate different services and applications to be managed for network-readiness and interoperability.
A fast and effective segmentation algorithm for undersea hydrothermal vent image
Authors: Fuyuan Peng, Qian Xia, Guohua Xu, Xi Yu, Lin Luo
Venue: Proceedings of the 4th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision (2004)

This paper puts forward a segmentation algorithm for undersea hydrrothermal vent image. Basing on the in-depth analysis on the difference between sea-water area, rock and smoke area, which are the three kinds of objects in the typical undersea hydrothermal vent image, we employ both OTSU thresholding and Fuzzy C-Mean (FCM) clustering to segment the image, and discard all the non-interested area living only smoke area. Experiments show that this algorithm can segment the image both quickly and precisely.
The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume
Authors: L. Lovasz
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

A. Sinclair and M. Jerrum (1988) derived a bound on the mixing rate of time-reversible Markov chains in terms of their conductance. The authors generalize this result by not assuming time reversibility and using a weaker notion of conductance. They prove an isoperimetric inequality for subsets of a convex body. These results are combined to simplify an algorithm of M. Dyer et al. (1989) for approximating the volume of a convex body and to improve running-time bounds.
A model of non-preferred hand mode switching
Authors: Jaime Ruiz, Andrea Bunt, Edward Lank
Venue: Proceedings of graphics interface 2008 (2008)

Effective mode-switching techniques provide users of tablet interfaces with access to a rich set of behaviors. While many researchers have studied the relative performance of mode-switching techniques in these interfaces, these metrics tell us little about the behavior of one technique in the absence of a competitor. Differing from past comparison-based research, this paper describes a temporal model of the behavior of a common mode switching technique, non-preferred hand mode switching. Using the Hick-Hyman Law, we claim that the asymptotic cost of adding additional non-preferred hand modes to an interface is a logarithmic function of the number of modes. We validate the model experimentally, and show a strong correlation between experimental data and values predicted by the model. Implications of this research for the design of mode-based interfaces are highlighted.
CTO Roundtable: Storage Part I
Authors: Mache Creeger
Venue: Communications of the ACM (2008)

Leaders in the storage world offer valuable advice for making more effective architecture and technology decisions.
Learning via queries
Authors: W. I. Gasarch
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

The power of various query languages is compared along two dimensions, namely the inherent power of the language and the number of alternations of quantizers. Learning by asking questions is compared to learning by passively reading data. It is found that the extent of what can be learned by queries is largely dependent on the language used by the inference mechanism to formulate questions to ask of its trainer. It is proved that inference machines that are allowed to ask first-order questions with plus and times can be used to solve the halting problem and therefore can learn all the recursive functions. Learning languages are also considered.
MPADS: memory-pooling-assisted data splitting
Authors: Stephen Curial, Peng Zhao, Jose Nelson Amaral, Yaoqing Gao, Shimin Cui, Raul Silvera, Roch Archambault
Venue: Proceedings of the 7th international symposium on Memory management (2008)

This paper describes Memory-Pooling-Assisted Data Splitting (MPADS), a framework that combines data structure splitting with memory pooling --- Although it MPADS may call to mind memory padding, a distintion of this framework is that is does not insert padding. MPADS relies on pointer analysis to ensure that splitting is safe and applicable to type-unsafe language. MPADS makes no assumption about type safety. The analysis can identify cases in which the transformation could lead to incorrect code and thus MPADS abandons those cases. To make data structure splitting efficient in a commercial compiler, MPADS is designed with great attention to reduce the number of instructions required to access the data after the data-structure splitting. Moreover the implementation of MPADS reveals that architecture details should be considered carefully when re-arranging data allocation. For instance one of the most significant gains from the introduction of data-structure splitting in code targetting the IBM POWER architecture is a dramatic decrease in the amount of data prefetched by the hardware prefetch engine without a noticeable decrease in the cache utilization. Triggering fewer hardware prefetch streams frees memory bandwidth and cache space. Fewer prefetching streams also reduce the interference between the data accessed by multiple cores in modern multicore processors.
Multidimensional optimization of finite difference schemes for Computational Aeroacoustics
Authors: Adrian Sescu, Ray Hixon, Abdollah A. Afjeh
Venue: Journal of Computational Physics (2008)

Because of the long propagation distances, Computational Aeroacoustics schemes must propagate the waves at the correct wave speeds and lower the isotropy error as much as possible. The spatial differencing schemes are most frequently analyzed and optimized for one-dimensional test cases. Therefore, in multidimensional problems such optimized schemes may not have isotropic behavior. In this work, optimized finite difference schemes for multidimensional Computational Aeroacoustics are derived which are designed to have improved isotropy compared to existing schemes. The derivation is performed based on both Taylor series expansion and Fourier analysis. Various explicit centered finite difference schemes and the associated boundary stencils have been derived and analyzed. The isotropy corrector factor, a parameter of the schemes, can be determined by minimizing the integrated error between the phase or group velocities on different spatial directions. The order of accuracy of the optimized schemes is the same as that of the classical schemes, the advantage being in reducing the isotropy error. The present schemes are restricted to equally-spaced Cartesian grids, so the generalized curvilinear transformation method and Cartesian grid methods are good candidates. The optimized schemes are tested by solving various multidimensional problems of Aeroacoustics.