ppxscal/embedding_network huggingface dataset:
Autonomous DVFS on Supply Islands for Energy-Constrained NoC Communication
Authors: Liang Guang, Ethiopia Nigussie, Lauri Koskinen, Hannu Tenhunen
Venue: Proceedings of the 22nd International Conference on Architecture of Computing Systems (2009)

An autonomous-DVFS-enabled supply island architecture on network-on-chip platforms is proposed. This architecture exploits the temporal and spatial network traffic variations in minimizing the communication energy while constraining the latency and supply management overhead. Each island is equipped with autonomous DVFS mechanism, which traces the local and nearby network conditions. In quantitative simulations with various types of representative traffic patterns, this approach achieves greater energy efficiency than two other low-energy architectures (typically 10% - 27% lower energy). With autonomous supply management on a proper granularity as demonstrated in this study, the communication energy can be minimized in a scalable manner for many-core NoCs.
An Analysis for Fault-Tolerant 3D Processor Arrays Using 1.5-Track Switches
Authors: Tadayoshi Horita, Yuuji Katou, Itsuo Takanami
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper deals with redundant 3D mesh processor arrays using 1.5-track switches, considering track and switch faults together with processor faults. Four variants are defined based on the distributions of spare PEs, and arrays of three variants have the same PE redundancies among them, but the fabrication-time costs are different. We investigate in detail how the reliability of a total system changes according to the reliabilities of tracks and switches as well as PEs, and show the concrete values of Mt and Ms, when the reliability of array are almost the same even if its variant is changed, and when it is not so, respectively, where Mt and Ms are the ratio of the hardware complexities of a PE and a track, and that of a PE and a contact point of a switch, respectively. Other results which are effective basis for the design of fault-tolerant 3D PE arrays using 1.5-TSs are given.
Maximum vertex occupation time and inert fugitive: Recontamination does help
Authors: Dariusz Dereniowski
Venue: Information Processing Letters (2009)

Given a simple graph G, we consider the node search problem with inert fugitive. We are interested in minimizing the maximum vertex occupation time, i.e. the maximum number of steps in which a vertex is occupied by a searcher during a search of G. We prove that a search program which does not allow a recontamination may not find an optimal solution to this problem. Moreover, the difference between the minimum maximum vertex occupation time computed by a monotone search program and a program without such a restriction may be arbitrarily large.
A Multiagent-System Framework for Hierarchical Control and Monitoring of Complex Process Control Systems
Authors: Vu Tan, Dae-Seung Yoo, Myeong-Jae Yi
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

This paper proposes a framework for the implementation of multiagent system for hierarchical control of complex process control systems based on OPC technology that is widely applied to the automation control systems. This framework is proposed with utilization of OPC technology in both continuous-event part and discrete-event part by incorporating with XML for the negotiation and cooperation in the environments of multiagent system. The framework design criteria are also described. The comparison of the proposed framework with existing frameworks is made to demonstrate that the proposal is reliable and feasible in order to apply to agent-based process control applications.
High-performance information extraction with AliBaba
Authors: Peter Palaga, Long Nguyen, Ulf Leser, Jörg Hakenberg
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

A wealth of information is available only in web pages, patents, publications etc. Extracting information from such sources is challenging, both due to the typically complex language processing steps required and to the potentially large number of texts that need to be analyzed. Furthermore, integrating extracted data with other sources of knowledge often is mandatory for subsequent analysis. In this demo, we present the AliBaba system for scalable information extraction from biomedical documents. Unlike many other systems, AliBaba performs both entity extraction and relationship extraction and graphically visualizes the resulting network of inter-connected objects. It leverages the PubMed search engine for selection of relevant documents. The technical novelty of AliBaba is twofold: (a) its ability to automatically learn language patterns for relationship extraction without an annotated corpus, and (b) its high performance pattern matching algorithm. We show that a simple yet effective pattern filtering technique improves the runtime of the system drastically without harming its extraction effectiveness. Although AliBaba has been implemented for biomedical texts, its underlying principles should also be applicable in any other domain.
Shan-Shui-Shua (mountain-water painting)
Authors: Christin Bolewski
Venue: ACM SIGGRAPH ASIA 2008 artgallery: emerging technologies (2008)

