ppxscal/embedding_network huggingface dataset:
Polylogarithmic network navigability using compact metrics with small stretch
Authors: Pierre Fraigniaud, Cyril Gavoille
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

Graph augmentation theory is a general framework for analyzing navigability in social networks. It is known that, for large classes of graphs, there exist augmentations of these graphs such that greedy routing according to the shortest path metric performs in polylogarithmic expected number of steps. However, it is also known that there are classes of graphs for which no augmentations can enable greedy routing according to the shortest path metric to perform better than Ω(n1/√log n) expected number of steps. In fact, the best known universal bound on the greedy diameter of arbitrary graph is essentially n1/3. That is, for any graph, there is an augmentation such that greedy routing according to the shortest path metric performs in Õ(n1/3) expected number of steps. Hence, greedy routing according to the shortest path metric has at least two drawbacks. First, it is in general space-consuming to encode locally the shortest path distances to all the other nodes, and, second, greedy routing according to the shortest path metric performs poorly in some graphs. We prove that, using semimetrics of small stretch results in a huge positive impact, in both encoding space and efficiency of greedy routing. More precisely, we show that, for any connected n-node graph G and any integer k ≥ 1, there exist an augmentation φ of G and a semimetric μ on G with stretch 2/k-1 such that greedy routing according to μ performs in O(k2 n2/klog2n) expected number of steps. As a corollary, we get that for any connected n-node graph G, there exist an augmentation φ of G and a semimetric μ on G with stretch O(log n) such that greedy routing according to μ performs in polylogarithmic expected number of steps. This latter semimetric can be encoded locally at every node using only a polylogarithmic number of bits.
The revenge of the page
Authors: David A. Kolb
Venue: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia (2008)

Writers of literary hypertext have urged complexly linked hypertext forms. Some writers have applied this to expository and argumentative hypertext, taking advantage of hypertext's ability to expand the "margins" of a document in new directions. Where argumentative issues or contexts are complex and self-reflexive enough, these writers urge that hypertexts become complex multi-dimensional expository and argumentative texts with elaborate rhetorical and argumentative structures that take place over sequences of links. However this ideal is challenged by developments on the Web, where argumentative hypertexts are dominated by a linked mini-essay style that uses one-step link patterns for its rhetorical moves. Was the ideal of complex hypertext rhetorical structures mistaken? This essay analyzes the situation, argues for the viability of more complex hypertexts, suggests some causes for the dominance of the single page and single-step rhetorical move, and looks at some developments that may challenge this dominance.
Manageable fine-grained information flow
Authors: Petros Efstathopoulos, Eddie Kohler
Venue: ACM SIGOPS Operating Systems Review (2008)

The continuing frequency and seriousness of security incidents underline the critical importance of application security. Decentralized information flow control (DIFC), a promising tool for improving application security, gives application developers fine-grained control over security policy and privilege management. DIFC developers can partition much application functionality into untrusted components bound by a kernel- or language-enforced security policy. Unless a (usually smaller and less exposed) trusted component is exploited, the effects of an application compromise are contained by the policy. Although system-based DIFC can simultaneously achieve high performance and effective isolation, it offers a challenging programming model. Fine-grained policy specifications are spread over several application pieces. Common programming errors may be indistinguishable from policy exploit attempts, the system cannot expose developers to information about these errors, complicating debugging. Static checking (as in language based systems) and new system primitives can reduce these problems, but for dynamic applications like web servers, they do not eliminate them. In this paper we propose subsystems that make decentralized information flow more manageable. First, a policy description language specifies an application-wide security policy in one localized place; communication restrictions are compiled into lower-level labels. Second, information flow-safe debugging mechanisms let developers debug DIFC applications without violating security policies. Although these mechanisms are preliminary, we demonstrate their effectiveness using applications similar to those developed for Asbestos and other DIFC systems.
Large-scale hot embossing
Authors: M. Worgull, M. Heckele, W. K. Schomburg
Venue: Microsystem Technologies (2005)

The hot embossing process is a flexible molding technique to produce delicate microstructures with high aspect ratios on thin layers. Large-scale hot embossing is one effective way to meet future requirements and produce high-quality microstructures at low costs. For this, however, principal changes of the molding process and molding tool design will be required. In the present paper, constructive solutions for large-scale hot embossing shall be described. Based on a simulation of the hot embossing process, solutions shall be presented that are aimed at reducing shrinkage of the molded parts and demolding forces and, hence, at avoiding damages of microstructures during demolding.
Geographic IR and visualization in time and space
Authors: Ray R. Larson
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

