ppxscal/embedding_network huggingface dataset:
Classification Algorithm Based on Weighted SVMs and Locally Tuning kNN
Authors: Wang Shu-Bin, Ling Ping, You Xiang-Yang, Xu Ming, Rong Xiang-Sheng
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

This paper presents a new classification algorithm consisting of a Weighted SVMs approach (WSVM) to identify data class, and a locally Tuning kNN (TkNN) to address the rejected case. Basic SVM of WSVM is equipped with weights derived from SVM output distribution to demonstrate decision confidence. These weights influence label assignment. TkNN handles the difficult cases rejected by WSVM. It works in the neighborhood that is developed by a locally informative metric. SVM decision interfaces helps to define the new metric. Hyper parameters of basic SVM are learned context dependently. We present experimental evidence of classification performance improved by our schema over state of the arts.
Maximal sets of Hamilton cycles in Kn,n
Authors: Darryn E. Bryant, S. El-Zanati, C. A. Rodger
Venue: Journal of Graph Theory (2000)

In this article, we prove that there exists a maximal set of m Hamilton cycles in Kn,n if and only if n-4 < m &le; n-2. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 33: 25&ndash;31, 2000
The repeatability experiment of SIGMOD 2008
Authors: I. Manolescu, L. Afanasiev, A. Arion, J. Dittrich, S. Manegold, N. Polyzotis, K. Schnaitter, P. Senellart, S. Zoupanos, D. Shasha
Venue: ACM SIGMOD Record (2008)

SIGMOD 2008 was the first database conference that offered to test submitters' programs against their data to verify the experiments published. This paper discusses the rationale for this effort, the community's reaction, our experiences, and advice for future similar efforts.
The GNU libstdc++ parallel mode: software engineering considerations
Authors: Johannes Singler, Benjamin Konsik
Venue: Proceedings of the 1st international workshop on Multicore software engineering (2008)

The C++ Standard Library implementation provided with the free GNU C++ compiler, libstdc++, provides a "parallel mode" as of version 4.3. Using this mode enables existing serial code to take advantage of many parallelized STL algorithms, an approach to making use of multi-core processors which are now or will soon will be ubiquitous. This paper describes the software engineering issues discovered during implementation, the results of user testing, and presents possible solutions to outstanding issues. Design issues with configuring the software environment to a wide variety of multi-core hardware options, influencing algorithm and parameter choices at compile and run time, standards compliance, and the interplay between execution speed, the executable size, the library code size, and the compilation time are addressed.
Electrochemistry on microcircuits. II: Copper dendrites in oxalic acid
Authors: C. Gabrielli, L. Beitone, C. Mace, E. Ostermann, H. Perrot
Venue: Microelectronic Engineering (2008)

A new chip, which consists in an array of microelectrodes of various size and geometry, was realized by means of an industrial CMOS process. The microelectrodes were arranged as couples between which copper dendrites were able to grow in oxalic acid media up to short circuit the two electrodes. The current transient generated by the dendrite growth observed when a potential step was applied between the two microelectrodes was used to characterize the dendrite kinetics. In particular, the short circuit was detected when the current increased abruptly after some time called short circuit time. The influence of the oxalic acid concentration and of the geometry for the square-bar and lozenge-bar patterns on the short circuit time was investigated. At the end, some possibilities of partial inhibition of the dendritic growth were tested: addition of a supporting electrolyte, modification of the pH of the solution, addition of an inhibitor.
Application Resilience: Making Progress in Spite of Failure
Authors: William M. Jones, John T. Daly, Nathan A. DeBardeleben
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

While measures such as raw compute performance and system capacity continue to be important factors for evaluating cluster performance, such issues as system reliability and application resilience have become increasingly important as cluster sizes rapidly grow. Although efforts to directly improve fault-tolerance are important, it is also essential to accept that application failures will inevitably occur and to ensure that progress is made despite these failures. Application monitoring frameworks are central to providing application resilience. As such, the central theme of this paper is to address the impact that application monitoring detection latency has on the overall system performance. We find that immediate fault detection is not necessary in order to obtain substantial improvementin performance. This conclusion is significant becauseit implies that less complex, highly portable, and predominately less expensive failure detection schemes would provide adequate application resilience.
Spatial annotation and social navigation support for electronic books
Authors: Jae-Kyung Kim, Rosta Farzan, Peter Brusilovsky
Venue: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia (2008)

