ppxscal/embedding_network huggingface dataset:
Basing Acceptable Error-Tolerant Performance on Significance-Based Error-rate (SBER)
Authors: Zhaoliang Pan, Melvin A. Breuer
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

As CMOS scaling continues to decrease and new technologies emerge, feature sizes approach molecular sizes. Due to high defect rates, process variations and quantum effects, manufacturing yields have decreased. To increase the effective yield, error-tolerance, which allows for some defective chips to be employed in systems that can tolerate errors, has been proposed. To support error-tolerance, the acceptability of defective chips must be quantified according to certain measures. A new measure is proposed in this paper, namely significance-based error-rate (SBER). SBER combines two previously studied error-tolerance measures, namely error-significance and error-rate. In this paper we introduce three different ways to quantify the SBER value(s) of a defective chip using built-in self-test (BIST). These techniques cover the following scenarios: (1) multiple copies of a target circuit where at least one copy is non-defective; (2) multiple copies of a target circuit where none are defect free; and (3) single copy of a defective target circuit. For each scenario, the statistical characteristics of the estimation of the SBER value are discussed.
ArchES: a rule-based system for hypothetical social scenarios in archaeology
Authors: Georgios K. Giannikis, Athos Antoniades, Dionysios Politis
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

In this paper we present ArchES, a novel rule-based system implemented as a web tool for formulating and testing hypothetical archaeological social scenarios. Scenarios are organized by archaeologists and are based on rules and facts that derive from findings in excavation areas. ArchES analyses different variables that encode social factors affecting areas and findings, in the past as well as the present. The presented tool was implemented using Java web technologies and Jess as the rule engine. ArchES is part of the SeeArchWeb project that aims to develop a new instructional approach for the domain of Archaeology.
A Pattern-Driven Security Process for SOA Applications
Authors: Nelly A. Delessy, Eduardo B. Fernandez
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

SOA enables the design of flexible and modular software applications that can be used in a crossorganization context. Unfortunately, those qualities have a negative impact on the security of the software application. In this paper, we investigate the production of secure SOA applications. In particular, we provide an approach to build secure SOA applications that takes into account the new security issues introduced by the complexity of SOA-based applications. We build upon two different approaches to secure SOA applications: model-driven development and the use of security patterns.
A Novel Method for Obtaining Real Time Control Strategy Using GA for Dynamical Systems Subjected to External Arbitrary Excitations
Authors: M. Saud, I. I. Esat
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

"Convolution of the Control Strategy" a new Convolution Integral to optimize a General Control Force Strategy that minimizes the response of the oscillatory systems subjected to an arbitrary excitation. Genetic Algorithm is used to optimize a control strategy against shock input, and then Convolution Integral is used to obtain a general control force strategy against arbitrary excitation by shifting, scaling and summation of the optimized control strategy. Numerical tests are carried out on a two-degree of freedom quarter-vehicle model. The results demonstrate the effectiveness of using the proposed method for active suspension systems. In addition, it presents that the new method can achieve a real time control of systems subjected to an arbitrary excitation.
A Fuzzy Approach for Personalized Product Clustering with Flexible Discriminating Power
Authors: Bunthit Watanapa, Saowaluk Watanapa
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

This paper proposes an improved linguistic quantifier that operates with penalty function so that a set of products can be clustered into hierarchical levels. The method is based on fuzzy approach with an aim at personalizing the display of products in an order of personal preference on a set of product attributes. The discriminating power of the system can be flexibly tuned via the set up of quantifier’s parameters and the penalty function. Numerical example is given for illustrating the computation, providing comparative results to the existing method and giving some technical insights.
Cross-organizational knowledge acquisition through flexible hiring and joint R&D: Insights from a survey in China
Authors: Rong Du, Shizhong Ai
Venue: Expert Systems with Applications: An International Journal (2008)

In this paper, we suggest that flexible hiring and joint research and development are two ways to acquire outside knowledge resources, which facilitate inter-organizational knowledge sharing and enable firms to overcome the constraints of internalized knowledge search in their innovation processes. We conducted a survey of 182 firms in Xi'an, China, which indicates that the majority of the surveyed firms have realized the importance of acquiring outside knowledge resources, and they are adopting flexible hiring policy and joint R&D strategy to make good use of outside knowledge resources. We then explore whether the two ways facilitate cross-organizational knowledge acquisition and inter-organization knowledge sharing, and hence contribute to effective innovations. We find that flexible hiring and joint R&D are effective ways to employ outside knowledge resources. Moreover, the effectiveness of innovations increases with both ways. These findings show that organizations can acquire outside knowledge resources to improve their innovations through flexible hiring and joint R&D.
EUD for enterprise process and information management
Authors: Todor Stoitsev, Michael Spahn, Stefan Scheidl
Venue: Proceedings of the 4th international workshop on End-user software engineering (2008)