This ambient "video scroll" presents two poems of the famous poet Han Shan as a reflection on Western mountaineers' fight against nature as they ascend and descend the highest peaks, counterpointing the Chinese attempt to achieve spiritual harmony.
Interference Cancellation and Multipath Mitigation Algorithm for GPS Using Subspace Projection Algorithms
Authors: Jeong Hwan Shin, Jun Heo, Seokho Yoon, Sun Young Kim
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper presents an interference cancellation and multipath mitigation algorithm for use in Global Positioning System (GPS) with an array antenna. It is shown that interference signals and multipath signals are effectively suppressed using a serial subspace projection method without any knowledge of the incoming directional information. After the subspace projections, a beamformer is used to maximize the SNR of the received signal. The enhancement in the performance is presented in terms of the cross correlation value and beam patterns.
`Aware of What?' A Formal Model of Awareness Systems That Extends the Focus-Nimbus Model
Authors: Georgios Metaxas, Panos Markopoulos
Venue: Engineering Interactive Systems: EIS 2007 Joint Working Conferences, EHCI 2007, DSV-IS 2007, HCSE 2007, Salamanca, Spain, March 22-24, 2007. Selected Papers (2008)

We present a formal-model of awareness-systems founded upon the focus and nimbus model of Benford et al [2] and of Rodden [19]. The model aims to provide a conceptual tool for reasoning about this class of systems. Our model introduces the notions of aspects, attributes and resources in order to expose the communicational aspects of awareness-systems. We show how the model enables reasoning about issues such as deception and plausible deniability, which arguably are crucial for enabling users to protect their privacy and to manage how they present themselves to their social network.
An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports
Authors: R. Tavakkoli-Moghaddam, A. Makui, S. Salahi, M. Bazzazi, F. Taheri
Venue: Computers and Industrial Engineering (2009)

This paper presents a novel, mixed-integer programming (MIP) model for the quay crane (QC) scheduling and assignment problem, namely QCSAP, in a container port (terminal). Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper, thus, proposes a genetic algorithm (GA) to solve the above-mentioned QCSAP for the real-world situations. Further, the efficiency of the proposed GA is compared against the LINGO software package in terms of computational times for small-sized problems. Our computational results suggest that the proposed GA is able to solve the QCSAP, especially for large sizes.
Efficient hierarchical motion estimation algorithm and its VLSI architecture
Authors: Bing-Fei Wu, Hsin-Yuan Peng, Tung-Lung Yu
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

This paper addresses the development and hardware implementation of an efficient hierarchical motion estimation algorithm, HMEA, using multiresolution frames to reduce the computational complexity. Excellent estimation performance is ensured using an averaging filter to downsample the original image. At the smallest resolution, the least two motion vector candidates are selected using a full-search block matching algorithm. At the middle level, these two candidate motion vectors are employed as the center points for small range local searches. Then, at the original resolution, the final motion vector is obtained by performing a local search around the single candidate from the middle level. HMEA exhibits regular data flow and is suitable for hardware implementation. An efficient VLSI architecture that includes an averaging filter to downsample the image and two 2-D semisystolic processing element arrays to determine the sum of absolute difference in pipeline is also presented. Simulation results indicate that HMEA is more area-efficient and faster than many full-search and multiresolution architectures while maintaining high video quality. This architecture with 59K gates and 1393 bytes of RAM is implemented for a search range of [-16.0, + 15.5].
An extension to 3D topological thinning method based on LUT for colon centerline extraction
Authors: M. Ding, Ruof. Tong, Sheng-hui Liao, JinX. Dong
Venue: Computer Methods and Programs in Biomedicine (2009)

Topological thinning is a valid but time-consuming method to calculate the centerline of human colon or other hollow organs accurately. An optimized 3D topological thinning method based on Look-up Table (LUT), which was proposed by Sadlier, proves to be effective in improving the efficiency on many occasions. However, it is still inefficient when processing some complex datasets. In this paper, we first analyze the reason causing the unstable performance, and then present an extension to Sadlier's method, which enables the rapid execution of the extraneous loops removing by avoiding unnecessary global connectivity testing. To reach this purpose, a min-heap structure is introduced to select a seed from the candidate voxels set of the final centerline, and region growing technique is used to find the voxels in the same branch with the seed. The comparison among the standard topological thinning, LUT method and the extension to LUT method indicates the extension achieves the most efficient performance.
Optical properties of ZnO thin films prepared by sol-gel process
Authors: J. Petersen, C. Brimont, M. Gallart, O. Crégut, G. Schmerber, P. Gilliot, B. Hönerlage, C. Ulhaq-Bouillet, J. L. Rehspringer, C. Leuvrey, S. Colis, A. Slaoui, A. Dinia
Venue: Microelectronics Journal (2009)

The present study focused on ZnO thin films fabricated by sol-gel process and spin coated onto Si (100) and quartz substrates. ZnO thin films have a hexagonal wurtzite structure with a grain diameter about 50nm. Optical properties were determined by photoluminescence (PL) and absorption spectroscopy. The absorption spectrum is dominated by a sharp excitonic peak at room and low temperatures. At room temperature, two transitions were observed by PL. One near to the prohibited energy band in ultraviolet (UV) region and the other centered at 640nm, characteristic of the electronic defects in the band-gap. The spectrum at 6K is dominated by donor-bound exciton lines and donor-acceptor pair transition. LO-phonon replica and two-electron satellite transitions are also observed. These optical characteristics are a signature of high-quality thin films.
Extraction of Perceptual Hue Feature Set for Color Image/Video Segmentation
Authors: Ming-Jiun Wang, Gwo Giun Lee, He-Yuan Lin
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

In this paper, we present a simple but effective algorithm for the extraction of perceptual hue feature set used in color image/video segmentation with emphasis on color textures. Feature extraction, with significant impact on the overall image/video analysis process, plays a critical role in classification-based segmentation. Color textures are accurately characterized by the newly introduced feature set with invariance to illumination, translation, and rotation, which is contributed by the statistical scheme in exploring the distribution of six rudimentary colors and the achromatic component at local positions. The feature set provides characteristic information and enables segmentation that is more meaningful than the recently published works do.
Service Process Composition with QoS and Monitoring Agent Cost Parameters
Authors: Yue Zhang, Mark Panahi, Kwei-Jay Lin
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

Service-oriented architecture (SOA) provides a flexible paradigm to dynamically compose service processes from individual services. The flexibility, on the other hand, makes it necessary to monitor and manage service behaviors at runtime for performance assurance. One solution is to deploy software monitoring agents. In this paper, we present an approach to consider agent cost at process composition by selecting services with lower monitoring costs. We propose two algorithms to perform service selection with agent cost. IGA is able to achieve efficient service selection and bounded agent cost by modeling the problem as the Weighted Set Covering (WSC) problem. We also study a heuristic algorithm to estimate the agent cost as part of the service utility function. The execution time of heuristic algorithm is shorter than IGA. On the other hand, the agent cost may not be consistently minimized using heuristic algorithms.
An Integrated Discovery-Routing Service for Mobile Ad Hoc Networks
Authors: Ruizhi Liao, Dan Grigoras
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Mobile Ad Hoc Networks (MANET) are created temporarily for the purpose of either communication, sharing services and resources or running applications such as multi-player game. As sharing assumes discovery and routing, we propose a new service that integrates these two services in a cost-effective manner. The limited life time of MANET requires effectiveness in terms of how resources such as battery energy and bandwidth are consumed. Beside the general application of this service to MANET, we consider it specifically interesting for query routing in sensor networks. The paper includes simulation results that show performances of the integrated discovery routing service.
Numerical characterization of DNA sequences based on digital signal method
Authors: Zhao-Hui Qi, Xiao-Qin Qi
Venue: Computers in Biology and Medicine (2009)

Based on digital signal method, we propose a new representation of DNA primary sequence. The representation can completely avoid loss of information in the transfer of data from a DNA sequence to its mathematical representation. Afterwards, we suggest one such approach to reach quantification of similarities based on digital signal similarity theory. The examination of similarities/dissimilarities among the coding sequences of the first exon of @b-globin gene of 11 species shows the utility of the scheme.
CRAHNs: Cognitive radio ad hoc networks
Authors: Ian F. Akyildiz, Won-Yeol Lee, Kaushik R. Chowdhury
Venue: Ad Hoc Networks (2009)

Cognitive radio (CR) technology is envisaged to solve the problems in wireless networks resulting from the limited available spectrum and the inefficiency in the spectrum usage by exploiting the existing wireless spectrum opportunistically. CR networks, equipped with the intrinsic capabilities of the cognitive radio, will provide an ultimate spectrum-aware communication paradigm in wireless communications. CR networks, however, impose unique challenges due to the high fluctuation in the available spectrum as well as diverse quality-of-service (QoS) requirements. Specifically, in cognitive radio ad hoc networks (CRAHNs), the distributed multi-hop architecture, the dynamic network topology, and the time and location varying spectrum availability are some of the key distinguishing factors. In this paper, intrinsic properties and current research challenges of the CRAHNs are presented. First, novel spectrum management functionalities such as spectrum sensing, spectrum sharing, and spectrum decision, and spectrum mobility are introduced from the viewpoint of a network requiring distributed coordination. A particular emphasis is given to distributed coordination between CR users through the establishment of a common control channel. Moreover, the influence of these functions on the performance of the upper layer protocols, such as the network layer, and transport layer protocols are investigated and open research issues in these areas are also outlined. Finally, a new direction called the commons model is explained, where CRAHN users may independently regulate their own operation based on pre-decided spectrum etiquette.
A Fault Taxonomy for Web Service Composition
Authors: K. S. Chan, Judith Bishop, Johan Steyn, Luciano Baresi, Sam Guinea
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

Web services are becoming progressively popular in the building of both inter- and intra-enterprise business processes. These processes are composed from existing Web services based on defined requirements. In collecting together the services for such a composition, developers can employ languages and standards for the Web that facilitate the automation of Web service discovery, execution, composition and interoperation. However, there is no guarantee that a composition of even very good services will always work. Mechanisms are being developed to monitor a composition and to detect and recover from faults automatically. A key factor in such self-healing is to know what faults to look for. If the nature of a fault is known, the system can suggest a suitable recovery mechanism sooner. This paper proposes a novel taxonomy that captures the possible failures that can arise in Web service composition, and classifies the faults that might cause them. The taxonomy covers physical, development and interaction faults that can cause a variety of observable failures in a system's normal operation. An important use of the taxonomy is identifying the faults that can be excluded when a failure occurs. Examples of using the taxonomy are presented.
Evaluation of an Interactive Web-Based Application to Promote Healthy Behavior in Order to Maintain a Healthy Weight - Preliminary Findings
Authors: Saskia M. Kelders, Susanne Kerkhof, Julia E. W. C. van Gemert-Pijnen, E. R. Seydel, Fleur Markus, Andrea Werkman
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

Web-based interactive applications may combine the interactive and tailored nature of successful behavior change interventions with the wide reach needed to target the general population. There is a lack of insight in the requirements for successful interactive web-based applications in prevention. The objective of this research is to evaluate the Healthy Weight Assistant (HWA) of the Netherlands Nutrition Centre and give recommendations for optimization of this application. This study consists of questionnaires (n=703, follow-up n=431), real-time usability-tests, log-file analysis and qualitative analysis. From the preliminary results we see that improvement with maximum effect and minimal change of the HWA can be found in motivation to keep using the application and motivation to change behavior. This can be achieved by sending automatic (tailored) reminders, restructuring the second stage in the application (motivation and goal setting) and by adding a tab 'my goals' to the application.
The Fallacy of Premature Optimization
Authors: Randall Hyde
Venue: Ubiquity (2009)

Moore's Law makes it seem as if resource limitations are always a minor consideration. If there will be twice as much memory for the same price in 18 months, why bother to squeeze a factor of 2 from an application's memory requirements? If the CPU will be twice as fast by then, why bother to shave some running time from a program? In other words, why bother to optimize programs? Isn't it better to just get them running and let Moore's Law take us off the hook when resources are constrained? Randall Hyde argues that optimization is important even when memory and processor double regularly. Trying to do the optimization too early can be a futile time-waster.
Organizing User Interface Patterns for e-Government Applications
Authors: Florence Pontico, Marco Winckler, Quentin Limbourg
Venue: Engineering Interactive Systems: EIS 2007 Joint Working Conferences, EHCI 2007, DSV-IS 2007, HCSE 2007, Salamanca, Spain, March 22-24, 2007. Selected Papers (2008)

The design of usable interactive systems is a complex task that requires knowledge and expertise on human factors and on software development. Usability guidelines and design patterns may be one way to alleviate the lack of expertise on usability of development teams by providing guidance to solve every designer's problem when designing and developing User Interface. However, the utility of guidelines and design patterns relays on two main issues: a) the quality of the advices provided, and b) the way they are organized allowing fast access to the appropriate solutions. In this paper we discuss the organization of usability guidelines and patterns at the light of an industrial project at SmalS-MvM devoted to the development of e-Government applications in a very large scale. This paper presents not only a proposal of patterns organization but also it describes a set of analysis patterns identified for e-Government applications.
Using OMG's SysML to support simulation
Authors: Christiaan J. J. Paredis, Thomas Johnson
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Currently, system engineering problems are solved using a wide range of domain-specific models and corresponding languages. It is unlikely that a single unified modeling language will be able to model in sufficient detail the large number of system aspects addressed by these domain-specific languages. Instead, a model integration framework is needed for managing the various modeling languages used to solve systems engineering problems. The Systems Modeling Language (OMG SysML&trade;) can provide an answer to this need for model integration. Using SysML, a modeler can abstract a domain-specific language to a level that permits its interaction with other system models. In addition, graph transformation approach can be use to accomplishing automated, bidirectional transformation between SysML and the domain specific language. In this paper, a generic approach for defining such graph transformations is presented.