ppxscal/embedding_network huggingface dataset:
Toward a conceptual foundation for service science: contributions from service-dominant logic
Authors: R. F. Lusch, S. L. Vargo, G. Wessels
Venue: IBM Systems Journal (2008)

Advancing service science requires a service-centered conceptual foundation. Toward this goal, we suggest that an emerging logic of value creation and exchange called service-dominant logic is a more robust framework for service science than the traditional goods-dominant logic. The primary tenets of service-dominant logic are: (1) the conceptualization of service as a process, rather than a unit of output; (2) a focus on dynamic resources, such as knowledge and skills, rather than static resources, such as natural resources; and (3) an understanding of value as a collaborative process between providers and customers, rather than what producers create and subsequently deliver to customers. These tenets are explored and a foundational lexicon for service science is suggested.
Genetic Algorithm for Shortest Driving Time in Intelligent Transportation Systems
Authors: Chu-Hsing Lin, Jui-Ling Yu, Jung-Chun Liu, Chia-Jen Lee
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

The route guidance system, which provides driving advice based on traffic information about an origin and a destination, has become very popular along with the advancement of handheld devices and the global position system. Since the accuracy and efficiency of route guidance depend on the accuracy of the traffic conditions, the route guidance system needs to include more variables in calculation, such as real time traffic flows and allowable vehicle speeds. As variables considered by the route guidance system increase, the cost to compute multiplies. As handheld devices have limited resources, it is not feasible to use them to compute the exact optimal solutions by some well-known algorithm, such as the Dijkstra’s algorithm, which is usually used to find the shortest path with a map of reasonable numbers of vertices. To solve this problem, we propose to use the genetic algorithm to alleviate the rising computational cost. We use the genetic algorithm to find the shortest time in driving with diverse scenarios of real traffic conditions and varying vehicle speeds. The effectiveness of the genetic algorithm is clearly demonstrated when applied on a real map of modern city with very large vertex numbers.
Statistical Crosstalk Noise Analysis Using First Order Parameterized Approach for Aggressor Grouping
Authors: Sachin Shrivastava, Harindranath Parameswaran
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

With decreasing process nodes and increasing design density, crosstalk analysis is a must for getting design closure in the UDSM era. In addition to this, while crosstalk analysis is complex in itself, the new process nodes are showing increasing variations of process parameters for devices and interconnect. This in turn adds more complexity to crosstalk analysis. Standard techniques of factoring in the effects of process variations (corner-based analysis) is particularly ineffective for crosstalk analysis, so we need to look at techniques of statistical analysis of crosstalk in a manner similar to that used for timing. We look at a basic infrastructure for doing statistical crosstalk analysis – and look at how it can incorporate the effects of variations in cell variations and on aggressor slew. We also look at aggressor window clustering as a technique to reduce pessimism in crosstalk – and see how this technique can be modified to take in the effect of process variations. We lay the theoretical framework for these techniques in this paper, and show the results of a prototype implementation on real designs. We show that using this framework and techniques shows a close correlation with Monte-Carlo simulations.
Flexible Energy Efficient Density Control on Wireless Sensor Networks
Authors: Yi Shang, Hongchi Shi
Venue: International Journal of Distributed Sensor Networks (2007)

In dense wireless sensor networks, density control is an important technique for prolonging the network's lifetime while providing sufficient sensing coverage. In this paper, we develop three new density control protocols by considering the tradeoff between energy usage and coverage. The first one, Non-Overlapping Density Control, aims at maximizing coverage while avoiding the overlap of sensing areas of active sensors. For the ideal case, a set of optimality conditions are derived to select sensors such that the sensing space is covered systematically to maximize the usage of each sensor and minimize the coverage gap. Based on theoretical optimality conditions, we develop a distributed protocol that can be efficiently implemented in large sensor networks. Next, we present a protocol called Non-Overlapping Density Control Based on Distances that does not require location information of the nodes. This protocol is more flexible and easier to implement than existing location-based methods. Finally, we present a new range-adjustable protocol called Non-Overlapping Density Control for Adjustable Sensing Ranges. It allows heterogenous sensing ranges for different sensors to save energy consumption. Extensive simulation shows promising results of the new protocols.
Collaborative Networks: Reference Modeling, 1 edition
Authors: Luis Camarinha-Matos, Hamideh Afsarmanesh
Venue:  (2008)

