ppxscal/embedding_network huggingface dataset:
Service science: at the intersection of management, social, and engineering sciences
Authors: R. C. Larson
Venue: IBM Systems Journal (2008)

Service industries comprise roughly 75 percent of the gross domestic product of developed nations. To design and operate service systems for today and tomorrow, a new type of engineer must be educated, one who focuses on services rather than manufacturing. Such an engineer must be able to integrate three sciences-management, social, and engineering science-in the analysis of service systems. Within the context of the Center for Engineering Systems Fundamentals, a research center at the Massachusetts Institute of Technology, we discuss how newly emerging service systems require such a three-way integrated analysis. We deliberately select some nonstandard services, because many business services, such as supply chains, have been studied extensively.
Prediction of hemodynamic changes towards PEEP titrations at different volemic levels using a minimal cardiovascular model
Authors: C. Starfinger, J. G. Chase, C. E. Hann, G. M. Shaw, P. Lambert, B. W. Smith, E. Sloth, A. Larsson, S. Andreassen, S. Rees
Venue: Computer Methods and Programs in Biomedicine (2008)

A cardiovascular system model and parameter identification method have previously been validated for porcine experiments of induced pulmonary embolism and positive end-expiratory pressure (PEEP) titrations, accurately tracking all the main hemodynamic trends. In this research, the model and parameter identification process are further validated by predicting the effect of intervention. An overall population-specific rule linking specific model parameters to increases in PEEP is formulated to predict the hemodynamic effects on arterial pressure, pulmonary artery pressure and stroke volume. Hemodynamic changes are predicted for an increase from 0 to 10cmH"2O with median absolute percentage errors less than 7% (systolic pressures) and 13% (stroke volume). For an increase from 10 to 20cmH"2O median absolute percentage errors are less than 11% (systolic pressures) and 17% (stroke volume). These results validate the general applicability of such a rule, which is not pig-specific, but holds over for all analyzed pigs. This rule enables physiological simulation and prediction of patient response. Overall, the prediction accuracy achieved represents a further clinical validation of these models, methods and overall approach to cardiovascular diagnosis and therapy guidance.
Analysis of a class of dynamic thermal contact problems
Authors: O. Chau
Venue: International Journal of Computing Science and Mathematics (2008)

We study a general system defined by a second order evolution equation, coupled with a first order differential equation, which can model some classes of dynamic thermal contact problems. We present and establish an existence and uniqueness result, by using general results on evolution equations and Banach's contraction principle, with monotone operators and fixed point arguments. Then a fully discrete scheme for numerical approximations and analysis of error order estimate are provided. Finally applications to concrete dynamic contact problems are given, followed by numerical simulations.
Efficient edge-preserving algorithm for color contrast enhancement with application to color image segmentation
Authors: Kuo-Liang Chung, Wei-Jen Yang, Wen-Ming Yan
Venue: Journal of Visual Communication and Image Representation (2008)

In this paper, a new and efficient edge-preserving algorithm is presented for color contrast enhancement in CIE Lu^'v^' color space. The proposed algorithm not only can enhance the color contrast as the previous algorithm does, but also has an edge-preservation effect. In addition, the spurious edge points occurred due to the color contrast enhancement can be well reduced using the proposed algorithm. This is the first edge-preserving algorithm for color contrast enhancement in color space. Furthermore, a novel color image segmentation algorithm is presented to justify the edge-preservation benefit of the proposed color contrast enhancement algorithm. Based on some real images, experimental results demonstrate the advantages of color contrast enhancement, edge-preservation effect, and segmentation result in our proposed algorithm.
Numerical investigation of velocity field in dividing open-channel flow
Authors: Bahareh Pirzadeh, Hamid Shamloo
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

This paper provides details of application of FLUENT-2D&3D software in simulation of lateral intake flows. Comparisons have been made between numerical results and measured experimental velocities for a lateral intake. Comparisons indicate that the 2D simulating captures most experimental trends with reasonable agreement and 3D simulating results have also good accuracy.
Building bug-tolerant routers with virtualization
Authors: Matthew Caesar, Jennifer Rexford
Venue: Proceedings of the ACM workshop on Programmable routers for extensible services of tomorrow (2008)

Implementation bugs are a highly critical problem in wide-area networks. The software running on core routers is subject to vulnerabilities, coding mistakes, and misconfiguration. Unfortunately, these problems are often found after deployment in live networks, where they lead to outages, make networks prone to attack, and involve a challenging process to localize and debug. In this work, we propose a bug-tolerant router that runs multiple diverse copies of router software in parallel, such that each copy is unlikely to fail at the same time as the others. Diversity is achieved by varying the ordering and timing of routing messages, running different routing protocols, running code written by different implementers, etc. Because each copy is different, each copy will likely have a different output during an error, and hence a simple voting procedure is then used to decide which copy's output will "drive" packet forwarding and control-plane communication with other routers. In this paper we motivate our design, describe some design decisions and tradeoffs, and then conclude with a description of our ongoing work in building a prototype of this architecture.
Red-blue covering problems and the consecutive ones property
Authors: Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
Venue: Journal of Discrete Algorithms (2008)