Modern efforts on digitizing electronic books focus on preserving authentic "spatial" representation of the original sources. The new format requires new tools to help users to access, process, and make sense of digital information. This paper presents an approach which assists users of these new "spatial" sources by giving them a combination of annotation and social navigation support. This approach is currently fully implemented and under evaluation in a classroom study.
Optimal scheduling and power control for tdma based point to multipoint wireless networks
Authors: Rabin Patra, Sonesh Surana, Sergiu Nedevschi, Eric Brewer
Venue: Proceedings of the second ACM SIGCOMM workshop on Networked systems for developing regions (2008)

In TDMA-based point-to-multipoint rural wireless deployments, co-located base station radios and sector antennas are used to increase base station capacity. To achieve maximum capacity with limited availability of non-overlapping wireless channels, we need to operate as many radios as possible from different sectors on the same channel. However, operating co-located radios on the same channel can result in substantial interference especially with the current practice of operating all radios at maximum power. We investigate techniques that increase network throughput by eliminating this interference. To this end we formulate an LP optimization problem that maximizes throughput by computing optimal transmit schedules, optimal allocation of clients to base station radios, and optimal radio power levels. Our results suggest that there is a large gap between currently-used and optimal strategies, creating opportunities for simple, practical algorithms to address these issues. Our techniques are equally applicable to both WiFi based networks as well as other point-to-multipoint technologies such as WiMax.
A Bee Colony Optimization Algorithm for Traveling Salesman Problem
Authors: Li-Pei Wong, Malcolm Yoke Hean Low, Chin Soon Chong
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

A Bee Colony Optimization (BCO) algorithm for Traveling Salesman Problem (TSP) is presented in this paper. TSP is a problem of finding a shortest closed tour which visits all the cities in a given set. The BCO model is constructed algorithmically based on the collective intelligence shown in bee foraging behaviour. This method uses a natural metaphor in making it as a optimization algorithm. Bees of an artificial colony are able to construct consecutively feasible tours by using information expressed in waggle dances. Experimental results comparing the proposed BCO model with some existing approaches on a set of benchmark problems are presented.
Acrylic improper colorings of graphs
Authors: P. Boiron, E. Sopena, L. Vignal
Venue: Journal of Graph Theory (1999)

In this article, we introduce the new notion of acyclic improper colorings of graphs. An improper coloring of a graph is a vertex-coloring in which adjacent vertices are allowed to have the same color, but each color class Vi satisfies some condition depending on i. Such a coloring is acyclic if there are no alternating 2-colored cycles. We prove that every outerplanar graph can be acyclically 2-colored in such a way that each monochromatic subgraph has degree at most five and that this result is best possible. For planar graphs, we prove some negative results and state some open problems. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 32: 97&ndash;107, 1999
On the rules of low-power design (and how to break them)
Authors: Todd M. Austin
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

Energy and power constraints have emerged as one of the greatest lingering challenges to progress in the computing industry. In this talk, I will highlight some of the "rules" of low-power design and show how they bind the creativity and productivity of architects and designers. I believe the best way to deal with these rules is to disregard them, through innovative design solutions that abandon traditional design methodologies. Releasing oneself from these ties is not as hard as one might think. To support my case, I will highlight two rule-breaking design trends from my work and the work of others. The first trend combines low-power designs with resiliency mechanisms to craft highly introspective and efficient systems. The second trend embraces subthreshold voltage design, which holds great promise for highly energy efficient systems.
Optimizing Clinical Processes with Position-Sensing
Authors: Vladimir Stantchev, Trung Dang Hoang, Tino Schulz, Ilja Ratchinski
Venue: IT Professional (2008)

The authors propose an optimization of clinical processes with position- sensing technologies and evaluate existing solutions and their applicability.
Reeb spaces of piecewise linear mappings
Authors: Herbert Edelsbrunner, John Harer, Amit K. Patel
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

Generalizing the concept of a Reeb graph, the Reeb space of a multivariate continuous mapping identifies points of the domain that belong to a common component of the preimage of a point in the range. We study the local and global structure of this space for generic, piecewise linear mappings on a combinatorial manifold.
A 42-Gb/s Decision Circuit in 0.13µm CMOS
Authors: Bangli Liang, Tad Kwasniewski, Dianyong Chen
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

