ppxscal/embedding_network huggingface dataset:
Leakage power reduction using stress-enhanced layouts
Authors: Vivek Joshi, Brian Cline, Dennis Sylvester, David Blaauw, Kanak Agarwal
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

In recent years, process-induced mechanical stress has emerged as a useful manufacturing technique that enhances carrier transport and increases drive currents. This improvement in current has helped to compensate the decline of device scaling factors in parameters such as tox, Vth, and Vdd. In this work, we propose stress as a means to achieve optimal power-performance trade-off by combining stress-based, performance-enhanced standard cell assignment with dual-Vth assignment. We study how stress-induced performance enhancements are affected by layout properties and improve standard cell layouts so that performance gains are maximized. We then develop a circuit-level, block-based, stress-enhanced optimization algorithm that includes all layout-dependent sources of mechanical stress. By combining the two performance enhancement techniques (stress-based and dual-Vth) for a set of benchmark circuits, we find that our stress-aware optimization, decreases leakage by ~24% on average, for iso-delay, when compared to dual-Vth assignment. Similarly, for iso-leakage, our optimization algorithm reduces delay on average by 5%. In both cases, the proposed method only incurs a small area penalty (< 0.5%).
CROWN: A Service-Oriented Grid Middleware System: Experience and Applications
Authors: Jinpeng Huai, Chunming Hu, Tianyu Wo, Jianxin Li
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

Grid computing has emerged as a new paradigm of distributed computing technology on large-scale resource sharing and coordinated problem solving. Based on a proposed Web service-based grid architecture, we have designed a service grid middleware system called CROWN which aims to promote the utilization of valuable resources and cooperation of researchers nationwide and world-wide. To address the issues of CROWN resource management, we proposed some key technologies including trustworthy remote and hot service deployment, overlay-based distributed resource organization, resource scheduling and load balance, and federation-based virtual organization management. A status of the wide-area CROWN testbed is also introduced in this paper. Three typical applications including AREM, MDP and gViz are deployed on the CROWN testbed. Experience of CRWON testbed deployment and application development shows that the middleware can support the typical scenarios such as computing-intensive applications and data-intensive applications etc.
Efficient Embedded Runtime Systems through Port Communication Optimization
Authors: Peter H. Feiler
Venue: Proceedings of the 13th IEEE International Conference on on Engineering of Complex Computer Systems (2008)

Traditionally shared data areas have been used to efficiently communicate between embedded system tasks, such as periodically executing control system tasks. Such implementations are highly sensitive to the execution order of tasks, i.e., they depend on a static timeline. SAE AADL supports a port communication model that ensures deterministic processing of signal streams. In this paper we discuss an analytical framework that allows us to optimize such port-based communication by generating a runtime executive that utilizes shared data areas where appropriate, while ensuring the timing semantic assumed by the control application.
Selection and context scoping for digital video collections: an investigation of youtube and blogs
Authors: Robert G. Capra, Christopher A. Lee, Gary Marchionini, Terrell Russell, Chirag Shah, Fred Stutzman
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

Digital curators are faced with decisions about what part of the ever-growing, ever-evolving space of digital information to collect and preserve. The recent explosion of web video on sites such as YouTube presents curators with an even greater challenge - how to sort through and filter a large amount of information to find, assess and ultimately preserve important, relevant, and interesting video. In this paper, we describe research conducted to help inform digital curation of on-line video. Since May 2007, we have been monitoring the results of 57 queries on YouTube related to the 2008 U.S. presidential election. We report results comparing these data to blogs that point to candidate videos on YouTube and discuss the effects of query-based harvesting as a collection development strategy.
Epileptic EEG detection using neural networks and post-classification
Authors: L. M. Patnaik, Ohil K. Manyam
Venue: Computer Methods and Programs in Biomedicine (2008)

Electroencephalogram (EEG) has established itself as an important means of identifying and analyzing epileptic seizure activity in humans. In most cases, identification of the epileptic EEG signal is done manually by skilled professionals, who are small in number. In this paper, we try to automate the detection process. We use wavelet transform for feature extraction and obtain statistical parameters from the decomposed wavelet co-efficients. A feed-forward backpropagating artificial neural network (ANN) is used for the classification. We use genetic algorithm for choosing the training set and also implement a post-classification stage using harmonic weights to increase the accuracy. Average specificity of 99.19%, sensitivity of 91.29% and selectivity of 91.14% are obtained.
A* -based layout design for gratings allocation
Authors: Hae Young Lee, Tae Ho Cho
Venue: Computer-Aided Design (2008)

