ppxscal/embedding_network huggingface dataset:
Analysis of System-Failure Rate Caused by Soft-Errors using a UML-Based Systematic Methodology in an SoC
Authors: Mohammad Hosseinabady, M. H. Neishaburi, Zainalabedin Navabi, Alfredo Benso, Stefano Di Carlo, Paolo Prinetto, Giorgio Di Natale
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

This paper proposes an analytical method to assess the soft-error rate (SER) in the early stages of a System-on-Chip (SoC) platform-based design methodology. The proposed method gets an executable UML (Unified Modeling Language) model of the SoC and the raw softerror rate of different parts of the platform as its inputs. Soft-errors on the design are modeled by disturbances on the value of attributes in the classes of the UML model and disturbances on opcodes of software cores. The Dynamic behavior of each core is used to determine the propagation probability of each variable disturbance to the core outputs. Furthermore, the SER and the execution time of each core in the SoC and a Failure Modes and Effects Analysis (FMEA) that determines the severity of each failure mode in the SoC are used to compute the System-Failure Rate (SFR) of the SoC.
AGOL: An Aspect-Oriented Domain-Specific Language for MAS
Authors: Mercedes Amor, Alessandro Garcia, Lidia Fuentes
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Specific features of Multi-Agent Systems (MAS), such as autonomy, learning, mobility, coordination, are driving development concerns, which make evident the need for new design abstractions. Up to now, agentoriented modeling languages have delivered basic MAS design abstractions - such as goals and actions - that explicitly tackle some of these concerns. However, the modularization of a plethora of fundamental MAS features has been hindered throughout the software lifecycle. This paper presents a methodological framework to address enhanced modularity and traceability of such crosscutting concerns in MAS development. Our design framework is mainly rooted at the proposition of a new domain-specific language, called AGOL. In addition, the proposed framework is supported by a bench of transformation rules of AGOL artifacts, which can be effectively used to derive agent implementations in two concrete aspect-oriented implementation platforms, namely AspectT and Malaca.
The diameter of randomly perturbed digraphs and some applications
Authors: Abraham D. Flaxman, Alan M. Frieze
Venue: Random Structures Algorithms (2007)

