ppxscal/embedding_network huggingface dataset:
Engineering Autonomic Systems Self-Organisation
Authors: Martin Randles, David Lamb, A. Taleb-Bendiab
Venue: Proceedings of the Fifth IEEE Workshop on Engineering of Autonomic and Autonomous Systems (2008)

For future generations of autonomic systems it is becoming increasingly evident that pre-programmed models of behaviour and communication will be inadequate. The environment, in which the systems and their autonomic components are situated, is most likely to be the real world and so open-ended. It is not possible to foresee all system eventualities or actions, that may be needed to be performed, nor the methods by which novel observations may be detected or communicated. Additionally these systems are going to have to adapt to human requirements and so develop shared conventions of communication between themselves and human users in order to cope with novel meanings and requests from unknown sources. This paper proposes the use of cognitive systems reasoning over models of self-organising emergent behaviour as one method to address this problem. The actions of individual participants in the system form Markov Chains, which allows the autonomic observer systems to gain, or be endowed with, a grounded definition of some emergent behaviour. Furthermore the parameters of the associated Markov Decision Problem can be adjusted to the required outcome. It is further proposed that mathematical logic is the most natural specification medium for these cognitive systems. Thus a dialect of First Order Logic, Situation Calculus, is described with facilities to handle sensing and knowledge and stochastic actions. This is then shown as a specification for a known observed, naturally occurring emergent phenomenon that can be solved as a Markov Decision Problem.
Optimal routing algorithms for rectilinear pin clusters in high-density multichip modules
Authors: Muhammet Mustafa Ozdal, Martin D. F. Wong, Philip S. Honsinger
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2008)

As the circuit densities and transistor counts are increasing, the package routing problem is becoming more and more challenging. In this article, we study an important routing problem encountered in typical high-end MCM designs: routing within dense pin clusters. Pin clusters are often formed by pins that belong to the same functional unit or the same data bus, and can become bottlenecks in terms of overall routability. Typically, these clusters have irregular shapes, which can be approximated with rectilinear convex boundaries. Since such boundaries have often irregular shapes, a traditional escape routing algorithm may give unroutable solutions. In this article, we study how the positions of escape terminals on a convex boundary affect the overall routability. For this purpose, we propose a set of necessary and sufficient conditions to model routability outside a rectilinear convex boundary. Given an escape routing solution, we propose an optimal algorithm to select the maximal subset of nets that are routable outside the boundary. After that, we focus on an integrated approach to consider routability constraints (outside the boundary) during the actual escape routing algorithm. Here, we propose an optimal algorithm to find the best escape routing solution that satisfies all routability constraints. Our experiments demonstrate that we can reduce the number of layers by 17&percnt; on the average, by using this integrated methodology.
Routing in a cyclic mobispace
Authors: Cong Liu, Jie Wu
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

A key challenge of routing in delay tolerant networks (DTNs) is finding routes that have high delivery rates and low end-to-end delays. When oracles are not available for future connectivity, opportunistic routing is preferred in DTNs, in which messages are forwarded to nodes with higher delivery probabilities. We observe that real objects have repetitive motions, but no prior research work has investigated the cyclic delivery probability of messages between nodes. In this paper, we propose to use the expected minimum delay (EMD) as a new delivery probability metric in DTNs with repetitive but non-deterministic mobility. Specifically, we model the network as a probabilistic time-space graph with historical contact information or prior knowledge about the network. We then translate it into a probabilistic state-space graph in which the time dimension is removed. Finally, we apply the Markov decision process to derive the EMDs of the messages at particular times. Our proposed EMD-based routing protocol, called routing in cyclic MobiSpace (RCM), outperforms several existing opportunistic routing protocols when simulated using both real and synthetic traces.
Flexible Self-Management Using the Model-View-Controller Pattern
Authors: Edward Curry, Paul Grace
Venue: IEEE Software (2008)

Future self-management software systems will need to operate in diverse environments with changing requirements. This necessitates flexible system implementations, easily customizable to target domains and associated requirements. An important part of a self-management infrastructure is the self-representation, which models system functionality concerns, allowing their inspection and adaptation. As the range of self-management capabilities expands, the task of creating appropriate self-representations becomes ever more complex. Future self-representations will need to track greater amounts of system information than ever before, and in a way that's flexible, customizable, and portable between system implementations. Meeting these requirements will require a maturing in the design and construction practices for self-representations. The Model-View-Controller design pattern can improve concern separation in a self-representation. This pattern helps encapsulate state, analysis, and realization operations, improving a self-representation's flexibility, customization, and portability.
A framework for enabling on-demand personalised mobile learning
Authors: Fatma Meawad, Geneen Stubbs
Venue: International Journal of Mobile Learning and Organisation (2008)