In the design process of gratings, the grating layout design is the most important activity influencing manufacturing cost. In the grating layout design, the key to saving manufacturing cost is to find a design with a minimal number of cutting operations. This paper presents an application of the A^* algorithm in grating layout design. The design problem is represented as the space search problem of design alternatives. A^* explores the feasible alternatives within the space, until an optimal solution is obtained.
A reproducing kernel Hilbert space framework for pairwise time series distances
Authors: Zhengdong Lu, Todd K. Leen, Yonghong Huang, Deniz Erdogmus
Venue: Proceedings of the 25th international conference on Machine learning (2008)

A good distance measure for time series needs to properly incorporate the temporal structure, and should be applicable to sequences with unequal lengths. In this paper, we propose a distance measure as a principled solution to the two requirements. Unlike the conventional feature vector representation, our approach represents each time series with a summarizing smooth curve in a reproducing kernel Hilbert space (RKHS), and therefore translate the distance between time series into distances between curves. Moreover we propose to learn the kernel of this RKHS from a population of time series with discrete observations using Gaussian process-based non-parametric mixed-effect models. Experiments on two vastly different real-world problems show that the proposed distance measure leads to improved classification accuracy over the conventional distance measures.
Offline variants of the “lion and man” problem
Authors: Adrian Dumitrescu, Ichiro Suzuki, Pawe yliski
Venue: Theoretical Computer Science (2008)

Consider the following safe path planning problem: Given a set of trajectories (paths) of k point robots with maximum unit speed in a bounded region over a (long) time interval [0,T], find another trajectory (if it exists) subject to the same maximum unit speed limit, that avoids (that is, stays at a safe distance of) each of the other k trajectories over the entire time interval. We call this variant the continuous model of the safe path planning problem. The discrete model of this problem is: Given a set of trajectories (paths) of k point robots in a graph over a (long) time interval 0,1,2,...,T, find a trajectory (path) for another robot, that avoids each of the other k at any time instant in the given time interval. We introduce the notions of the avoidance number of a region, and that of a graph, respectively, as the maximum number of trajectories which can be avoided in the region (respectively, graph). We give the first estimates on the avoidance number of the nxn grid G"n, and also devise an efficient algorithm for the corresponding safe path planning problem in arbitrary graphs. We then show that our estimates on the avoidance number of G"n can be extended for the avoidance number of a bounded (fat) region. In the final part of our paper, we consider other related offline questions, such as the maximum number of men problem and the spy problem.
Find me if you can: designing interfaces for people search
Authors: Junichiro Mori, Nathalie Basselin, Alexander Kröner, Anthony Jameson
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

Selecting relevant people is crucial for collaborative systems exploiting other users' experiences. With the new developments of the Web and ubiquitous technologies, various user data may support people selection. Given the wide range of user data sources, the question is now how to select appropriate users meeting the information seeker's goal. We propose recommendations for the design of people search interfaces, providing an overview of the user data and tools of relevance and two examples of how such recommendations can be met in one single interface, ensuring the selection of appropriate and reachable people. We also show applications of people search interfaces in different scenarios.
Acquiring Knowledge as You Play
Authors: Debbie Richards
Venue: Proceedings of the Fourth International Conference on Autonomic and Autonomous Systems (2008)

Knowledge acquisition in expert systems and authoring in drama or narrative-based systems share many issues in common. They are typically labor-intensive and time-consuming tasks requiring technical and specialized skills on how to elicit and represent the knowledge together with the need for familiarity with the goals, content and problem-solving method, processes or sequences relevant to the domain. Our project involves the creation of a virtual environment to safely experience and learn how to detect and handle risky situations. To increase the potential learning experiences we advocate a means by which the domain trainer/expert is able to update the system knowledge through exploration of existing scenarios.
Y-MAC: An Energy-Efficient Multi-channel MAC Protocol for Dense Wireless Sensor Networks
Authors: Youngmin Kim, Hyojeong Shin, Hojung Cha
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

As the use of wireless sensor networks (WSNs) becomes widespread, node density tends to increase. This poses a new challenge for Medium Access Control (MAC) protocol design. Although traditional MAC protocols achieve low-power operation, they use only a single channel which limits their performance. Several multi-channel MAC protocols for WSNs have been recently proposed. One of the key observations is that these protocols are less energy efficient than single-channel MAC protocols under light traffic conditions. In this paper, we propose an energy efficient multi-channel MAC protocol, Y-MAC, for WSNs. Our goal is to achieve both high performance and energy efficiency under diverse traffic conditions. In contrast to most of previous multi-channel MAC protocols for WSNs, we implemented Y-MAC on a real sensor node platform and conducted extensive experiments to evaluate its performance. Experimental results show that Y-MAC is energy efficient and maintains high performance under high-traffic conditions.
Multi-scale correlations between topography and vegetation in a hillside catchment of Honduras
Authors: A. Nelson, T. Oberthür, S. Cook
Venue: International Journal of Geographical Information Science (2007)

