ppxscal/embedding_network huggingface dataset:
Joint Reconstruction and Registration Using Level Sets: Application to the Computer-Aided Ablation of Atrial Fibrillation
Authors: Jonghye Woo, Byung-Woo Hong, Sunil Kumar, Indranill Basu Ray, C. C. Jay Kuo
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

A novel surface reconstruction algorithm based on a variational framework using the level set method is proposed and its application to atrial fibrillation (AF) treatment is presented in this work. The need of reconstructing the cardiac surface from multi-modality data with magnetic resonance imaging (MRI) and computer tomography (CT) for surgical AF treatment is first explained. An implicit form of the cardiac surface is analytically derived by optimizing an energy functional that takes into account the distance between the surface and electroanatomic mapping (EAM) data and its similarity to a prior shape model. This problem is then solved numerically. The resultant algorithm allows non-rigid deformation to occur in the reconstruction of the cardiac surface. Promising numerical and experimental results show the potential of the proposed approach.
Enforcing Patient Privacy in Healthcare WSNs Using ECC Implemented on 802.15.4 Beacon Enabled Clusters
Authors: Jelena Miic
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

We consider healthcare wireless sensornetworks implemented using 802.15.4 beacon enabled technology, in whichsecurity processors are implemented with low power microcontrollers. Inthis setting, we propose to use elliptic curve cryptography for keydistribution, in order to decrease energy consumption compared to thebetter known RSA algorithm.
Noninvasive leakage power tomography of integrated circuits by compressive sensing
Authors: Davood Shamsi, Petros Boufounos, Farinaz Koushanfar
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

We introduce a new methodology for noninvasive post-silicon characterization of the unique static power profile (tomogram) of each manufactured chip. The total chip leakage is measured for multiple input vectors in a linear optimization framework where the unknowns are the gate leakage variations. We propose compressive sensing for fast extraction of the unknowns since the leakage tomogram contains correlations and can be sparsely represented. A key advantage of our approach is that it provides leakage variation estimates even for inaccessible gates. Experiments show that the methodology enables fast and accurate noninvasive extraction of leakage power characteristics.
Some new properties for capacitated lot-sizing problem with bounded inventory and stockouts
Authors: Xiao Liu, Feng Chu, Chengbin Chu, Chengen Wang
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

We formulate the single-item inventory capacitated lot size model with lost sales. Unsatisfied demand cannot be backlogged, which means lost sales. Costs are assumed to be time variant. Some new properties are obtained in an optimal solution and a dynamic programming algorithm is developed to solve the problem in O(T2) time.
Longest cycles in tough graphs
Authors: H. A. Jung, P. Wittmann
Venue: Journal of Graph Theory (1999)

In this article, we establish bounds for the length of a longest cycle C in a 2-connected graph G in terms of the minimum degree &delta; and the toughness t. It is shown that C is a Hamiltonian cycle or |C| &ge; (t + 1) &delta; + t. &copy; 1999 John Wiley Sons, Inc. J Graph Theory 31: 107127, 1999
Characteristics of thin lanthanum lutetium oxide high-k dielectrics
Authors: Dina H. Triyoso, David C. Gilmer, Jack Jiang, Ravi Droopad
Venue: Microelectronic Engineering (2008)

In this work, we evaluate the thermal stability of thin film lanthanum lutetium oxide (LLO) on silicon deposited using molecular beam epitaxy (MBE). Thin LLO films are capped with TaN and annealed at 700^oC or 900^oC in nitrogen or oxygen ambients. SIMS analysis indicates no La and Lu up diffusion into TaN after annealing. However, after a 900^oC anneal Si is detected in the LLO. SIMS data also suggested growth of interfacial oxide upon anneal. Cross sectional TEM of as deposited films show a sharp high-k/Si-substrate interface with very thin interfacial layer. An increase in the LLO layer thickness, and the interfacial layer thickness between the LLO and the Si-substrate is observed after annealing. Capacitors with LLO dielectrics were also formed using TiN electrode and low leakage is demonstrated for samples annealed at 700^oC. However, a large positive flatband voltage shift and an increase in leakage is observed in LLO capacitors after undergoing 900^oC anneal with a TiN metal gate.
Efficient shape recognition method using novel metric for complex polygonal shapes
Authors: Vesna Zeljkovic, Robert B. Vincelette, Marko Savic
Venue: Proceedings of the 2nd international conference on Mobile multimedia communications (2006)

We propose two new optimal and sub-optimal solution shape recognition algorithms using geometric calculations. Our algorithms are efficient and tolerate severe noise. They work for convex and concave polygons equally well. These algorithms are invariant under translation, rotation, change of scale and they are reasonably easy to compute.
Enhancing access to open corpus educational content: learning in the wild
Authors: Séamus Lawless, Lucy Hederman, Vincent Wade
Venue: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia (2008)