Collaborative Networks: Reference Modeling works to establish a theoretical foundation for Collaborative Networks. Particular emphasis is put on modeling multiple facets of collaborative networks and establishing a comprehensive modeling framework that captures and structures diverse perspectives of these complex entities. Further, this book introduces a contribution to the definition of reference models for Collaborative Networks. Collaborative Networks: Reference Modeling provides valuable elements for researchers, PhD students, engineers, managers, and leading practitioners interested in collaborative systems and networked society.
A model-driven approach for reusing service compositions
Authors: Carlos Granell, Michael Gould, Dolores María Llidó, Rafael Berlanga
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

The web service approach provides mechanisms for simplifying application integration. However, to meaningfully facilitate scalable development and maintenance of web service applications it is necessary to pay attention to the reuse of not only atomic web services but also existing compositions. In an effort to increase the level of service reusability, we present a model-driven approach providing a more flexible, structured service model to facilitate reuse of existing compositions to create new complex compositions. The goal of this approach is two-fold: provide a simple but expressive service model represented jointly in terms of reusable services, building blocks for constructing and reusing new compositions, and abstract patterns, for managing reusable service composition; and provide a model-driven approach for transforming such reusable building blocks into executable processes. The paper focuses on both how the abstract pattern set is derived and how the model-driven approach facilitates the creation of executable process.
Transferring of GaAs microtips using selective wet etching Al0.7Ga0.3As sacrificial layer
Authors: Xiaojuan Sun, Lizhong Hu, Hongzhi Zhang, Yichun Tian, Xiuping Liang, Heqiu Zhang, Shi Pan
Venue: Microelectronic Engineering (2008)

GaAs pyramidal microtips were successfully transferred from GaAs substrate to target wafer by a simple technique, i.e., selective wet etching off AlGaAs sacrificial layer. A GaAs/Al"0"."7Ga"0"."3As/GaAs sandwich structure is firstly formed on GaAs (001) substrate by metalorganic chemical vapor deposition, and then GaAs pyramidal microtips are grown on the sandwich structure using selective liquid-phase epitaxy. The GaAs microtips are removed from the sandwich structure by selective wet etching Al"0"."7Ga"0"."3As layer using concentrated HCl solution. Finally, the tips are glued onto the target wafer by a negative photoresist. During this transfer process the tips are completely encapsulated in a positive photoresist to protect against attack. Scanning electron microscopy images show that GaAs tips can be successfully transferred without any damage by this technique. The achievement reported here represents a significant step towards the application of scanning near-field optical microscopy.
Inferring non-suspension conditions for logic programs with dynamic scheduling
Authors: Samir Genaim, Andy King
Venue: ACM Transactions on Computational Logic (TOCL) (2008)

A logic program consists of a logic component and a control component. The former is a specification in predicate logic whereas the latter defines the order of subgoal selection. The order of subgoal selection is often controlled with delay declarations that specify that a subgoal is to suspend until some condition on its arguments is satisfied. Reasoning about delay declarations is notoriously difficult for the programmer and it is not unusual for a program and a goal to reduce to a state that contains a subgoal that suspends indefinitely. Suspending subgoals are usually unintended and often indicate an error in the logic or the control. A number of abstract interpretation schemes have therefore been proposed for checking that a given program and goal cannot reduce to such a state. This article considers a reversal of this problem, advocating an analysis that for a given program infers a class of goals that do not lead to suspension. This article shows that this more general approach can have computational, implementational and user-interface advantages. In terms of user-interface, this approach leads to a lightweight point-and-click mode of operation in which, after directing the analyser at a file, the user merely has to inspect the results inferred by the analysis. In terms of implementation, the analysis can be straightforwardly realized as two simple fixpoint computations. In terms of computation, by modeling n&excl; different schedulings of n subgoals with a single Boolean function, it is possible to reason about the suspension behavior of large programs. In particular, the analysis is fast enough to be applied repeatedly within the program development cycle. The article also demonstrates that the method is precise enough to locate bugs in existing programs.
An approach for environmental impact assessment
Authors: Hichem Omrani, Luminita Ion-Boussier, Philippe Trigano
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

In the environment impacts assessment context, several methods are proposed in literature, such as life cycle analysis, multi criteria analysis and cost benefit analysis etc. Recently, others methods combining MCDA (Multi Criteria Decision Analysis) and AI (Artificial Intelligence) have been explored to develop enhanced methodologies for knowledge based decision support. In this paper, a new approach is presented for environmental assessment of urban mobility. Various criteria should be evaluated using complex data obtained from several information sources. Therefore, the measure evaluation related to urban mobility is a hard task that does not always lead to efficient results. The problem treated in this paper, is complex with insufficient, fuzzy and uncertain data. A hybrid approach based on multi criteria analysis and various information sources has been proposed. The methodology uses fuzzy set theory for modeling criteria and belief theory (Dempster-Shafer Theory (DST)) for evaluations fusion and it is able to handle uncertainty and vagueness.
Eclipse as a teaching tool
Authors: Dwight Deugo
Venue: ACM SIGCSE Bulletin (2008)