This paper discusses MobiGlam, a generic framework for interoperability with existing VLEs that provides a compact and easy to use implementation of learning activities on Java enabled mobile devices. The main objective of this work is to present a solution that encourages institutions to adopt mobile learning as a tool to support the learning process. The current deployment of MobiGlam at the University of Glamorgan has shown that the framework can easily accommodate additional learning activities and host various adaptation techniques to keep up with the evolving requirements of mobile technologies. Students' feedback is reported along with our observations on students' use of the system.
Estimation of the Hyperexponential Density with Applications in Sensor Networks
Authors: Larry N. Singh, G. R. Dattatreya
Venue: International Journal of Distributed Sensor Networks (2007)

This paper solves the problem of estimation of the parameters of a hyperexponential density and presents a practical application of the solution in sensor networks. Two novel algorithms for estimating the parameters of the density are formulated. In the first algorithm, an objective function is constructed as a function of the unknown component means and an estimate of the cumulative distribution function (cdf) of the hyperexponential density. The component means are obtained by minimizing this objective function, using quasi-Newtonian techniques. The mixing probabilities are then computed using these known means and linear least squares analysis. In the second algorithm, an objective function of the unknown component means, mixing probabilities, and an estimate of the cdf is constructed. All the 2M parameters are computed by minimizing this objective function, using quasi-Newtonian techniques. The developed algorithms are also compared to the basic EM algorithm, and their relative advantages over the EM algorithm are discussed. The algorithms developed are computationally efficient and easily implemented, and hence, are suitable for low-power and sensor nodes with limited storage and computational capacity. In particular, we demonstrate how the structure of these algorithms may be exploited to be effectively utilized in practical situations, and are hence ideal for sensor networks.
3-tier dynamically adaptive power-aware motion estimator for h.264/AVC video encoding
Authors: Muhammad Shafique, Lars Bauer, Jörg Henkel
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

The limitation of energy in portable communication/entertainment devices necessitates the reduction of video encoding complexity. The H.264/AVC video coding standard is one of the latest video codecs and features a complex Motion Estimation scheme that accounts for a major part of the encoder energy [2]. We therefore present a power-aware Motion Estimator for H.264 that adapts at run time according to the available energy level. We perform a set of adaptations at different Processing Stages of Motion Estimation. Our results show that in case of CIF videos (typically used in portable devices; but our approach is equally applicable to other video resolutions too), we achieve an average energy reduction of 52 times and 27 times as compared to UMHexagonS [12] and EPZS [14] respectively. This energy saving comes at the cost of an average loss of only 0.39 dB in Peak Signal to Noise Ratio (PSNR: an objective quality measure) and 23% increase in area (synthesized for 90nm technology).
Overview of Object Detection and Image Analysis by Means of Genetic Programming Techniques
Authors: Krzysztof Krawiec, Daniel Howard, Mengjie Zhang
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

This paper reviews the existing work in genetic programming for object detection and image analysis. It shortly introduces the reader into the fundamentals of evolutionary computation and presents the basics of the genetic programming paradigm (GP), providing a rationale for the use of GP within computer vision and pattern recognition, particularly when applied to object detection and image analysis. It reviews the past research on GP for vision, referring to real-world applications where possible. It outlines possible further research directions.
Formal Modelling of Avionics Systems. An Approach Based on Category Theory and the EXPRESS Modelling Language
Authors: Yamine Ait-Ameur, Alexandre Cortier, Rmi Delmas, Virginie Wiels
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

In previous work, we defined a component oriented framework dedicated to the specification of embedded systems in the aeronautics domain. A component is defined as a formal entity with three internal layers together with a collection of models defined in domain-oriented views. A categorical frame- work has been proposed to provide a unified representation of the component calculus as well as the various formal models used for the analysis of the system. In this paper, we present an implementation of this categorical framework using the EXPRESS data modelling language. EXPRESS is used to give an operational representation of the formalization, which is quite different from classical implementations of category theory based approaches.
Woody vegetation increase in Alpine areas: a proposal for a classification and validation scheme
Authors: M. Maggi, C. Estreguil, P. Soille
Venue: International Journal of Remote Sensing (2007)