The World Wide Web (WWW) provides access to a vast array of interconnected educational content on almost every subject imaginable. A great deal of this content is ideal for incorporation into personalised eLearning experiences. However the discovery, harvesting and incorporation of appropriate educational material have proven to be complex and arduous tasks. Traditional educational hypertext systems are based upon the generation of links and anchors between content objects [1]. However the dynamic incorporation of open corpus educational content in eLearning requires the generation of a relationship between educational concepts and the hypertext documents. One approach to create this overlay between concept and content is to use a Mindmap interface to allow learners to explore and associate hypertext content with knowledge maps of their own creation. This paper presents the Open Corpus Content Service (OCCS), a framework that uses the hypertext structure of the WWW to provide methods of educational content discovery and harvesting. The OCCS semantically examines linked content on both the WWW and in digital content repositories, and creates concept specific caches of content. The paper also introduces U-CREATe, a novel user-driven Mindmap interface for supporting the exploration and assembly of content cached by the OCCS, in a pedagogically meaningful manner. The combination of these systems benefits both the educator and learner, empowering the learner through ownership of the educational experience and allowing the educator to focus on the pedagogical design of educational offerings rather than content authoring.
Spectral linear mixture modelling approaches for land cover mapping of tropical savanna areas in Brazil
Authors: M. E. Ferreira, L. G. Ferreira, E. E. Sano, Y. E. Shimabukuro
Venue: International Journal of Remote Sensing (2007)

It is estimated that approximately 60% of the natural vegetative cover of the Brazilian savanna, locally known as the Cerrado and the second largest biome in South America, have already been converted. Despite this rapid conversion pace, there have only been limited attempts to operationally monitor this major farming frontier with remote sensing data. In this study, we evaluated the performance of spectral linear mixture models (SLMM) for the mapping of the major Cerrado physiognomies. Two SLMMs were considered: a general model, comprising the vegetation, soil and shade components, and a specific model, restricted to the 'true' Cerrado physiognomies. We also considered the potential effects of atmospheric contamination, and the influence of endmember sources on the fraction images derived from the general and specific models, respectively. The general model, apparently resistant to the atmosphere with respect to land cover discrimination, primarily enhanced forested domains and non-vegetated targets (water bodies and bare soils). By contrast, the specific model, regardless of the endmember source, significantly distinguished the major Cerrado physiognomies. Such contrasting and complementary behavior suggests a potential synergism between the general and specific models for the mapping and monitoring of a complex environment such as the Cerrado biome.
Accelerated Neural Evolution through Cooperatively Coevolved Synapses
Authors: Faustino Gomez, Jürgen Schmidhuber, Risto Miikkulainen
Venue: The Journal of Machine Learning Research (2008)

Many complex control problems require sophisticated solutions that are not amenable to traditional controller design. Not only is it difficult to model real world systems, but often it is unclear what kind of behavior is required to solve the task. Reinforcement learning (RL) approaches have made progress by using direct interaction with the task environment, but have so far not scaled well to large state spaces and environments that are not fully observable. In recent years, neuroevolution, the artificial evolution of neural networks, has had remarkable success in tasks that exhibit these two properties. In this paper, we compare a neuroevolution method called Cooperative Synapse Neuroevolution (CoSyNE), that uses cooperative coevolution at the level of individual synaptic weights, to a broad range of reinforcement learning algorithms on very difficult versions of the pole balancing problem that involve large (continuous) state spaces and hidden state. CoSyNE is shown to be significantly more efficient and powerful than the other methods on these tasks.
Mathematical-model-based design of silicon burst neurons
Authors: Takashi Kohno, Kazuyuki Aihara
Venue: Neurocomputing (2008)