In this Demonstration session, I will show what to teach students about Eclipse, while remaining in the contexts of existing courses, such as CS1/CS2, in higher-level courses such as Quality Assurance, and in project courses.
An effective ergodic theorem and some applications
Authors: Satyadev Nandakumar
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

This work is a synthesis of recent advances in computable analysis with the theory of algorithmic randomness. In this theory, we try to strengthen probabilistic laws, i.e., laws which hold with probability 1, to laws which hold in their pointwise effective form - i.e., laws which hold for every individual constructively random point. In a tour-de-force, V'yugin proved an effective version of the Ergodic Theorem which holds when the probability space, the transformation and the random variable are computable. However, V'yugin's Theorem cannot be directly applied to many examples, because all computable functions are continuous, and many applications use discontinuous functions. We prove a stronger effective ergodic theorem to include a restriction of Braverman's "graph-computable functions". We then use this to give effective ergodic proofs of the effective versions of Levy-Kuzmin and Khinchin Theorems relating to continued fractions.
The potential for the use of Open Source Software and Open Specifications in creating Web-based cross-border health spatial information systems
Authors: Rafael Moreno-Sanchez, Geoffrey Anderson, Jesus Cruz, Mary Hayden
Venue: International Journal of Geographical Information Science (2007)

Globalization is contributing to the blurring of borders making irrelevant the distinctions between domestic and international health problems. Cross-border and global health spatial information systems (CBHSIS) are required to address the new global health challenges. There is a need to build and document alternatives for addressing the technological, economic, and sociocultural-political challenges encountered in the creation and deployment of these systems. This paper documents the building of a prototype Web-based multimedia GIS system for use in a public health context using Open Source Software and Open Specifications and its deployment across the US-Mexico border. These technologies offer advantages in addressing several of the challenges previously mentioned. We highlight the technological and sociocultural-political issues important in successful collaboration across borders and cultures and in the creation of interoperable CBHSIS.
Fast and quality-guaranteed data streaming in resource-constrained sensor networks
Authors: Emad Soroush, Kui Wu, Jian Pei
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

In many emerging applications, data streams are monitored in a network environment. Due to limited communication bandwidth and other resource constraints, a critical and practical demand is to online compress data streams continuously with quality guarantee. Although many data compression and digital signal processing methods have been developed to reduce data volume, their super-linear time and more-than-constant space complexity prevents them from being applied directly on data streams, particularly over resource-constrained sensor networks. In this paper, we tackle the problem of online quality guaranteed compression of data streams using fast linear approximation (i.e., using line segments to approximate a time series). Technically, we address two versions of the problem which explore quality guarantees in different forms. We develop online algorithms with linear time complexity and constant cost in space. Our algorithms are optimal in the sense they generate the minimum number of segments that approximate a time series with the required quality guarantee. To meet the resource constraints in sensor networks, we also develop a fast algorithm which creates connecting segments with very simple computation. The low cost nature of our methods leads to a unique edge on the applications of massive and fast streaming environment, low bandwidth networks, and heavily constrained nodes in computational power. We implement and evaluate our methods in the application of an acoustic wireless sensor network.
A Traffic Modeling Based Power Saving Mechanism for Mobile Devices in Wireless Systems
Authors: Z. Liu, J. Almhana, R. McGorman
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

In wireless communication networks, power saving is a critical issue. Sleep mode is usually applied to save power in mobile devices; when there is no data to transmit or receive, a mobile device can switch to sleep mode periodically. Evidently, there is a trade-off between power saving and response delay, and the performance of a power saving mechanism depends on user traffic characteristics and how well the power saving mechanism can predict the termination time of an idle period. In the literature, it is commonly accepted that traffic on a high-speed network is self-similar, resulting from heavy-tailed on-off periods. In this paper, we model the on-off durations by generalized Pareto distributions and apply the Xp inspection policy of operational research to power saving mechanism design for wireless communication devices. Numerical examples are provided to show the usefulness of the proposed scheme.
Rateless forward error correction for topology-transparent scheduling
Authors: Violet R. Syrotiuk, Charles J. Colbourn, Sruthi Yellamraju
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