This paper presents a change detection analysis based on a region growing segmentation approach which combines both spectral and spatial information. The test site is a French Alpine protected area, which like many other mountain areas is characterised by a general increase of forest and woody vegetation due to the abandonment of traditional land use practices. Two Landsat images of the years 1984 and 2000 were used and a classification scheme nomenclature based on four vegetation change classes, implying a gradual modification of land cover, was adopted. The accuracy of the change map was assessed both during two visits on the field and using a bi-temporal aerial photographic coverage. A sampling scheme specifically conceived for change detection products was adopted. Error matrices and accuracy indices to assess commission and omission errors of the change maps were generated. The proposed change detection methodology circumvents limitations which are intrinsic to traditional classification procedures based only on spectral information. On the basis of the accuracy assessment, overall accuracy was 90.1% and the increase of woody vegetation turned out to be the vegetation change class better estimated, with user and producer accuracies of, respectively, 62.3% and 70%. However, confusion between the no change and the other vegetation change classes was noticed, due to standard problems encountered in change studies. Advantages and drawbacks of the use of multitemporal aerial photographs as the validation data set are also discussed.
Semi-automatic ontology construction for visual media web service
Authors: Hayoung Kim, Jaeil Hwang, Bowon Suh, Yunmook Nah, Hyung-Soo Mok
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Ontology is a description of the concepts and relationships that can exist for an agent or a community of agents. Ontologies are a key enabling technology for the Semantic Web. Previously, ontologies have been built manually by knowledge engineers using ontology editors. In this paper, we propose a semiautomatic ontology construction scheme for visual media data brokers and providers. We apply data mining techniques on sets of image data groups to determine general term relationships and utilize WordNet to determine semantic relationships between terms. Even though our research has been started for visual media data retrieval, the proposed scheme can be also applied to other problem domains.
CMOS RF Down-Conversion Mixer Design for Low-Power Wireless Communications
Authors: K. Faitah, A. El Oualkadi, A. Ait Ouahman
Venue: Ubiquity (2008)

This paper aims to study the design of a low-power single-balanced mixer for downconversion in wireless RF receivers. The proposed circuit is designed to work at a radiofrequency of 1.9GHz using CMOS 0.18 µm technology. The obtained results show a conversion gain equal to 7 dB and low power consumption of 3.86mW at 1.8.V supply voltage. The single side band noise figure performance was founded to be 8.dB. These results show a good potential of this CMOS mixer and justify its use for low-power wireless communications.
The Internet, Spatial Data Globalization, and Data Use: The Case of Tibet
Authors: Nathan J. Engler, G. Brent Hall
Venue: The Information Society (2007)

One of the fastest growing forms of downloadable Internet-based data involves digital map layers that contain spatial features suitable for analysis with a geographic information system (GIS). The availability of networked spatial data has fostered tremendous growth in the importance and use of location-based services, and it is now commonplace to find a wide variety of map-based applications and data sets on the Internet for unrestricted download. Despite the rapid growth in spatial data resources, there has been scant attention paid to their currentness, lineage, locational accuracy, completeness, and overall usefulness. This article discusses the quality of Internet spatial data by taking an extreme case to evaluate both the availability and the usefulness of spatial data posted on publicly accessible Web sites. The case study examined is Tibet, which is selected purposively because it lies at or beyond the fringes of the network society. The issue examined concerns the rehabilitation potential of locatable Buddhist monasteries. In undertaking this assessment, the efficacy of the current Internet as a source of useful spatial data is brought into question.
On the effects of feedback in dynamic network protocols
Authors: B. Awerbuch
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

A framework is introduced that provides a unified way for proving correctness as well as analyzing performance of a class of communication protocols called (asynchronous) reset protocols. They are logarithmic transformers, converting protocols working in a static asynchronous network into protocols working in a dynamic asynchronous network. The design of reset protocols is a classical problem in communication networking, renowned for its complexity. A paradigm is developed that gives fresh insight into this complicated problem. This additional insight leads to the development of reset protocols with complexities bounded by the communication complexity of the original protocol.
TSCAN: a novel method for topic summarization and content anatomy
Authors: Chien Chin Chen, Meng Chang Chen
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