Conventionally, silicon neurons have been designed based on two major principles, namely phenomenological and conductance-based principles. In previous studies [T. Kohno, K. Aihara, Parameter tuning of a MOSFET-based nerve membrane, in: Proceedings of the 10th International Symposium on Artificial Life and Robotics 2005, 2005, pp. 91-94; T. Kohno, K. Aihara, A MOSFET-based model of a Class 2 Nerve membrane, IEEE Trans. Neural Networks 16 (3) (2005) 754-773; T. Kohno, K. Aihara, Bottom-up design of Class 2 silicon nerve membrane, J. Intell. Fuzzy Syst., in press], we proposed a mathematical-model-based design principle that is based on phase plane and bifurcation analyses. It reproduces the mathematical structures of biological neuron models, thus making the silicon neurons simple and biologically realistic. In this study, we demonstrate that square-wave and another type of silicon bursters can be constructed by adding simple circuitries and tuning the system parameters for the silicon nerve membrane designed in our previous studies. Our simple square-wave burster exhibits various firing patterns, including chaotic spiking and bursting.
Discrimination of Virtual Environments Under Visual and Haptic Rendering Delays
Authors: In Lee, Seungmoon Choi
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Many virtual reality systems have a distributed structure for certain purposes such as more computational power, tele-presence, collaboration, and portability. However, network delays are inevitable in the distributed structure and often make sensory information delivered behind time to the user. In the literature, the effect of network delays on the quality of virtual environments has been considered mostly with respect to task performances. In this paper, we pay attention to whether perceptual artifacts caused by network delays are perceptible by the user, which is a more stringent criterion than the degradation of task performance. We examined minimum perceptible visual and/or haptic rendering delays by measuring their discrimination thresholds between normal and delayed virtual environments with and without a task, and report the results in this paper. We also provide a simple guideline for determining whether some active delay compensation algorithms are required in a distributed virtual reality system by comparing representative network delays to the measured discrimination thresholds.
Brain ?-Aminobutyric Acid Detection with Improved Selectivity by Double Quantum Filter Technique
Authors: Hui Wang, Tian-yu Tang, Yun Jiao, Zu-hong Lu, Ren-hua Wu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

γ-aminobutyric acid (GABA) is the major inhibitory neurotransmitter for the normal function of human brain. It is difficult to detect GABA signal with the conventional single quantum filter technique due to its relatively low concentration and overlapping with other signals from creatine (Cr), glutathione (GSH), aswell as macromolecules. A point-resolved spectroscopy(PRESS)-localized double quantum filter (DQF) with improvements was applied to the detection of GABA ona 1.5T clinical scanner. The sequence efficiency and the degree of suppression of uncoupled resonances was examined in phantom experiments after numerical analysis of the editing performance. Excellent GABA signal retention at 3.01 ppm and robust suppression of overlapping metabolites was achieved due to high selectivity of the read pulse and the optimization of the order of the gradients. The spectral editing efficiency was measured to be 40 % and the suppressed Cr ratiowas 1250:1. That was approximately the same as theresult of theoretical analysis.
The RSA algorithm (abstract only)
Authors: Josh Jones
Venue: ACM Communications in Computer Algebra (2008)

My project is a brief introduction for the RSA Algortim. This project will include a very brief history of where RSA originated, as well as how the RSA algorthim works. Following this, the mathematical proof of RSA is presented along with the two necessary theorems needed to prove RSA. The final portion of my presentation includes some of the potential threats to RSA and how to prevent these attacks, including a chart of the strength of RSA based on time required to crack RSA in MIPS-Years where the only factor is the size of the key.
The privacy badge: a privacy-awareness user interface for small devices
Authors: Martin Gisch, Alexander De Luca, Markus Blanchebarbe
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

In this paper, we present the Privacy Badge, a privacy-awareness user interface, created to visualize privacy loss in ubiquitous and pervasive computing environments and enable users to do privacy settings in an easy and understandable way. Moreover, the interface was created to work on small devices, which suffer of limited input and output capabilities and for which desktop interface approaches are not appropriate. We evaluated our prototype in a user study to find out, whether the concepts are suitable and users are able to interact with it. The evaluation shows that our approach satisfied our expectations. Nevertheless, during the study, some improvements to our idea could be identified, which we are planning to include and evaluate in future work.
The edge-transitive but not vertex-transitive cubic graph on 112 vertices
Authors: Marston Conder, Aleksander Malnič, Dragan Marušič, Tomaž Pisanski, Primož Potočnik
Venue: Journal of Graph Theory (2005)

A detailed description is given of a recently discovered edge-transitive but not vertex-transitive trivalent graph on 112 vertices, which turns out to be the third smallest example of such a semisymmetric cubic graph. This graph has been called the Ljubljana graph by the first author, although it is believed that its existence may have been known by R. M. Foster. With the help of some advanced theory of covering graphs, various properties of this graph are analyzed, including a connection with the Heawood graph via ideals over polynomial rings. &copy; 2005 Wiley Periodicals, Inc. Part of this paper was written while the author was Visiting Neil R. Grabois Professor of Mathematics at Colgate University.
On the choice of correctors for semi-implicit Picard deferred correction methods
Authors: Anita T. Layton
Venue: Applied Numerical Mathematics (2008)

The goal of this study is to assess the implications of the choice of correctors for semi-implicit Picard integral deferred correction (SIPIDC) methods. The SIPIDC methods previously developed compute a high-order approximation by first computing a low-order provisional solution using a semi-implicit method and then using a first-order semi-implicit method to solve a series of correction equations, each of which raises the order of accuracy of the solution by one. In this study, we examine the efficiency of SIPIDC methods that instead use standard second-order semi-implicit methods to solve the correction equations. The accuracy, efficiency, and stability of the resulting methods are compared to previously developed methods, in the context of both nonstiff and stiff problems.
Kiasan: A Verification and Test-Case Generation Framework for Java Based on Symbolic Execution
Authors: Xianghua Deng, Robby, John Hatcliff
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