This demonstration will show how graphical geospatial query specifications can be used to obtain sets of georeferenced data ranked by probability of relevance, and displayed geographically and temporally in a geospatial browser with temporal support.
Towards a DNA sequencing theory (learning a string)
Authors: M. Li
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

Mathematical frameworks suitable for massive automated DNA sequencing and for analyzing DNA sequencing algorithms are studied under plausible assumptions. The DNA sequencing problem is modeled as learning a superstring from its randomly drawn substrings. Under certain restrictions, this may be viewed as learning a superstring in L.G. Valiant's (1984) learning model, and in this case the author gives an efficient algorithm for learning a superstring and a quantitative bound on how many samples suffice. A major obstacle to the approach turns out to be a quite well-known open question on how to approximate the shortest common superstring of a set of strings. The author presents the first provably good algorithm that approximates the shortest superstring of length n by a superstring of length O(n log n).
Concrete and abstract terms processing in the human brain
Authors: Aleš Grmela, Nikos Mastorakis
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

The human brain has ability to process information. The whole body also has ability of processing information. But the Human Brain was developed especially for this purpose.
The Erdõs-Sós Conjecture for trees of diameter four
Authors: Andrew McLennan
Venue: Journal of Graph Theory (2005)

The Erd&otilde;s-S&oacute;s Conjecture is that a finite graph G with average degree greater than k - 2 contains every tree with k vertices. Theorem 1 is a special case: every k-vertex tree of diameter four can be embedded in G. A more technical result, Theorem 2, is obtained by extending the main ideas in the proof of Theorem 1. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory 49: 291301, 2005
Remote monitoring of spatial and temporal surface soil moisture in fire disturbed boreal forest ecosystems with ERS SAR imagery
Authors: L. L. Bourgeau-Chavez, E. S. Kasischke, K. Riordan, S. Brunzell, M. Nolan, E. Hyer, J. Slawski, M. Medvecz, T. Walters, S. Ames
Venue: International Journal of Remote Sensing (2007)

Due to the large volume of carbon currently stored in boreal regions and the high frequency of wildfire, the prospects of a warming climate would have important implications for the ecology of boreal forests which in turn would have significant feedbacks for carbon cycling, fire frequency, and global climate change. Since ecological studies and climate change models require routine information on surface soil moisture, the ability to remotely sense this variable is highly desirable. Toward this end research was conducted on developing methods for the retrieval of spatially and temporally varying patterns of soil moisture from recently burned boreal forest ecosystems of Alaska using C-band satellite radar data. To do this we focused on both individual date and temporal SAR datasets to develop techniques and algorithms which indicate how moisture varies across a recently burned boreal forest. For each of the methods developed we focused on reducing errors of SAR-derived soil moisture estimates due to confounding factors of variations in vegetative biomass and surface roughness. For the individual date soil moisture monitoring, we grouped test sites by a measurable biophysical variable, burn severity, and then developed algorithms relating moisture to SAR backscatter for each burn severity group. The algorithms developed had high coefficients of determination (0.56-0.82) and the moisture maps produced had high accuracy (3.61 rms error) based on the minimal validation conducted. For the seasonal soil moisture mapping we used principal component analysis to capture the time-variant feature of soil moisture and minimize the relatively time-invariant features that confound SAR backscatter. This resulted in good agreement between the drainage maps produced and our limited in situ observations and weather data. However, further validation, with larger sample sizes, is needed. While this study focuses on Alaska, research indicates that the techniques developed should be applicable to boreal forests worldwide.
Increasing minimum operating voltage (VDDmin) with number of CMOS logic gates and experimental verification with up to 1Mega-stage ring oscillators
Authors: Taro Niiyama, Zhe Piao, Koichi Ishida, Masami Murakata, Makoto Takamiya, Takayasu Sakurai
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