A topic is defined as a seminal event or activity along with all directly related events and activities. It is represented as a chronological sequence of documents by different authors published on the Internet. In this paper, we define a task called topic anatomy, which summarizes and associates core parts of a topic graphically so that readers can understand the content easily. The proposed topic anatomy model, called TSCAN, derives the major themes of a topic from the eigenvectors of a temporal block association matrix. Then, the significant events of the themes and their summaries are extracted by examining the constitution of the eigenvectors. Finally, the extracted events are associated through their temporal closeness and context similarity to form the evolution graph of the topic. Experiments based on the official TDT4 corpus demonstrate that the generated evolution graphs comprehensibly describe the storylines of topics. Moreover, in terms of content coverage and consistency, the produced summaries are superior to those of other summarization methods based on human composed reference summaries.
Visual history mechanism on mobile internet browser
Authors: Tan Yoong-En, Daniel Su Kuen Seong
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)

The deprived screen display of mobile devices made it difficult to present a large amount of data. Keeping track of the text-based history list is even more challenging as users need to spend a lot of effort to locate a previously visited page. This paper proposed Visual History mechanism with a user-marking mechanism to assist users in navigating through the history list. The Visual History mechanism loads screen capture of the webpages and appends it as a thumbnail for the corresponding history list entry. The visual cues are deemed to be able to assist users in recalling the contents of the visited webpage. The user-marking mechanism allows users to denote a useful webpage for future references. A filter is applied to view only marked pages to speed up the searching process and time. Research results of the user evaluation demonstrated that there was a statistical significant difference between text-based and visually enhanced history mechanisms. Overall, there were 95.45% of the test subjects preferred the Visual History mechanism as compared to Opera Mini, a text-based history mechanism. Conclusively, the visually enhanced Visual History mechanism significantly augments users' performance and satisfaction when browsing mobile Internet portals.
Power-Aware Code Restructuring for Embedded Parallel Storing Device
Authors: Xie Bin, Shi Qingsong, Tong Liangliang, Huang Jiangwei, Wu Xinliang, Chen Tianzhou
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

In order to cope with the energy challenge emerging with the process of parallelism in embedded storing device, this paper focuses on the static code restructuring of nested loop array accessing related to storing device. Departing the running time of different devices can extend the duration time when it is in low-power state. Experiment shows that power-aware code restructuring can effectively reduce state switching times and extra power wasted. Static method described in this paper can achieve up to 12% power reduction if it cooperates with proper dynamic method.
Measuring the quality of life in city of Indianapolis by integration of remote sensing and census data
Authors: G. Li, Q. Weng
Venue: International Journal of Remote Sensing (2007)

This paper develops a methodology for integration of remote sensing and census data within a GIS framework to assess the quality of life in Indianapolis, Indiana, United States. Environmental variables, i.e. greenness, impervious surface and temperature, were derived from a Landsat ETM+ image. Socio-economic variables, including population density, income, poverty, employment rate, education level and house characteristics from US census 2000, were integrated with the environmental variables at the block group level to derive indicators of quality of life. Pearson's correlation was computed to analyse the relationships among the variables. Further, factor analysis was conducted to extract unique information from the combined dataset. Three factors were identified and interpreted as material welfare, environmental conditions and crowdedness respectively. Each factor was viewed as a unique aspect of the quality of life. A synthetic index of the urban quality of life was created and mapped based on weighted factor scores of the three factors. Finally, regression models were built to estimate the quality of life in the city of Indianapolis based on selected environmental and socioeconomic variables.
Games for exchanging information
Authors: Gillat Kol, Moni Naor
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We consider the rational versions of two of the classical problems in foundations of cryptography: secret sharing and multiparty computation, suggested by Halpern and Teague (STOC 2004). Our goal is to design games and fair strategies that encourage rational participants to exchange information about their inputs for their mutual benefit, when the only mean of communication is a broadcast channel. We show that protocols for the above information exchanging tasks, where players' values come from a bounded domain, cannot satisfy some of the most desirable properties. In contrast, we provide a rational secret sharing scheme with simultaneous broadcast channel in which shares are taken from an unbounded domain, but have finite (and polynomial sized) expectation. Previous schemes (mostly cryptographic) have required computational assumptions, making them inexact and susceptible to backward induction, or used stronger communication channels. Our scheme is non-cryptographic, immune to backward induction, and satisfies a stronger rationality concept (strict Nash equilibrium). We show that our solution can also be used to construct an ε-Nash equilibrium secret sharing scheme for the case of a non-simultaneous broadcast channel.