Best program practices in software engineering emphasize software components that are loosely coupled and can be independently developed by different vendors. While these approaches improve the process of software development, however, they present a number of challenges involving reasoning about the correctness of individual components as well as their integration. Design-by-contract reasoning offers a promising approach to reason about software components by requiring software contracts that describe the behaviors of the components. This allows one to focus at satisfying the contract of each component, i.e., it allows compositional reasoning. In this paper, we present Kiasan, a technique that combines symbolic execution, model checking, theorem proving, and constraint solving to support design-by-contract reasoning of object-oriented software. There are a number of interesting trade-offs between Kiasan other approaches such as ESC/Java. While checking in Kiasan is sometime more expensive, Kiasan can check much stronger behavioral properties of object-oriented software including properties/software that makes extensive use of heap-allocated data. In addition, Kiasan naturally generates counter examples, visualization of code effects, and JUnit test cases that are driven by code and user-supplied specifications. We present Kiasan and describe how it is implemented on top of the Bogor framework. Furthermore, we present a case study in which Kiasan is applied to a variety of examples and we discuss insights gained from our experience.
Quantum computing: beyond the limits of conventional computation
Authors: Marius Nagy, Selim G. Akl
Venue: International Journal of Parallel, Emergent and Distributed Systems (2007)

The quantum model of computation not only offers entirely new ways to manipulate information, but also allows information processing tasks to be formulated in unconventional, genuine quantum mechanical terms. We show that the task of distinguishing among entangled quantum states combines entanglement and non-determinism in a way that makes the quantum solution impossible to simulate on any classical machine (even one equipped with the same measurement capabilities as the quantum computational device). A new class of information processing tasks is thus uncovered whose members are readily carried out by a quantum computer, yet are impossible to perform on any classical machine (whether deterministic or probabilistic). In the broad, unconventional context created by quantum mechanics, the computational power of a quantum computer is therefore strictly greater than that of a classical computer.
Theoretical foundations for rendezvous of glowworm-inspired agent swarms at multiple locations
Authors: K. N. Krishnanand, D. Ghose
Venue: Robotics and Autonomous Systems (2008)

We present theoretical foundations for a variation of the multi-agent rendezvous problem involving design of local control strategies that enable agent swarms, with hard-limited sensing ranges, to split into disjoint subgroups, exhibit simultaneous taxis behavior toward, and eventually rendezvous at, multiple unknown locations of interest. The algorithm used to solve the above problem is based on a glowworm swarm optimization (GSO) technique, developed earlier, that finds multiple optima of multi-modal objective functions. We characterize the various phases of the algorithm that help us to develop a theoretical framework required for analysis. In particular, we show through simulations that the implementation of the GSO algorithm at the individual agent level gives rise to two major phases at the group level-splitting of the agent-swarm into subgroups and local convergence of agents in each subgroup to the peak locations. We provide local convergence results under certain restricted set of assumptions, leading to a simplified model of the algorithm, making it amenable to analysis, while still reflecting most of the features of the original algorithm. In particular, we find an upper bound on the time taken by the agents to converge to an isolated leader and on the time taken by the agents to converge to one of the leaders with non-isolated and non-overlapping neighborhoods. Finally, we show that agents under the influence of multiple leaders with overlapping neighborhoods asymptotically converge to one of the leaders. We present some illustrative simulations to support the theoretical findings of the paper.
Computer science: student myths and misconceptions
Authors: T. Beaubouef, P. McDowell
Venue: Journal of Computing Sciences in Colleges (2008)

This paper discusses common myths and misconceptions about the field of computer science. It addresses and attempts to dispel these notions in an effort to provide prospective computer science students and the general public with a more realistic view of the field.
Assessing the Value of Enterprise Identity Management (EIdM) - Towards a Generic Evaluation Approach
Authors: Denis Royer
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

The introduction of Enterprise Identity Management Systems (EIdMS) in organisations is a costly and challenging endeavour, where organisations have to face various costs for the planning, the implementation, and the operation of such systems. In the planning phase it is important that organisational aspects are incorporated into the development of an enterprise identity management (EIdM) solution, instead of purely focussing on the technological or financial issues. Indeed, without a proper assessment of the costs and the organisational settings (such as stakeholders, processes), companies will not see the benefit for introducing EIdM as additional layer into their IT infrastructure and their business processes. This paper proposes initial ideas for a generic approach, based on the balanced scorecard, for assessing the value of investing in the introduction of EIdMS. In the decision process, such an instrument can be used for decision support purposes and the planning phase on a tactical level. Furthermore, the organisational aspects are discussed and possible solutions for integrating all relevant parties into the planning process are presented.