In this paper, a decision circuit based on 0.13 µmCMOS is presented. It is designed for 40-Gb/s optical communication systems. This decision circuit achieved by master-slave flip-flops (MS-FFs) with opposite clock can operate at a bit rate of 40-Gb/s and beyond. Current-mode logic (CML) is adopted due to the higher speed compared to static CMOS and the robustness against common-mode disturbances. A 3-stage output buffer is employed to drive the external 50 Ω loads. On-chip shunt peaking (SP) inductors and split-resistor (SR) loads are used to boost the bandwidth. The decision circuit uses a single 1.2V supply and consumes a total current of 33 mA. And the chip area is only 0.63 mm^2 with bonding pads.
An automatic protocol verification framework for the development of wireless sensor networks
Authors: Taehyun Kim, Jaeho Kim, Sangshin Lee, Ilyeup Ahn, Minan Song, Kwangho Won
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

In recent years, there are many active researches on Wireless Sensor Networks (WSNs) as a way to collect diverse context information around the world. A lot of new WSN protocols have been proposed and implemented for the various application fields such as military, environmental, habitat monitoring, health, home and office, and other applications. When we compose a WSN protocol stack using several layers which have been designed and implemented individually, some uncertain protocol layer modules with malfunctions may cause the serious faults of their own or entire WSNs. Therefore, it is very important to verify functions and interoperability of each layer as well as to make well-defined protocol specifications. In this paper, we propose an automatic protocol verification framework for WSNs. The proposed framework consists of a test procedure description language written in XML and a test harness which executes test procedures. We have implemented the proposed framework and used it to verify some of our own WSN protocol layers. And our test framework has performed nicely. Therefore, we think that this framework would make it possible for WSN protocol developers to verify protocols easily.
Field-effect transistors with thin ZnO as active layer for gas sensor applications
Authors: F. V. Farmakis, Th. Speliotis, K. P. Alexandrou, C. Tsamis, M. Kompitsas, I. Fasaki, P. Jedrasik, G. Petersson, B. Nilsson
Venue: Microelectronic Engineering (2008)

Zinc oxide based field-effect devices prepared for gas sensing applications are studied. For this purpose, bottom-gate transistors were fabricated using Pd as source and drain interdigitated electrodes with gate lengths varying from 0.3 to 2@mm. Thin (50nm) zinc oxide films were grown with the aid of pulsed laser deposition (PLD) at room temperature and served as active and sensing layer. AFM and XRD analysis demonstrated the polycrystalline nature of the c-axis oriented ZnO films with nanoscale grain size (20-40nm) with relatively high average roughness. Electrical and gas sensing measurements from the above-mentioned devices are presented.
Third international workshop on graph and model transformations
Authors: Gabor Karsai, Gabriele Taentzer
Venue: Companion of the 30th international conference on Software engineering (2008)

Model transformation is an emerging paradigm used in model-driven software development. Graph transformations deal with rewriting operations on graphs, and as such can serve as a foundation for constructing model transformation language, tools, and systems. This workshop, the 3rd in a series, investigates the connection between graph and model transformations and intends to bring together interested researchers and practitioners from the two fields.
Efficiently answering reachability queries on very large directed graphs
Authors: Ruoming Jin, Yang Xiang, Ning Ruan, Haixun Wang
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Efficiently processing queries against very large graphs is an important research topic largely driven by emerging real world applications, as diverse as XML databases, GIS, web mining, social network analysis, ontologies, and bioinformatics. In particular, graph reachability has attracted a lot of research attention as reachability queries are not only common on graph databases, but they also serve as fundamental operations for many other graph queries. The main idea behind answering reachability queries in graphs is to build indices based on reachability labels. Essentially, each vertex in the graph is assigned with certain labels such that the reachability between any two vertices can be determined by their labels. Several approaches have been proposed for building these reachability labels; among them are interval labeling (tree cover) and 2-hop labeling. However, due to the large number of vertices in many real world graphs (some graphs can easily contain millions of vertices), the computational cost and (index) size of the labels using existing methods would prove too expensive to be practical. In this paper, we introduce a novel graph structure, referred to as path-tree, to help labeling very large graphs. The path-tree cover is a spanning subgraph of G in a tree shape. We demonstrate both analytically and empirically the effectiveness of our new approaches.
Network Security Situation Assessment Based on Data Fusion
Authors: Liu Mixia, Zhang Qiuyu, Zhao Hong, Yu Dongmei
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Network security situation assessment can project the next behavior of the network by describing the current state. Security events from IDS, firewall, and other security tools are currently growing at a rapid pace. However, most intrusion event researches focus on IDS alerts, overlooking other intrusion evidence from other security tools, or they make simple integration of various security tools not inflecting the whole network state. In this paper, we described network security from the view of system. First, network situation elements are analyzed. Second, we research their correlations and present system architecture of network security situation. Third, multi-sensor correlation algorithms are analyzed that Colored Petri net is used for describing the changing of system state after arrival of new events and D-S Theory of Evidence is used for combining the different evidence. Then, we report the experimental results on the DARPA 2000 DDoS attack scenarios and analyze them. At last, we conclude our work and present next research goal.
Hardwired Networks on Chip in FPGAs to Unify Functional and Con?guration Interconnects
Authors: Kees Goossens, Martijn Bennebroek, Jae Young Hur, Muhammad Aqeel Wahlah
Venue: Proceedings of the Second ACM/IEEE International Symposium on Networks-on-Chip (2008)