Set Cover problems are of core importance in many applications. In recent research, the ''red-blue variants'' where blue elements all need to be covered whereas red elements add further constraints on the optimality of a covering have received considerable interest. Application scenarios range from data mining to interference reduction in cellular networks. As a rule, these problem variants are computationally at least as hard as the original set cover problem. In this work we investigate whether and how the well-known consecutive ones property, restricting the structure of the input sets, makes the red-blue covering problems feasible. We explore a sharp border between polynomial-time solvability and NP-hardness for these problems.
Approximations and reducts with covering generalized rough sets
Authors: Eric C. C. Tsang, Chen Degang, Daniel S. Yeung
Venue: Computers Mathematics with Applications (2008)

The covering generalized rough sets are an improvement of traditional rough set model to deal with more complex practical problems which the traditional one cannot handle. It is well known that any generalization of traditional rough set theory should first have practical applied background and two important theoretical issues must be addressed. The first one is to present reasonable definitions of set approximations, and the second one is to develop reasonable algorithms for attributes reduct. The existing covering generalized rough sets, however, mainly pay attention to constructing approximation operators. The ideas of constructing lower approximations are similar but the ideas of constructing upper approximations are different and they all seem to be unreasonable. Furthermore, less effort has been put on the discussion of the applied background and the attributes reduct of covering generalized rough sets. In this paper we concentrate our discussion on the above two issues. We first discuss the applied background of covering generalized rough sets by proposing three kinds of datasets which the traditional rough sets cannot handle and improve the definition of upper approximation for covering generalized rough sets to make it more reasonable than the existing ones. Then we study the attributes reduct with covering generalized rough sets and present an algorithm by using discernibility matrix to compute all the attributes reducts with covering generalized rough sets. With these discussions we can set up a basic foundation of the covering generalized rough set theory and broaden its applications.
Nesting of two-dimensional irregular parts: an integrated approach
Authors: S. Q. Xie, G. G. Wang, Y. Liu
Venue: International Journal of Computer Integrated Manufacturing (2007)

The present paper reports an intelligent computer-aided nesting (CAN) system for optimal nesting of two-dimensional parts, especially parts with complicated shapes, with the objective of effectively improving the utilization ratio of sheet materials. This paper also systemically reviews the nesting algorithms that were developed to perform various nesting tasks, and attacks the irregular part nesting problem by efficiently integrating and improving the performance of nesting algorithms such as the rectangular enclosure method, bottom-left nesting algorithms, heuristic algorithms and genetic algorithms. The CAN system has also been developed as a nesting algorithm test platform for researching and developing new nesting algorithms. Through this test platform, the limitations of existing nesting algorithms are investigated and problems such as nesting parts in spaces within a single part or between parts are also studied. Efforts have been devoted to improving the nesting efficiency of the existing algorithms and developing new nesting algorithms. Case studies are carried out in a sheet metal cutting company. The results show that the intelligent CAN system can effectively nest both regular and irregular parts, and greatly improve the utilization ratio of raw sheet material.
Deadlock free routing algorithms for irregular mesh topology NoC systems with rectangular regions
Authors: Rickard Holsmark, Maurizio Palesi, Shashi Kumar
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2008)

The simplicity of regular mesh topology Network on Chip (NoC) architecture leads to reductions in design time and manufacturing cost. A weakness of the regular shaped architecture is its inability to efficiently support cores of different sizes. A proposed way in literature to deal with this is to utilize the region concept, which helps to accommodate cores larger than the tile size in mesh topology NoC architectures. Region concept offers many new opportunities for NoC design, as well as provides new design issues and challenges. One of the most important among these is the design of an efficient deadlock free routing algorithm. Available adaptive routing algorithms developed for regular mesh topology cannot ensure freedom from deadlocks. In this paper, we list and discuss many new design issues which need to be handled for designing NoC systems incorporating cores larger than the tile size. We also present and compare two deadlock free routing algorithms for mesh topology NoC with regions. The idea of the first algorithm is borrowed from the area of fault tolerant networks, where a network topology is rendered irregular due to faults in routers or links, and is adapted for the new context. We compare this with an algorithm designed using a methodology for design of application specific routing algorithms for communication networks. The application specific routing algorithm tries to maximize adaptivity by using static and dynamic communication requirements of the application. Our study shows that the application specific routing algorithm not only provides much higher adaptivity, but also superior performance as compared to the other algorithm in all traffic cases. But this higher performance for the second algorithm comes at a higher area cost for implementing network routers.
Service-Oriented Design Methodology for Wireless Sensor Networks: A View through Case Studies
Authors: Elena Meshkova, Janne Riihijärvi, Frank Oldewurtel, Christine Jardak, Petri Mähönen
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