In order to explore the feasibility of the large scale subthreshold logic circuits and to clarify the lower limit of supply voltage (VDD) for logic circuits, the dependence of minimum operating voltage (VDDmin) of CMOS logic gates on the number of stages, gate types and gate width is systematically measured with 90-nm CMOS ring oscillators (RO's). The measured average VDDmin of inverter RO's increased from 90 mV to 343 mV when the number of RO stages increased from 11 to 1Mega, which indicates the difficulty of the VDD scaling in the large scale subthreshold logic circuits. The dependence of VDDmin on the number of stages is calculated with the subthreshold current model with random threshold voltage (VTH) variations and compared with the measured results, which confirm the tendency of the measurement.
The successful deployment of inventory and forecasting management system (INFORMS) in Telekom Malaysia (TM)
Authors: Mohd Izhan Mohd Yusoff, Faizin Abu Bakar, Noor Azhari Md Yusof, Shahlan Kardi, Norazrina Abu Haris
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

An inventory and forecasting management system helps telecommunication companies to manage fixed line products and infrastructure located through out nation. Telekom Research & Development (TMR&D) was given the responsibility by Product Marketing, TM Retail, TM, to make it happen. This paper will highlight the successful deployment of the system called INFORMS.
Energy-Aware Middleware
Authors: Luigia Petre
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

Computer networks have become a critical part of our society as we, as users, need our networked world to function continually and at full capacity. One of the basic and often overlooked factors required for such qualities is that of energy. Energy consumption is a non-functional property that needs to be addressed by a network manager, at the more specialized level of middleware. In this paper we model resource energy using a middleware language called MIDAS. This language is resource-centric and based on a formal framework for location-aware computing. By taking a device energy into consideration we reach a new approach regarding the resource locations. We distinguish between two networks types and further distinguish software resources from hardware devices. We obtain a unitary approach of considering co-located resources that can be exploited for efficiency in context-oriented applications. Hence, better availability and reliability of the energy-aware MIDAS resources can be ensured.
Solving systems of linear equations and finding the inversion of a matrix by neural network using genetic algorithms (NN using GA)
Authors: Z. Ghassabi, B. Moaveni, A. Khaki-Sedigh
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

In this paper, we propose a one-layered neural network that recovers its input variables by genetic algorithms to solve the systems of linear equations (or, equivalently, matrix inversion). First we described solving systems of linear equations (matrix inversion) by mentioned neural network. Then, experimental results are presented to show the effectiveness of the approach. Finally, future avenue of this research is proposed.
Stability of the difference type methods for linear Volterra equations in Hilbert spaces
Authors: Xu Da
Venue: Numerische Mathematik (2008)

We study the stability of backward difference timestepping method for linear Volterra equations of scalar type in a Hilbert space framework. The results and methods extend and simulate numerically those introduced by Pr&#x00fc;ss for integrability with respect to continuous solutions.
From e-learning to m-learning: a new bet and a new challenge for the educational context?!...
Authors: Henrique Teixeira Gil
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

The appearance of new technological devices always brought new hopes for their use on education in order to promote innovation and more quality on the process of teaching and learning. Nowadays m-learning may be considered the last one!... And what about e-learning? Should try the last novelty and forget the &Lt;old and recent&Gt; e-learning platforms? The article tries to present the main characteristics and potential of m-learning and e-learning for their use in education. A critical and reflective approach is done to promote further discussion among teachers to understand the use of m-learning and/or e-learning with their students. A technological description is contrasted with the pedagogical approach because what is really important is the way the technological devices are incorporated within a pedagogical paradigm. The inclusion of m-learning within education may important because of its &Lt;contextual&Gt; approach very close to the students and their environment that may transform this technological possibility much more &Lt;familiar&Gt; in comparison with the other. But there are not a solution, the solution... teachers and students must understand when, where and why &Lt;the choice&Gt; must be done. This article aims to promote a discussion about the potential and possible use of m-learning in education.
Minimum Shield Insertion on Full-Chip RLC Crosstalk Budgeting Routing
Authors: Peng-Yang Hung, Ying-Shu Lou, Yih-Lang Li
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

This work presents a full-chip RLC crosstalk budgeting routing flow to generate a high-quality routing design under stringent crosstalk constraints. Based on the cost function addressing the sensitive nets in visited global cells for each net, global routing can lower routing congestion as well as coupling effect. Crosstalk-driven track routing minimizes capacitive coupling effects, and decreases inductive coupling effects by avoiding placing sensitive nets on adjacent tracks. To achieve inductive crosstalk budgeting optimization, the shield insertion problem can be solved with a minimum column covering algorithm, which is undertaken following track routing to process nets with an excess of inductive crosstalk. The proposed routing flow method can identify the required number of shields more accurately, and process more complex routing problems, than the linear programming (LP) methods. Results of this study demonstrate that the proposed approach can effectively and quickly lower inductive crosstalk by up to one-third.
Consistence preserving model merge in collaborative development processes
Authors: Christian Bartelt
Venue: Proceedings of the 2008 international workshop on Comparison and versioning of software models (2008)

Specification by models plays a decisive role, during the development process of complex systems. The division and concurrency of labor in teams is a further characteristic of such development. Therefore an efficient configuration and variant management of resulting documents is essential. In practice, a lot of established configuration management systems like CVS and Subversion are available which provide a text based merge. Unfortunately these systems are inappropriate for the management of models because they ignore the syntactic and semantic structure which is specified by the associated meta-models. Especially during the merge of model versions the mentioned systems fails at the generation of a meta-model consistent model. In this paper a proposal is presented which is enabled to merge model versions in a model based, collaborative development process. Furthermore meta-model independent methods for consistent-receiving model merging are explained.
The Multi-Tree Approach To Reliability In Distributed Networks
Authors: A. Itai
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

Consider a network of asynchronous processors communicating by sending messages over unreliable lines. There are many advantages to restrict all communications to a spanning tree. To overcome the possible failure of k<k edges, we describe a communication protocol which uses k rooted spanning trees having the property that for every vertex v the paths from v to the root are edge-disjoint. A linear algorithm to find two such trees in a 2 edge-connected graph is described. This algorithm has a distributed version which finds the two trees even when a single edge fails during their construction. Finally, a method is given to transform centralized algorithms to distributed, reliable and efficient ones.
Slicing for model reduction in adaptive embedded systems development
Authors: Ina Schaefer, Arnd Poetzsch-Heffter
Venue: Proceedings of the 2008 international workshop on Software engineering for adaptive and self-managing systems (2008)

Model-based development of adaptive embedded systems is an approach to deal with the increased complexity that adaptation requirements impose on system design. Integrating formal verification techniques into this design process provides means to rigorously prove critical properties. However, most automatic verification techniques such as model checking are only effectively applicable to systems of limited sizes due to the state-explosion problem. Our approach to alleviate this problem consists of (a) a semantics-based integration of model-based development and formal verification for adaptive embedded systems and (b) an automatic slicing technique of models with respect to properties to be verified. Slicing is carried out on a high-level formal intermediate representation of the models providing a clear separation of functional and adaptation behaviour. The internal model structure can be exploited to identify system parts that are irrelevant for a property. In particular, slicing offers efficient model reductions for the verification of properties of the adaptation behaviour. The overall approach and the slicing techniques have been evaluated together with the development of an adaptive vehicle stability control system.
Dynamic Web Services on a Home Service Platform
Authors: André Bottaro, Eric Simon, Stéphane Seyvoz, Anne Gérodolle
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

The Home Network is a pervasive environment by nature. Its openness to dynamic distributed and heterogeneous devices brings great challenges in home application design. We present here an open architecture for home service development. Distribution and heterogeneity are managed by service-oriented drivers leveraging the “service platform” concept. Our project provides an open source driver combining Web Services and OSGi standards to compose home services. Performance test results illustrate the service-oriented design.
Control of a robot based on intelligent systems
Authors: Pedro Ponce, Ricardo Fernandez, Eduardo Azcue, Jose Silva, Juan Silva
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

In this work a novel neuro-fuzzy controller was designed and implemented using an artificial six-legged arthropod (hexapod). The core of the controller is based on both artificial neural networks based on trigonometric series and fuzzy clusters. A new scheme was optimised and the performance of the hexapod was adequate. The implementation was done by a Motorola microcontroller. Programming the controller law into a Motorola microcontroller gave flexibility to the platform proposed. Simulation and experimental results are included to validate the theory presented in this paper.
Local absorbing boundary conditions for elliptical shaped boundaries
Authors: M. Medvinsky, E. Turkel, U. Hetmaniuk
Venue: Journal of Computational Physics (2008)

We compare several local absorbing boundary conditions for solving the Helmholtz equation, by a finite difference or finite element method, exterior to a general scatterer. These boundary conditions are imposed on an artificial elliptical or prolate spheroid outer surface. In order to compare the computational solution with an analytical solution, we consider, as an example, scattering about an ellipse. We solve the Helmholtz equation with both finite differences and finite elements. We also introduce a new boundary condition for an ellipse based on a modal expansion.
Antireflective nanostructured microlenses
Authors: Birgit Päivänranta, Pierre-Yves Baroni, Toralf Scharf, Wataru Nakagawa, Markku Kuittinen, Hans Peter Herzig
Venue: Microelectronic Engineering (2008)

Herein, a study of combining refractive microlenses arrays and nanostructured antireflective surfaces is presented. Fabrication method is surveyed for obtaining the hybrid surface with functionalities of refractive and antireflective (high-transmissive) element. A standard re-flow method is used for fabricating the microlenses and the subwavelength structure is generated on the curved surfaces by interference lithography. By using an optical fiber detector the increased transmittance over the whole visible spectrum is shown. This kind a hybrid element could have applications in illumination systems, in which the main purpose is to gather light to certain areas.