This position paper presents research on End-User Development (EUD) for enterprise systems, which is aiming at improving the ability of Small and Medium Enterprises (SMEs) to adapt their software systems to individual and changing needs. These research efforts can be divided into two main directions: process-centric EUD and data-centric EUD. In particular, two basic sub-domains are addressed: (i) end-user driven business process composition and management as well as (ii) end-user driven composition of data-centric and analytic applications. Both topics are closely related since analytic applications may provide decision support in processes and processes may be the subject of analysis, e.g. for process optimization purposes. Advances in these research topics are presented through a brief overview of the developed concepts.
On termination detection in crash-prone distributed systems with failure detectors
Authors: Neeraj Mittal, Felix C. Freiling, S. Venkatesan, Lucia Draque Penso
Venue: Journal of Parallel and Distributed Computing (2008)

We investigate the problem of detecting termination of a distributed computation in systems where processes can fail by crashing. Specifically, when the communication topology is fully connected, we describe a way to transform any termination detection algorithm A that has been designed for a failure-free environment into a termination detection algorithm B that can tolerate process crashes. Our transformation assumes the existence of a perfect failure detector. We show that a perfect failure detector is in fact necessary to solve the termination detection problem in a crash-prone distributed system even if at most one process can crash. Let @m(n,M) and @d(n,M) denote the message complexity and detection latency, respectively, of A when the system has n processes and the underlying computation exchanges M application messages. The message complexity of B is O(n+@m(n,0)) messages per failure more than the message complexity of A. Also, its detection latency is O(@d(n,0)) per failure more than that of A. Furthermore, application message size increases by at most log(f+1) bits, where f is the actual number of processes that fail during an execution. We show that, when the communication topology is fully connected, under certain realistic assumption, any fault-tolerant termination detection algorithm can be forced to exchange @W(nf) control messages in the worst-case even when at most one process may be active initially and the underlying computation does not exchange any application messages. This implies that our transformation is optimal in terms of message complexity when @m(n,0)=O(n). The fault-tolerant termination detection algorithm resulting from the transformation satisfies three desirable properties. First, it can tolerate the failure of up to n-1 processes. Second, it does not impose any overhead on the fault-sensitive termination detection algorithm until one or more processes crash. Third, it does not block the application at any time. Further, using our transformation, we derive a fault-tolerant termination detection algorithm that is the most efficient fault-tolerant termination detection algorithm that has been proposed so far to our knowledge. Our transformation can be extended to arbitrary communication topologies provided process crashes do not partition the system.
Building a secure star schema in data warehouses by an extension of the relational package from CWM
Authors: Emilio Soler, Juan Trujillo, Eduardo Fernández-Medina, Mario Piattini
Venue: Computer Standards Interfaces (2008)

Data Warehouses (DWs) are widely accepted as the core of current decision support systems. Therefore, it is vital to incorporate security requirements from the early stages of the DWs projects and enforce them in the further design phases. Very few approaches specify security and audit measures in the conceptual modeling of DWs. Furthermore, these security measures are specified in the final implementation on top of commercial systems as there is not a standard relational representation of security measures for DWs (i.e. the well-known star schema does not allow us to specify security and audit measures on its multidimensional representation of data; instead, they must be specified on top of the implemented relational tables). On the other hand, the Common Warehouse Metamodel (CWM) has been accepted as the standard for the exchange and the interoperability of metadata. Nevertheless, it does not allow us to specify security measures for DWs. In this paper, we make use of the own extension mechanisms provided by the CWM to extend the relational package in order to build a star schema that represents the security and audit rules captured during the conceptual modeling phase of DWs. Finally, in order to show the benefits of our extension, we apply it to a case study related to the management of the pharmacy consortium business.
Performance Evaluation of an ANN FF Classifier of Raw EEG Data using ROC Analysis
Authors: Miguel Antonio Sovierzoski, Fernando Mendes de Azevedo, Fernanda Isabel Marques Argoud
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Due to the increasing use of intelligent and automated systems, pattern, event or signal classification is becoming more important, representing a research area under expansion. The classifier systems indicate results comparable to human classification, or human intervention, with substantial reduction of time and resources. This study presents a methodology for evaluation of an ANN performance using the ROC curve. The statistical performance indexes and the ROC curve are obtained during the supervised training of the ANN FF classifier. The methodology presented was used in the performance evaluation of an ANN classifier of epileptiform events in raw EEG data.
Maintenance goals of agents in a dynamic environment: Formulation and policy construction
Authors: Chitta Baral, Thomas Eiter, Marcus Bjäreland, Mutsumi Nakamura
Venue: Artificial Intelligence (2008)