In this paper we discuss the design methodology based on the service-oriented architecture and agile development principles for wireless embedded and sensor networks (WSNs). This methodology suits particularly well for streamlining and partially automating the design and implementation of complex WSNs. We report results from selected case-studies to test applicability of service-oriented architectures for embedded software. We evaluate the proposed design methodology by studying cases that include the development of three different services for wireless sensor networks that can work together as a part of a complete solution. We specifically comment on the trade-offs that a developer might face while designing and implementing systems. We follow the "best-practices" of the software design methodology and adapt them to the development of both the sensor network services and the sensor networks themselves. The design and implementation cycle includes three stages: the overall solution and architecture design, the protocol and application design, and finally, the implementation. These stages are iterated throughout the life-time of the project. During the design we consider both the abstract definition of user requirements and targeted functionality, and their mapping to the real hardware and software.
Increasing the Autonomy of Mobile Robots by On-line Learning Simultaneously at Different Levels of Abstraction
Authors: Willi Richert, Olaf Lüke, Bastian Nordmeyer, Bernd Kleinjohann
Venue: Proceedings of the Fourth International Conference on Autonomic and Autonomous Systems (2008)

We present a framework that is able to handle system and environmental changes by learning autonomously at different levels of abstraction. It is able to do so in continuous and noisy environments by 1) an active strategy learning module that uses reinforcement learning and 2) a dynamically adapting skill module that proactively explores the robot's own action capabilities and thereby providing actions to the strategy module. We present results that show the feasibility of simultaneously learning low-level skills and high-level strategies in order to reach a goal while reacting to disturbances like hardware damages. Thereby, the robot drastically increases its overall autonomy.
Investigating voice communication over multipath wireless mobile ad hoc network
Authors: Binod Vaidya, Nak-Yong Ko, Soon-Suck Jarng, SeungJo Han
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

With the rapid growth and popularity of wireless LANs (WLANs), a demand of Voice over IP (VoIP) is also increasing. In recent years, dominant trend of development in Mobile Ad hoc Networks (MANET) technology makes VoIP services more appealing. However, it is still quite challenging to ensure quality voice communication in MANET. Some of these challenges include packet loss due to network congestion, and variable packet latency. Not only traditional single-path ad-hoc routing but also traditional voice codec fails to perform well under these conditions. In this paper, we depict a framework for VoIP over multipath multihop wireless network, in which we propose multipath ad-hoc routing and traffic allocation approach.
Trellis properties on the tensor product of two lattices
Authors: Haibin Kan, Xuefei Li, Hong Shen
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

Trellis diagrams of lattices and the Viterbi algorithm can be used for decoding. In the paper, we investigate some relations among the trellis diagrams of the lattices L1, L2 and L1 ⊗ L2.
HyperBone: A Scalable Overlay Network Based on a Virtual Hypercube
Authors: Luis C. E. Bona, Keiko V. O. Fonseca, Elias P. Duarte Jr., Samuel L. V. de Mello
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

This paper presents HyperBone, an overlay network based on a virtual hypercube that offers services such as monitoring and routing, allowing the execution of distributed applications across the Internet. Hypercubes are scalable by definition, presenting several properties such as symmetry and logarithmic diameter, that are advantageous for distributed and parallel applications. HyperBone nodes run the Distributed Virtual Hypercube Algorithm (DiVHA) in order to maintain the topology. DiVHA keeps the hypercube properties even when the number of nodes is not apower of two, or under a dynamic fault situation, in which nodes fail and recover continuously, leaving and joining the system. HyperBone was implemented and experimental results are presented, obtained fromthe execution of a set of MPI parallel applications on a virtual hypercube spread across the world built with Planet Lab nodes.
CodeCity: 3D visualization of large-scale software
Authors: Richard Wettel, Michele Lanza
Venue: Companion of the 30th international conference on Software engineering (2008)

CodeCity is a language-independent interactive 3D visualization tool for the analysis of large software systems. Based on a city metaphor, it depicts classes as buildings and packages as districts of a "software city". By offering consistent locality and solid orientation points we keep the viewer oriented during the exploration of a city. We applied our tool on several large-scale industrial systems.
Row/column redundancy to reduce SRAM leakage in presence of random within-die delay variation
Authors: Maziar Goudarzi, Tohru Ishihara
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