All systems have causes and effects that can be appreciated at different spatial scales. Understanding and representing the complexity of multi-scale patterns in maps and spatial models are key research objectives. We describe the use of three types of correlation analyses: (1) a standard Pearson correlation coefficient, (2) a 'global' multi-scale correlation, and (3) local geographically weighted correlation. These methods were applied to topographic and vegetation indices in a small catchment in Honduras that is representative of the country's hillsides agro-ecosystem which suffers from severe environmental degradation due to land-use decisions that lead to deforestation, overgrazing, and unsustainable agricultural. If the geographical scale at which topography matters for land-use allocation can be determined, then integration of knowledge systems can be focused. Our preliminary results show that: (1) single-scale correlations do not adequately represent the relationship between NDVI and topographic indices; (2) peaks in the global multi-scale correlations in agricultural areas coincided with the median farm size, but there was no evidence of any community or larger-scale land-use planning or optimization; and (3) local multi-scale correlations varied considerably from the global results at all scales, and these variations have a strong spatial structure which may indicate local optimization of land use.
Games: good/evil
Authors: Susan Haller, Brian Ladd, Scott Leutenegger, John Nordlinger, Jody Paul, Henry Walker, Carol Zander
Venue: ACM SIGCSE Bulletin (2008)

In this special session we present arguments for and against a game-centric computing curriculum. To highlight the issues and ensure equal time for arguments on either side, our session is staged as a debate with three speakers on each side. Our audience is educators and educational researchers interested in the role of game development in the CS curriculum.
Motion segmentation using GPCA techniques and optical flow
Authors: C. Losada, M. Mazo, S. Palazuelos, J. L. Martín, J. J. García
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

In this work, the use of the Generalized Principal Components Analysis (G-PCA) to improve the segmentation of moving objects in image sequences is proposed. In order to obtain this improvement, the noise components in the image derivatives are reduced, and afterwards, a method based on linear algebra is used to make the segmentation. Furthermore this work presents diverse tests to compare the results reached with and without the noise reduction in the image derivatives, and using the nonlinear minimization of an error function. A remarkable improvement in the segmentation quality and the processing time can be observed in every experiment when using the proposed method.
Ontology-based artefact management in automotive electronics
Authors: K. Sandkuhl, A. Billig
Venue: International Journal of Computer Integrated Manufacturing (2007)

The current paper presents work in progress in integrated management of artefacts inautomotive electronics with a focus on requirements. A case study on industrial requirements management was performed in a Swedish automotive supplier of software-intensive systems. Based on this case study, a frame concept for integrated model management is proposed. One core element in implementing the frame concept is an ontology-based domain repository. Concepts, architecture and realization of a domain-repository are introduced. The domain repository is based on RDF, RDFS and TRIPLE and includes extensions supporting navigation in the artefact net and derivation of new knowledge: modlets, actlets and spot views.
The entropy of fuzzy vectors
Authors: Cuilian You, Meilin Wen
Venue: Computers Mathematics with Applications (2008)

Several types of entropy of fuzzy variables or fuzzy sets have been given in the literature in order to measure the degree of uncertainty. In order to measure the degree of uncertainty of fuzzy vectors, a new definition of entropy of fuzzy vectors is proposed. Some properties are then investigated and the relations between the entropy of fuzzy variables and fuzzy vectors are discussed.
Validating a new algorithm for estimating aerosol optical depths over land from MODIS imagery
Authors: B. Zhong, S. Liang, B. Holben
Venue: International Journal of Remote Sensing (2007)

Aerosols greatly affect the signals of satellite sensor imagery for remote sensing of land surfaces and play a dual role in global climate change and the hydrological cycle. However, there has not been a reliable method for estimating aerosol properties over land directly from multispectral remotely sensed imagery. In a recent study, a new algorithm to estimate aerosol optical depths (AODs) from Moderate-Resolution Imaging Spectroradiometer (MODIS) imagery suitable for all land surfaces was proposed. It is based on a sequence of imagery over a period of time with the assumption that the surface property is relatively stable and atmospheric conditions vary much more dramatically. Although this algorithm was validated over several sites, more validation was necessary. In this study, this algorithm was validated using 3-month measurements at 25 AErosol RObotic NETwork (AERONET) sites in North America. The validation results show that this algorithm can estimate AODs with close agreement with the AERONET measurements [R 2 = 0.69, root mean square error (RMSE) 0.06].
Review: Stability of nonlinear masonry members under combined load
Authors: Igino Mura
Venue: Computers and Structures (2008)