The notion of maintenance often appears in the AI literature in the context of agent behavior and planning. In this paper, we argue that earlier characterizations of the notion of maintenance are not intuitive to characterize the maintenance behavior of certain agents in a dynamic environment. We propose a different characterization of maintenance and distinguish it from earlier notions such as stabilizability. Our notion of maintenance is more sensitive to a good-natured agent which struggles with an ''adversary'' environment, which hinders her by unforeseeable events to reach her goals (not in principle, but in case). It has a parameter k, referring to the length of non-interference (from exogenous events) needed to maintain a goal; we refer to this notion as k-maintainability. We demonstrate the notion on examples, and address the important but non-trivial issue of efficient construction of maintainability control functions. We present an algorithm which in polynomial time constructs a k-maintainable control function, if one exists, or tells that no such control is possible. Our algorithm is based on SAT Solving, and employs a suitable formulation of the existence of k-maintainable control in a fragment of SAT which is tractable. For small k (bounded by a constant), our algorithm is linear time. We then give a logic programming implementation of our algorithm and use it to give a standard procedural algorithm, and analyze the complexity of constructing k-maintainable controls, under different assumptions such as k=1, and states described by variables. On the one hand, our work provides new concepts and algorithms for maintenance in dynamic environment, and on the other hand, a very fruitful application of computational logic tools. We compare our work with earlier works on control synthesis from temporal logic specification and relate our work to Dijkstra's notion of self-stabilization and related notions in distributed computing.
Visualizing stress in silicon micro cantilevers using scanning confocal Raman spectroscopy
Authors: M. Bauer, A. M. Gigler, C. Richter, R. W. Stark
Venue: Microelectronic Engineering (2008)

We report on the determination of surface stress in a resonantly oscillating silicon micro cantilever using confocal Raman spectroscopy. Focusing on the optical phonon line of silicon allows one to determine the lateral distribution of mechanical stress. However, the Raman shift caused by mechanical stress can be concealed by thermally induced Raman shifts and line-broadenings. Both effects are intrinsic to the micro Raman measurement which uses a strongly focused laser beam in a confocal microscope. In order to unravel the different contributions, we use a practical analytical method for the compensation based on reference measurements on a heated silicon wafer of the same crystal orientation. As an example, the structure of the micro cantilever was specially weakened by introducing a rectangular hole in the center of the lever. After compensation of the thermally induced shift, the true mechanical stress can be visualized as shown for a stress maximum of the cantilever driven at its second flexural eigenmode.
The geometry of graphs and some of its algorithmic applications
Authors: N. Linial
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We explore some implications of viewing graphs as geometric objects. This approach offers a new perspective on a number of graph-theoretic and algorithmic problems. There are several ways to model graphs geometrically and our main concern here is with geometric representations that respect the metric of the (possibly weighted) graph. Given a graph G we map its vertices to a normed space in an attempt to (i) Keep down the dimension of the host space and (ii) Guarantee a small distortion, i.e., make sure that distances between vertices in G closely match the distances between their geometric images. We develop efficient algorithms for embedding graphs low-dimensionally with a small distortion.
Determination of stress build-up during nanoimprint process in triangular polymer structures
Authors: I. Fernandez-Cuesta, X. Borrisé, A. Retolaza, S. Merino, D. -A. Mendels, O. Hansen, A. Kristensen, F. Pérez-Murano
Venue: Microelectronic Engineering (2008)

Nanoimprint process in polymers may cause internal stress accumulation in the imprinted structures that can affect their quality, leading to defects or even fatal cracks. Relaxation effects can also diminish the long term stability of the imprinted features. In this work, direct strain related to residual stress has been characterized by high resolution AFM measurements in triangular shaped lines imprinted in PMMA 50k at different conditions. Finite elements simulations are in agreement with the experimental observations, and facilitate results interpretations. Relaxation effects have been also studied.
Distributed Interactions with Wireless Sensors Using TinySIP for Hospital Automation
Authors: Sudha Krishnamurthy, Lajos Lange
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