Topology-transparent scheduling for mobile wireless ad hoc networks has been treated as a theoretical curiosity. This paper makes two contributions towards its practical deployment: 1) We generalize the combinatorial requirement on the schedules and show that the solution is a cover-free family. As a result, a much wider number and variety of constructions for schedules exist to match network conditions. 2) In simulation, we closely match the theoretical bound on expected throughput. The bound was derived assuming acknowledgments are available immediately. We use rateless forward error correction (RFEC) as an acknowledgment scheme with minimal computational overhead. Since the wireless medium is inherently unreliable, RFEC also offers some measure of automatic adaptation to channel load. These contributions renew interest in topology-transparent scheduling when delay is a principal objective.
Reporting user experience through usability within the telecommunications industry
Authors: Kari Rönkkö, Jeff Winter, Mats Hellman
Venue: Proceedings of the 2008 international workshop on Cooperative and human aspects of software engineering (2008)

In some software development contexts, understanding 'who else' to report usability results to and how this must be done has a larger impact on the usability of products, in the long run, than reporting results to designers and developers in planned and ongoing software development projects. This situation is true in some parts of the telecommunication area. This is an area that constantly presents new usage possibilities arising from new 'hot' technology and competitive situations, i.e. not primarily from internally identified user needs. Understanding how use-oriented knowledge can have the greatest impact in this context is a challenge. As engineers we must be prepared to adjust our work to varied actors and environments under specific conditions to optimize our influence. In this case, how do the 'new hot technology and competitive situation focus' affect our possibilities to introduce use-oriented knowledge? Our desire to achieve highest leverage from performed usability work made us realize that we need to take advantage of existing usability test reporting as a first step in introducing more of user experience in the user-orientation.
ALI: An Extensible Architecture Description Language for Industrial Applications
Authors: Rabih Bashroush, Ivor Spence, Peter Kilpatrick, T. John Brown, Wasif Gilani, Mathias Fritzsche
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

While Architecture Description Languages (ADLs) have gained wide acceptance in the research community as a means of describing system designs, the uptake in industry has been slower than might have been expected. A contributory cause may be the perceived lack of flexibility and, as yet, the limited tool support. This paper describes ALI, a new ADL that aims to address these deficiencies by providing a rich, extensible and flexible syntax for describing component interface types and the use of patterns and meta-information. These enhanced capabilities are intended to encourage more widespread industrial usage.
Scheduling in multihop WiMAX networks
Authors: Debalina Ghosh, Ashima Gupta, Prasant Mohapatra
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2008)

IEEE 802.16, popularly known as WiMAX, is at the forefront of the technology drive because of the growing demand for high-speed wireless broadband networks. Multihop WiMAX networks are particularly useful as they increase the coverage area without the need to deploy expensive base stations. There are two kinds of multihop WiMAX networks - WiMAX mesh and Mobile Multihop Relay Networks. Scheduling is very important in both of these multihop WiMAX networks. The links have to be scheduled in such a way so that they do not interfere with each other while maximizing the throughput of the networks. As WiMAX networks are geared towards broadband applications, any scheduling scheme should accomodate the rate, latency and jitter requirements of the applications. This article provides an insight to the scheduling framework presented in the IEEE 802.16 standard. It also presents a few representative research proposals for centralized scheduling in WiMAX networks. We discuss some of the research issues and challenges that need to be addressed for multihop WiMAX networks to realize their full potential.
An automatic scratch pad memory management tool and MPEG-4 encoder case study
Authors: Rogier Baert, Eddy de Greef, Erik Brockmeyer
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Using software-controlled Scratch-Pad Memory (SPM) in Systems-on-Chip has the potential of reducing power consumption by using design-time application knowledge to reduce memory accesses and processor stalls. This paper presents a fully automatic application analysis and transformation tool which selects data-structures for transfer to the SPM and schedules data transfers between background memory and SPM (pre-fetching) to achieve both high performance and low power consumption. A case study applying this tool on an MPEG-4 video encoder shows an overall power reduction of 25%, a 40% power reduction in just the memories and a 40% reduction in processor cycles as compared to an optimized hardware-cache based solution.
Fluorescent Optical Imaging of Small Animals Using Filtered Back-projection 3D Surface Reconstruction Method
Authors: Gang Hu, Junjie Yao, Hao Li, Jing Bai
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

The CCD-based non-contact fluorescent optical imaging has got a promising progress in recent years.This imaging modality needs the 3D surface of the small animal, which is used for the forward model and inverse reconstruction. We propose a new 3D surface reconstruction method based on the back projection method using white/black images. After taking the surface images by CCD, the transverse reconstruction is completed using filter back-projection method.Based on the data of the edges and calibration operation, we reconstruct the 3D surface of the animals. To validate the accuracy of the optical method, we compared the external shape data of mouse phantom to that from the micro-CT system. Some in vivo fluorescence imaging results are also presented in this paper.