Under examination is the post buckling of unreinforced load-bearing masonry walls or piers subject to a combined load consisting of a uniformly distributed axial load and a concentrated eccentric load at the top end. Fixed free-ended prismatic columns are examined, taking into consideration no-tension material with a parabolic stress-strain law. The integro-differential problem has been formulated extremely carefully and solved numerically with the finite difference method (FDM). Depending on eccentric load intensity, on the height-depth ratio, on the intensity of the distributed axial load and the initial eccentricity of the concentrated load, a column can fail owing to elastic instability or because the masonry has reached, or exceeded, its allowable compressive stress. It is shown that the load distributed along the axis, in the case of a centred top load or one with slight eccentricity, always produces a reduction of the limit load. Whereas in the case of a top load applied with strong eccentricity the distributed load has a stabilizing effect at low values of its intensity and produces a reduction of the limit load at high values instead. Finally the accuracy of the finite difference results is assessed by comparison with the results obtained by the use of the 4th-order Runge-Kutta Method and the Collocation Method.
Efficient routing in intermittently connected mobile networks: the multiple-copy case
Authors: Thrasyvoulos Spyropoulos, Konstantinos Psounis, Cauligi S. Raghavendra
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real networks that follow this model, for example, wildlife tracking sensor networks, military networks, vehicular ad hoc networks, etc. In this context, conventional routing schemes fail, because they try to establish complete end-to-end paths, before any data is sent. To deal with such networks researchers have suggested to use flooding-based routing schemes. While flooding-based schemes have a high probability of delivery, they waste a lot of energy and suffer from severe contention which can significantly degrade their performance. Furthermore, proposed efforts to reduce the overhead of flooding-based schemes have often been plagued by large delays. With this in mind, we introduce a new family routing schemes that "spray" a few message copies into the network, and then route each copy independently towards the destination. We show that, if carefully designed, spray routing not only performs significantly fewer transmissions per message, but also has lower average delivery delays than existing schemes; furthermore, it is highly scalable and retains good performance under a large range of scenarios. Finally, we use our theoretical framework proposed in our 2004 paper to analyze the performance of spray routing. We also use this theory to show how to choose the number of copies to be sprayed and how to optimally distribute these copies to relays.
A Model of Sharing Based Multi-Agent to Support Adaptive Service in Ubiquitous Environment
Authors: Hyogun Yoon, Eungyeong Kim, Malrey Lee, Jeawan Lee, Thomas Gatton
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

In order to provide users with intelligent services, ubiquitous computing needs to make user situation analysis in consideration of users' mobility. Thus, this paper defines context structure for recognizing dynamic changes in users' environment and proposes a model of multi-agent for processing users' context. The proposed context structure distinguishes between dynamic and static contexts according to the volume of context change, and defines communication protocols among agents. By doing so, the user can get service for own in dynamic environment.
New power aware routing algorithm for MANETs using gateway node
Authors: G. Varaprasad
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

Mobile Adhoc Network(MANET) is a collection of wireless mobile nodes. Each node works as a router and forms a dynamic topology. Energy is an important resource in the MANET, since every node has equipped with limited battery-power. In this paper, we propose a model called a power-aware routing algorithm for MANET using gateway node. Focus of this work is to minimize number of control message packets, energy consumption and increases the throughput.
Hyperlinks visualization using social bookmarking
Authors: Marek Tomša, Mariá Bieliková
Venue: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia (2008)

We present a method for navigation support by visualization of actual web page context. We browse and incrementally visualize a graph representing an abstraction of web navigation where nodes represent web pages and edges represent relationships between them expressed either by explicit links (one page linking to another through the content) or implied relationships (relevant pages several clicks away). We proposed several metrics for edge relevance evaluation. In the metrics, existing metadata in form of tags associated with bookmarks offered by collaborative social bookmarking sites is employed and user preferences represented by their tag usage are taken into account.
Fuzzy logic controller design applied to servo-drive systems
Authors: Aldo Pardo Garcia, Jorge Luis Díaz Rodríguez
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

This paper presents a Fuzzy Logic Controller (FLC) design procedure for a DC motor servo-drive system. The fuzzy controller is synthesized using information from a previous modeling and simulation for the servo-drive system. A conventional speed control scheme with a PI controller was achieved, taking into account optimality criteria and anti-windup action. Both, conventional and fuzzy control schemes were analyzed and compared via computer simulations.