The central observation of this paper is that if εn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter &Oscr;(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL-complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R &sim; &Dopf;n,ε&#x002F;n we obtain a &ldquo;smoothed&rdquo; instance. We show that, with high probability, a log-space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL &nsubE; almost-L then no heuristic can recognize similarly perturbed instances of (s,t)-connectivity. Property Testing: A digraph is called k-linked if, for every choice of 2k distinct vertices s1,&hellip;,sk,t1,&hellip;,tk, the graph contains k vertex disjoint paths joining sr to tr for r = 1,&hellip;,k. Recognizing k-linked digraphs is NP-complete for k &ge; 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k-linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k-linked. &copy; 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007
Game-theoretic approaches for complex systems optimization
Authors: Robert L. Smith, Michael P. Wellman
Venue:  (2006)

A complex system is an artificial system that cannot be modeled analytically or optimized in an effective manner, usually because it possesses the following properties: (1) the system can only be modeled as a simulation, (2) the size of the problem is untenable, so that even if the system could be modeled analytically, it would be impractical to solve it exactly, (3) necessary information required for problem solving is distributed in nature. This thesis presents methods for modeling and optimizing systems with the above challenging properties. We first discuss the important modeling decision of whether to include stochasticity. By employing a real-world case study, we show that a standard numerical procedure can indeed help us make this decision. Next, we use the challenging problem of finding coordinated signal timing plans to motivate the need of a new paradigm for simulation optimization. We employ the game-theoretic paradigm of sampled fictitious play (SFP) to iteratively converge to a locally optimal solution. The key to the empirical success of SFP is parallelization. Through parallelization, SFP is robustly scalable to realistic size networks modeled with high-fidelity simulations. Compared to other less adaptive approaches, significant savings are achieved. This procedure is standardized so that we can use it to solve many unconstrained discrete optimization problems. However, for constrained problems, additional effort is required in using SFP. We introduce the idea of feasible space mapping which, when combined with SFP, can be used in decomposing and approximating large-scale dynamic programming models. With a large scale decision making problem in automotive manufacturing, we demonstrate that high quality solutions can be obtained by this approach in several orders of magnitude faster time than the traditional global algorithm. Finally, for distributed problems, we address the decentralization issue with a market-based approach. The market-based approach involves: (1) agent strategy development, (2) empirical game-theoretic analysis, (3) assessing efficiency of the solution obtained by the market-based approach. We first introduce the market-based approach, with special attention on the strategy-pruning techniques. We then use task allocation for dynamic information processing environments as an example to illustrate the methodology and demonstrate its effectiveness.
Energy behavior of java applications from the memory perspective
Authors: N. Vijaykrishnan, M. Kandemir, S. Kim, S. Tomar, A. Sivasubramaniam, M. J. Irwin
Venue: Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1 (2001)

With the anticipated dramatic growth of computing devices for mobile and embedded environments, energy conscious hardware and software design has taken center-stage together with performance. At the same time, there is an increasing need to provide a portable and seamless software environment for application development and interoperability. This paper takes an important step in the confluence of these two emerging trends, by examining the energy behavior of the memory system in the execution of Java applications. It is crucial to understand and optimize the energy behavior of the memory system since instructions referencing memory can contribute to a large fraction of the energy consumption when executing Java applications. Using an off-the-shelf JVM, a validated memory energy model, and a detailed simulator, this paper presents a characterization of the energy consumption by the cache and main memory when executing the SPEC JVM98 benchmarks in the JIT and interpreter modes. The energy consumption is profiled for the different hard-ware components (instruction cache, data cache, memory) and software components (class loading, garbage collection, dynamic compilation). The results from such a characterization are useful to the hardware designer for cache organizations and architectural enhancements for reducing energy consumption. They are also useful to the application and runtime system designer to identify energy bottlenecks, and for code restructuring or algorithm redesign to alleviate these bottlenecks.
A Password-Based Authentication and Key Establishment Scheme for Mobile Environment
Authors: Jun Liu, Jianxin Liao, Xiaomin Zhu
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

We propose a cost-effective, use-convenient, and well-performing password-based authentication and key establishment scheme by means of IC (integrated circuit) card, RSA cryptography, and discrete logarithm. There doesn't exist any verification (password) table at the server side. To be applicable for the mobile environment, the scheme is designed as a one-roundtrip protocol to reduce the communi-cation consumption over wireless channel. Moreover, the facts that users in this scheme are avoided downloading CRL (certificate revocation list) periodically and change the passwords in use without any interaction with servers over the radio are another two contributing factors to enhance the performance. Making use of queuing model M/G/1/N, we measure the performance of the scheme and compare it with TLS in terms of response time.
Globalizing Software Development in the Local Classroom
Authors: Ita Richardson, Sarah Moore, Daniel Paulish, Valentine Casey, Dolores Zage
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

Given the requirement for software engineering graduates to operate in Global Software Development (GSD) environments, educators need to develop teaching methods to enhance and instill GSD knowledge in their students. In this paper, we discuss two projects that provided students with a first-hand learning experience of working within GSD teams. One project was with Siemens Corporate Research, whose focus was to shadow the development of a real-life GSD project. The second project, whose focus was virtual team software testing, was carried out in collaboration with Ball State University. In parallel with these projects we undertook qualitative research during which we analyzed students' own written reflections and face-to-face interviews that focused on their learning experiences in these contexts. We identified three specific forms of learning which had taken place: pedagogical, pragmatic and the acquisition of specific globally distributed knowledge. Our findings confirm that mimicking real work settings has educational benefits for problem-based learning environments.
Cost-based Filtering for Shorter Path Constraints
Authors: Meinolf Sellmann, Thorsten Gellermann, Robert Wright
Venue: Constraints (2007)

Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest Path Problems with additional constraints. A well studied problem in this class is the Resource Constrained Shortest Path Problem. Reduction techniques are vital ingredients of solvers for the CSPP, that is frequently NP-hard, depending on the nature of the additional constraints. Viewed as heuristics, these techniques have not been studied theoretically with respect to their efficiency, i.e., with respect to the relation of filtering power and running time. Using the concepts of Constraint Programming, we provide a theoretical study of cost-based filtering for shorter path constraints on acyclic, on undirected, and on directed graphs that do not contain negative cycles. We then show empirically how reasoning about path-substructures in combination with CP-based Lagrangian relaxation can help to improve significantly over previously developed problem-tailored filtering algorithms for the resource constrained shortest path problem and investigate the impact of required-edge detection, undirected versus directed filtering, and the choice of the algorithm optimizing the Lagrangian dual.
Two-level microprocessor-accelerator partitioning
Authors: Scott Sirowy, Yonghui Wu, Stefano Lonardi, Frank Vahid
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

The integration of microprocessors and field-programmable gate array (FPGA) fabric on a single chip increases both the utility and necessity of tools that automatically move software functions from the microprocessor to accelerators on the FPGA to improve performance or energy. Such hardware/software partitioning for modern FPGAs involves the problem of partitioning functions among two levels of accelerator groups -- tightly-coupled accelerators that have fast single-clock-cycle memory access to the microprocessor's memory, and loosely-coupled accelerators that access memory through a bridge to avoid slowing the main clock period with their longer critical paths. We introduce this new two-level accelerator-partitioning problem, and we describe a novel optimal dynamic programming algorithm to solve the problem. By making use of the size constraint imposed by FPGAs, the algorithm has what is effectively quadratic runtime complexity, running in just a few seconds for examples with up to 25 accelerators, obtaining an average performance improvement of 35% compared to a traditional single-level bus architecture.
On Ostrowski type inequalities for Stieltjes integrals with absolutely continuous integrands and integrators of bounded variation
Authors: P. Cerone, W. S. Cheung, S. S. Dragomir
Venue: Computers Mathematics with Applications (2007)

Some Ostrowski type inequalities are given for the Stieltjes integral where the integrand is absolutely continuous while the integrator is of bounded variation. The case when |f^'| is convex is explored. Applications for the mid-point rule and a generalised trapezoid type rule are also presented.
Inter-glow: interaction by controlling light
Authors: Takuji Narumi, Atsushi Hiyama, Tomohiro Tanikawa, Michitaka Hirose
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

inter-glow is a system that facilitates close interaction and communication among users in real spaces by using multiplexed visible-light communication technology. By pointing light to shine on an object contains an embedded photo sensor, users can get information about the object. In addition, several users can communicate with each other intimately by shining light on the object at the same time. We built a prototype to show the technology plain. In our prototype, when users shine lamps on a table in a miniature living room, the system recognizes which lamps are illuminated the table. According to the combination of illuminating lamps, the system produces family conversations.
Guiding team projects for juniors
Authors: T. W. Schultz, J. M. Jacob
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

A semester-long group project course is described. This course teaches design and project management to prepare students for a senior-level design course sequence carried out individually. The rationale for using groups (teams) and a Socratic design approach is discussed. The paper discusses the sequence of topics and activities over the semester including team-building exercises, group in-class exercises, group lab exercises, design review sessions and lectures. The final product evaluation time is discussed. Group dynamics and personality problems as well as final evaluations are also presented. The students' performance relative to others not having taken the course cannot be evaluated at this time since this group of students has not completed the senior design courses. The teachers' assessments are given as well as plans for future changes.
Coverage Based Intercluster Communication for Load Balancing in Wireless Sensor Networks
Authors: Nauman Israr, Irfan Awan
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Wireless Sensor Networks (WSNs) monitors changes in the operational environment and collaborate to actuate distributed tasks in dynamic uncertain and hostile environments. The biggest constraint of these networks is short life time. In this context, various schemes have been presented in order to improve the life time of these networks and to overcome the energy constraint. This paper presents a new cluster based routing algorithm to address the traditional problem of load balancing and energy efficiency in the WSNs. The proposed algorithm makes use of the nodes in a sensor network whose area coverage is covered by the neighboring nodes and marks these nodes as temporary cluster heads. These temporary cluster heads are later used for multihop intercluster communication. Performance studies indicate that the proposed algorithm solves effectively the problem of load balancing across the network and is more energy efficient compared to standard Leach and the enhanced version of Leach algorithms.
Online Web Cluster Capacity Estimation and Its Application to Energy Conservation
Authors: Chang-Hao Tsai, Kang G. Shin, John Reumann, Sharad Singhal
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Designers of data centers and Web servers aim to make on-demand allocation of resources to clients in order to lower the deployment cost of hosted services. Moreover, they must also minimize operating costs, such as energy consumption, by matching service-capacity demand with resource supply. However, since the term "capacity” is typically defined vaguely or inadequately, it is difficult to assess resource needs and, hence, servers, which are several times larger than needed at runtime, are usually deployed. The time-varying nature of the workload model further complicates the problem and necessitates an online capacity-estimation solution. To address this overprovisioning problem, we first define the capacity of a server cluster as the sustainable throughput subject to a request retransmission ratio constraint and then analyze different approaches to capacity estimation in a running system. Various capacity-estimation mechanisms, such as offline benchmarking and CPU-utilization evaluation, are discussed and compared with our queue-monitoring method. We employ several different data-collection methods (application instrumentation, user-space tools, Simple Network Management Protocol (SNMP), and kernel modules) to compare their effects on estimation accuracy. Of these, queue monitoring is found to provide a good and stable estimate of server capacity. To validate this finding, we propose a simple cluster-resizing mechanism and evaluate the energy-conservation performance. A good combination of data collection and online capacity estimation is found to make significantly more energy savings than traditional approaches (that is, static estimation and scheduled capacity). Our experimental results show that more than 40 percent of energy can be saved for regular daily usage patterns without any prior knowledge of the workload and that long start-up and shutdown delays affect energy savings considerably.
User-Assisted Parameterization of Polygonal Grids
Authors: Xianli Xu, Tianding Chen
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Surface parameterization is a fundamental problem in computer graphics. It is very useful in many applications such as texture mapping, texture synthesis, interactive 3D painting, remeshing, multi-resolution analysis, and mesh compression. However, previous parameterization methods automatically and globally balanced the distortion of area or angle in the embedding functions. Such a parameterization may have low distortions but might not be suitable for some applications, such as remeshing. This paper describes a novel, user interactive framework for mesh parameterization. It presents a framework that allows users to locally adjust the parameterization intending to improve the perceptual quality of remeshing. Experiment results show such parameterizations provide better quality and computing rapidly for remeshing.
Lyapunov-Based Design of iISS Feedforward Systems with Uncertainty and Noisy Measurements
Authors: Stefano Battilotti
Venue: SIAM Journal on Control and Optimization (2007)

We study the problem of achieving integral input to state stability (iISS) with respect to noise for a class of upper triangular nonlinear systems with uncertainty and measurement noise. We propose a novel step-by-step Lyapunov-based design, consisting of (1) splitting an $n$-dimensional system into $n$ one-dimensional systems, each with its own state, inputs, and measurement, (2) constructing a one-dimensional measurement feedback controller for each one-dimensional system, according to a certainty equivalence principle, and (3) selecting the parameters of these controllers so that their interconnection gives a measurement feedback controller for the $n$-dimensional system. The stability analysis is performed through filtered Lyapunov functions, which are Lyapunov functions with parameters being the output of suitable dynamical filters.
Human Daily Behavior Based Simulation for Epidemic Transmission: A Case Study of SARS
Authors: Jieping Zhou, Jianhua Gong, Wenhang Li
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Childbirth education is beneficial to pregnant woman and her family members. It's also important for doctors and nurses who will be engaged in labor. For childbirth education, the most significant task is to show mechanism of labor. Because it is associated with the fetus within the uterus of pregnant woman, overall representation of mechanism of labor is difficult. Traditional methods, such as pictures, models, etc, limited. As a popular tool for simulation, virtual reality is introduced to solve the puzzle. Simulation of labor using virtual reality can represent the mechanism of labor with levels of interactivity and dynamics clearly. As two critical points of labor simulation, model construction and movement simulation, are expatiated in detail.
A coherent approach to broadband matched-field processing: application in the Hudson Canyon
Authors: M. B. Porter
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

In matched-field processing, sophisticated models of the ocean channel are used to provide accurate steering vectors. These steering vectors are then used with standard beamformers (conventional, MVDR, etc.). The Hudson Canyon data set is one of a few publicly available data sets in a form directly suitable for matched-field processing. Using these data we show successful tracking out to a range of 5 km. Exploitation of broadband information is critical for that processing. However, we show that the MVDR processor is only successful when the broadband information is exploited coherently.
Edge adaptive restoration of noisy, blurred images
Authors: G. J. Foster
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

We present a method to find the mean square estimate of the original image using a Gauss-Markov image model and a known point spread function. The performance of the edge adaptive technique compares favorably to the Wiener filter on synthetic and real images with mild linear (motion) blur and additive white Gaussian noise.