In order to seamlessly interact with everyday objects embedded with wireless sensors, we need diverse messaging abstractions that support convenient application-level interactions with sensor nodes. We have developed TinySIP with the goal of providing a unifying messagingprotocol that not only supports distributed interactions among sensor nodes but also enables users on a traditional network to interact with the sensor nodes through familiar devices, such as mobile phones and PDAs. TinySIP leverages the communication abstractions provided by the Session Initiation Protocol (SIP), but uses a more compact andenergy-efficient message format for communication withresource-constrained nodes. TinySIP supports interaction with sensor nodes using publish-subscribe, instant messaging, and session-based semantics. We have implemented the TinySIP messaging library on Zigbee motesrunning TinyOS. In this paper, we describe a prototype application that we have developed that illustrates the use of TinySIP for interacting with sensor nodes, in order to automate processes in a hospital environment. Despite the diversity of sensor network applications and the heterogeneity of the sensor-generated data, ourexample shows that typical sensor-based interactions can be supported through a set of common communication abstractions. Hence, using a standard application-level messaging protocol, like TinySIP, that supports a common set of communication abstractions which can be used in a variety of sensor-based interactions will benefitsensor network application developers and users.
Personalized Negotiation Based on Individualization: Incorporating Personalization into Peer-to-Peer System
Authors: Javed I. Khan, Kailas B. Bobade, Manas S. Hardas
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

In peer-to-Peer system user has control over what information about her could be released; however, inherent untrustworthiness of peers precludes her from deciding when, how and to what extent such information could be released. We have investigated a framework where users can personalize their information release policies. As opposed to simple request-response based communication, such individualization inherently necessitates a mechanism of negotiation. This mechanism of negotiation helps user to establish partial or full trust and based on these trust levels, user can release necessary information. To facilitate such individualization, we have presented negotiation enabled framework. In this paper, we provide extension to this work which facilitates selection of negotiation flavor on per-need-basis i.e. Personalized Negotiation. This is supported by negotiation protocol which defines the ordering of the messages and unique message structure that carries negotiation information.
Application of NASIR flow-solver for finite volume solution of wind effects on a set of cooling tower
Authors: S. R. Sabbagh Yazdi, B. Haghighi, M. Torbati
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

Computer simulation of wind flow around a set of three cooling towers in the KAZERUN power station, which are under construction in south part of IRAN is presented in this paper. A Numerical Analyzer for Scientific and Industrial Requirements (NASIR) is developed to investigate the wind effects on structural surfaces of these towers with particular arrangement. This software which solves incompressible Euler equations for steady flow on unstructured finite volumes facilitates considering special treatments required for practical problems, like open louvers on cooling towers footing. In this model, the equation of continuity can be simultaneously solved with the equations of motion in a coupled manner for the steady state problems by application of the pseudo compressibility technique. This technique helps coupling the pressure and the velocity fields during the explicit computation procedure of the incompressible flow problems and therefore speeds up the convergence of the solution. The discrete form of the three-dimensional flow equations are formulated using the Cell Vertex Finite Volume Method for unstructured mesh of tetrahedral cells. Using unstructured meshes provides great flexibility for modeling the flow in geometrically complex domains. The computed results are presented in terms of color coded maps of pressure and velocity fields as well as velocity vectors on boundary surfaces of the solution domain.
Knowledge Based Radar Detection, Tracking and Classification (Adaptive and Learning Systems for Signal Processing, Communications and Control Series)
Authors: Fulvio Gini, Muralidhar Rangaswamy
Venue:  (2008)

* The first book to deal with key technology for the next generation of radar systems with important military and homeland defence applications. * Knowledge-based techniques are widely considered by the radar community to represent the key area of advancement for the next generation of radar systems. * The editors and contributors are all active researchers and leaders in the field. * Brings together concepts inherent to the application of KBS for radar detection, tracking, classification, and scheduling.
Optimal relay assignment for cooperative communications
Authors: Yi Shi, Sushant Sharma, Y. Thomas Hou, Sastry Kompella
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising approach to achieve spatial diversity. Under this communication paradigm, the choice of relay node plays a significant role in the overall system performance. In this paper, we study the relay node assignment problem in a network environment, where multiple source-destination pairs compete for the same pool of relay nodes in the network. The main contribution of this paper is the development of a polynomial time algorithm to solve this problem. A key idea in this algorithm is a "linear marking" mechanism, which is able to offer a linear complexity for each iteration. We give a formal proof of optimality for this algorithm. We also show several attractive properties associated with this algorithm.