Traditionally, spare rows/columns have been used in two ways: either to replace too leaky cells to reduce leakage, or to substitute faulty cells to improve yield. In contrast, we first choose a higher threshold voltage (Vth) and/or gate-oxide thickness (Tox) for SRAM transistors at design time to reduce leakage, and then substitute the resulting too slow cells by spare rows/columns. We show that due to within-die delay variation of SRAM cells only a few cells violate target timing at higher Vth or Tox; we carefully choose the Vth and Tox values such that the original memory timing-yield remains intact for a negligible extra delay. On a commercial 90nm process assuming 3% variation in SRAM cell delay, we obtained 47% leakage reduction by adding only 5 redundant columns at negligible area, dynamic power and delay costs.
Home-Explorer: Ontology-based physical artifact search and hidden object detection system
Authors: Bin Guo, Satoru Satake, Michita Imai
Venue: Mobile Information Systems (2008)

A new system named Home-Explorer that searches and finds physical artifacts in a smart indoor environment is proposed. The view on which it is based is artifact-centered and uses sensors attached to the everyday artifacts (called smart objects) in the real world. This paper makes two main contributions: First, it addresses, the robustness of the embedded sensors, which is seldom discussed in previous smart artifact research. Because sensors may sometimes be broken or fail to work under certain conditions, smart objects become hidden ones. However, current systems provide no mechanism to detect and manage objects when this problem occurs. Second, there is no common context infrastructure for building smart artifact systems, which makes it difficult for separately developed applications to interact with each other and uneasy for them to share and reuse knowledge. Unlike previous systems, Home-Explorer builds on an ontology-based knowledge infrastructure named Sixth-Sense, which makes it easy for the system to interact with other applications or agents also based on this ontology. The hidden object problem is also reflected in our ontology, which enables Home-Explorer to deal with both smart objects and hidden objects. A set of rules for deducing an object's status or location information and for locating hidden objects are described and evaluated.
Simultaneous intersection representation of pairs of graphs
Authors: Paul J. Tanenbaum
Venue: Journal of Graph Theory (1999)

We characterize the pairs (G1, G2) of graphs on a shared vertex set that are intersection polysemic: those for which the vertices may be assigned subsets of a universal set such that G1 is the intersection graph of the subsets and G2 is the intersection graph of their complements. We also consider several special cases and explore bounds on the size of the universal set. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 32: 171&ndash;190, 1999
FPGA implementation(s) of a scalable encryption algorithm
Authors: F. Macé, F.-X. Standaert, J.-J. Quisquater
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

SEA is a scalable encryption algorithm targeted for small embedded applications. It was initially designed for software implementations in controllers, smart cards, or processors. In this letter, we investigate its performances in recent field-programmable gate array (FPGA) devices. For this purpose, a loop architecture of the block cipher is presented. Beyond its low cost performances, a significant advantage of the proposed architecture is its full flexibility for any parameter of the scalable encryption algorithm, taking advantage of generic VHDL coding. The letter also carefully describes the implementation details allowing us to keep small area requirements. Finally, a comparative performance discussion of SEA with the Advanced Encryption Standard Rijndael and ICEBERG (a cipher purposed for efficient FPGA implementations) is proposed. It illustrates the interest of platform/context-oriented block cipher design and, as far as SEA is concerned, its low area requirements and reasonable efficiency.
Tight bounds on the complexity of cascaded decomposition of automata
Authors: O. Maler
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

Exponential upper and lower bounds on the size of the cascaded (Krohn-Rhodes) decomposition of automata are given. These results are used to obtain elementary algorithms for various translations between automata and temporal logic, where the previously known translations were nonelementary. The relevance of the result is discussed.
The Tiny Encryption Algorithm
Authors: Simon J. Shepherd
Venue: Cryptologia (2007)

The Tiny Encryption Algorithm (TEA) has been around for just over ten years. It is probably the most "minimal"-and hence fastest-block cipher ever devised and yet appears resistant to most attacks. In this article, we describe the algorithm, its simplicity of design and ease of use, its cryptographic strength, and the wide range of implementations and applications of the cipher.
Non-destructive Evaluation and Flaw Visualization Using an Eddy Current Probe
Authors: Rafic Bachnak, Scott King
Venue: Proceedings of the Third International Conference on Systems (2008)

This paper describes the development of an eddy current prototype that combines positional and eddy-current data to produce a C-scan of tested material. The preliminary system consists of an eddy current probe, a position tracking mechanism, and basic data visualization capability. Test results of the prototype are presented and briefly discussed.