We propose that networks on chip (NOC) are hardwired in Field-Programmable Gate Arrays (FPGA). Although some area of the FPGA then has a fixed function, this loss of flexibility is outweighed by the following benefits. First, implementation cost is much reduced. Second, a hardwired NOC solves physical problems such as timing closure and high cost of global wiring. Third, dynamic partial reconfiguration can be better exploited. Compared to current soft or firm interconnects, a hardwired NOC poses fewer restrictions on the(re)placement of IP blocks in the FPGA. Finally, we also propose that the hardwired NOC is used for both the functional interconnect between the IP blocks and the configuration interconnect that transports the bitstreams. We give a detailed overview of our NOC architecture, and its configuration and programming. The proposed scheme enhances the on-line generation of bitstreams and the on-line verification of loaded bitstreams to detect tampering with the device. In our experiment, a hardwired NOC has acceptable (≤ 10%) overhead for IP sizes with approximately 1400 lookup tables (LUT), enabling a fine-grained combined functional and configuration interconnect. A hardwired NOC offers significantly better functional performance than a soft NOC. Moreover, the configuration and programming of the hard NoC is much faster than when using a soft NOC.
Distributed adaptive sampling using bounded-errors
Authors: Kévin Huguenin, M. João Rendas
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

This paper presents a communication/coordination/ processing architecture for distributed adaptive observation of a spatial field using a fleet of autonomous mobile sensors. One of the key difficulties in this context is to design scalable algorithms for incremental fusion of information across platforms robust to what is known as the "rumor problem". Incremental fusion is in general based on a Bayesian approach, and algorithms (e.g. the Covariance Intersection, CI) which propagate consistent characterizations of the estimation error under this challenging situation have been proposed. In this paper, we propose to base inter-sensor fusion on a deterministic approach which considers that bounds to the observation errors are known, wich is intrinsically robust to the rumor problem. We present the equations that enable the determination of the ellipsoidal domain of uncertainty that covers the intersection of the individual sets describing sensor's uncertainty, and show that they solve some pathologies associated to CI. The results presented corroborate a previous claim of the robustness of our control strategy (the criterion used for adaptively choosing the nodes positions) with respect to the conservativeness of fusion methods able to handle rumor.
The future of end user programming?
Authors: Sam S. Adams
Venue: Companion of the 30th international conference on Software engineering (2008)

One of the Holy Grails of Computer Science for many decades has been to make the power of computer programming accessible to more and more people. The earliest "high level" languages, FORTRAN and COBOL, were intentionally designed to be written and understood by specific communities of users with problems to solve, namely the Scientific/Engineering and Business communities. As computing became more accessible to more people, the number of dedicated full time programmers mushroomed and formed a community unto itself, who largely created languages and tools by and for themselves to use. The end users, the people with the non-computing problems to solve, became isolated from the computer itself and were forced have their business problems encoded in the increasingly esoteric script of a powerful new programmer priesthood. But even throughout these "dark ages", a small number of valiant dissenters survived and flourished in distant monasteries and hermitages, dedicating their lives and technical prowess to liberate computing from its raised floor temples. Resistance was stiff, but not futile, as every decade or so breakthroughs like spreadsheets, Hypercard, 4GLs and HTML empowered more and more "non-programmers" to create their own computing solutions. Now, well into the second era of the Web, consumer-oriented websites like Flickr and YouTube routinely offer end users "snippets" of JavaScript code to reuse in their own software creations, their Facebook and MySpace pages. Projects like IBM's CoScripter have achieved programming by demonstration for end users. Mashup tools abound, and the Web is filled with billions of customized applications, most created by end users themselves. Have we finally achieved the goals of those happy few who dreamed of a world where programming was as common as dialing a telephone? Have we finally arrived at the Long Tail of Programming? And if we have built it, did they come? This talk will assess the current state of end user programming and present a heretical perspective about the future of this endeavor from a confessed true believer.