ppxscal/embedding_network huggingface dataset:
Retrospective Analysis for Mining the Causes in Manufacturing Processes
Authors: Kwok-Pan PANG, Shawkat ALI
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

There has been a considerable growth in the use of Statistical Process Control (SPC) for improving the quality in business, industries, or software development since the last decade. However, the processes are growing much more complex, and there is a tremendous increase of data size owning to the use of automated record machine. The conventional SPC tools become less effective in analyzing and identifying the cause of the process failures. This paper extends the idea of the Modified Centered CUSUMS, and proposes a new data selection procedure so that the associative discovery technique can be used in retrospective SPC analysis. Through our approach, the common data mining method (i.e. associative discovery) can be used to find the hidden knowledge from the data, and identify the causes of the process failure or success for the quality improvement. Besides, the hidden information that we extracted from the data can be used as supplement for the cause and effect diagram in the on-line process control.
Simplifying cyber foraging
Authors: Mahadev Satyanarayanan
Venue:  (2006)

The rapid proliferation of mobile handheld computing devices, such as cellphones and PDAs, has led to an unfortunate conflict. On one hand, we have light mobile computing devices that can be carried anywhere. However, on the other hand, these devices are frequently unable to execute applications that are of highest value to a mobile user such as language translators and speech recognizers. One way to resolve this conflict is to use cyber foraging ---utilize compute resources available in the environment to augment the capabilities of mobile devices. A key challenge in enabling cyber foraging is that there exist many applications of high value to a mobile user that must be quickly, easily, and effectively retargeted to support cyber foraging. This retargeting is made more difficult as applications can be written in any programming language and style. In this thesis, quickly refers to the retargeting time, easily refers to the retargeting effort, and effectively refers to the retargeted application's runtime performance. This dissertation shows that it is possible to quickly, easily, and effectively retarget computationally-intensive useful applications for cyber foraging. I developed a process called RapidRe that allows even novice developers to easily, quickly, and effectively retarget large unfamiliar applications for cyber foraging. To create RapidRe, I first developed a powerful remote execution system, called Chroma, that is able to achieve excellent application performance in mobile environments. Chroma uses the concept of tactics to greatly reduce its search space when deciding the optimal remote partitioning of applications. Tactics are enumerations of the useful application partitionings. At runtime, Chroma picks the tactics that would have the optimal performance for the given resource environment and user preferences. I then developed a domain-specific language, called Vivendi, that allows developers to specify the adaptive characteristics of an application that are relevant for mobile computing. These characteristics include the parameters, fidelity variables, and tactics of the application. The parameters give hints about the expected application resource usage. These hints are used by Chroma to decide the optimal tactic. The fidelity variables are application settings that Chroma must set based on the available resources. Finally, tactics are described in two parts; the first part is the list of application procedures that can be remotely executed and the second is the possible ways to combine these procedures to do useful work. (Abstract shortened by UMI.)
Provenance in Agent-Mediated Healthcare Systems
Authors: Tamas Kifor, Laszlo Z. Varga, Javier Vazquez-Salceda, Sergio Alvarez, Steven Willmott, Simon Miles, Luc Moreau
Venue: IEEE Intelligent Systems (2006)

This article is part of a special issue on Intelligent Agents in Healthcare. Healthcare information systems can use agent-oriented cooperation techniques and standardized, electronic healthcare-record-exchange protocols to combine information about the different facets of a patient's therapy provided by different healthcare providers at different locations. Provenance is an innovative approach to tracing events in complex distributed processes. It also traces dependencies between such events and associated decisions by human actors. This article focuses on three aspects of provenance in agent-mediated healthcare systems. First, it defines provenance and shows how to apply it in agent-mediated healthcare applications. Second, it introduces a method that lets independent, autonomous healthcare agents that don't directly interact document their processes. Third, it shows how this approach helps institutions contend with privacy issues.
Solving bound constrained optimization via a new nonmonotone spectral projected gradient method
Authors: Zhensheng Yu
Venue: Applied Numerical Mathematics (2008)

In this paper, by introducing a new nonmonotone line search technique and combining it with the spectral projected gradient method, we propose a solution method for solving the bound constrained optimization problems. Under mild conditions, we obtain the global convergence even without requiring a prior of the existence of a limit point. Numerical tests are also given to show the efficiency of the proposed method.
Creativity as a pathway to computer science
Authors: Maria Knobelsdorf, Ralf Romeike
Venue: ACM SIGCSE Bulletin (2008)

The study presented in this paper explores characteristics of creativity and the question whether creativity forms a possible pathway into the field of Computer Science (CS). For this purpose, we analyze computing experiences of students majoring in CS and Bioinformatics. The study is part of two research projects exploring creativity in CS Education and students' pathways to CS.
Using group-based projects to improve retention of students in computer science major
Authors: Jiang Guo
Venue: Journal of Computing Sciences in Colleges (2008)

Some research indicated that degree completion rates had decreased as compared with 10 years ago. To address this disparity, we have developed an approach to improve retention of students to increase the graduation rate of students in computer science major while enhancing their learning experience. The group-based collaborative research will not only improve student performance, but also will increase student motivation, confidence and resilience. This paper discusses our small-group-based approach to provide students in their early undergraduate years on the CSULA campus. We provide three software development groups for students to join. Each of group is headed by a graduate teaching assistant under the supervision of the faculty.
Fairness in multi-agent systems
Authors: Steven de Jong, Karl Tuyls, Katja Verbeeck
Venue: The Knowledge Engineering Review (2008)

Multi-agent systems are complex systems in which multiple autonomous entities, called agents, cooperate in order to achieve a common or personal goal. These entities may be computer software, robots, and also humans. In fact, many multi-agent systems are intended to operate in cooperation with or as a service for humans. Typically, multi-agent systems are designed assuming perfectly rational, self-interested agents, according to the principles of classical game theory. Recently, such strong assumptions have been relaxed in various ways. One such way is explicitly including principles derived from human behavior. For instance, research in the field of behavioral economics shows that humans are not purely self-interested. In addition, they strongly care about fairness. Therefore, multi-agent systems that fail to take fairness into account, may not be sufficiently aligned with human expectations and may not reach intended goals. In this paper, we present an overview of work in the area of fairness in multi-agent systems. More precisely, we first look at the classical agent model, that is, rational decision making. We then provide an outline of descriptive models of fairness, that is, models that explain how and why humans reach fair decisions. Then, we look at prescriptive, computational models for achieving fairness in adaptive multi-agent systems. We show that results obtained by these models are compatible with experimental and analytical results obtained in the field of behavioral economics.
Marine Wireless Sensor Networks: Challenges and Applications
Authors: Ahmed M. Mahdy
Venue: Proceedings of the Seventh International Conference on Networking (2008)

Current research on wireless sensor networks is based on the assumption that these networks are deployed in a terrestrial environment. Relevant protocols and design specifications are developed under this condition. This makes the deployment of currently existing wireless sensor networks in marine environments extremely challenging. We present major challenges and applications of underwater wireless sensor networks focusing on their military aspect. The paper addresses the army’s immediate needs for secure agile broadband communications for future digital battlefields emphasizing the role of marine sensors. A novel architecture for broadband ad hoc and sensor networks that can provide warfighters with a secure on-the-move means for high-capacity communications is proposed. The architecture is designed with the role of ad hoc and sensor networks in future warfare scenarios and anticipated demand for broadband applications.
Remarks on the existence and uniqueness of the solutions to stochastic functional differential equations with infinite delay
Authors: Yong Ren, Shiping Lu, Ningmao Xia
Venue: Journal of Computational and Applied Mathematics (2008)

In this paper, we obtain some results on the existence and uniqueness of solutions to stochastic functional differential equations with infinite delay at phase space BC((-~,0];R^d) which denotes the family of bounded continuous R^d-value functions @f defined on (-~,0] with norm @?@f@?=sup"-"~"
A High-Quality High-Fidelity Visualization of the September 11 Attack on the World Trade Center
Authors: Paul Rosen, Voicu Popescu, Christoph Hoffmann, Ayhan Irfanoglu
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

In this application paper we describe the efforts of a multi-disciplinary team towards producing a visualization of the September 11 Attack on the North Tower of New York's World Trade Center. The visualization was designed to meet two requirements. First, the visualization had to depict the impact with high fidelity, by closely following the laws of physics. Second, the visualization had to be eloquent to a non-expert user. This was achieved by first designing and computing a finite element analysis (FEA) simulation of the impact between the aircraft and the top 20 stories of the building, and then by visualizing the FEA results with a state-of-the-art commercial animation system. The visualization was enabled by an automatic translator that converts the simulation data into an animation system 3D scene. We built upon a previously developed translator. The translator was substantially extended to enable and control visualization of fire and of disintegrating elements, to better scale with the number of nodes and number of states, to handle beam elements with complex profiles, and to handle smoothed particle hydrodynamics liquid representation. The resulting translator is a powerful automatic and scalable tool for high-quality visualization of FEA results.
SimGrid: A Generic Framework for Large-Scale Distributed Experiments
Authors: Henri Casanova, Arnaud Legrand, Martin Quinson
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Distributed computing is a very broad and active research area comprising fields such as cluster computing, computational grids, desktop grids and peer-to-peer (P2P) systems. Unfortunately, it is often impossible to obtain theoretical or analytical results to compare the performance of algorithms targeting such systems. One possibility is to conduct large numbers of back-to-back experiments on real platforms. While this is possible on tightly-coupled platforms, it is infeasible on modern distributed platforms as experiments are labor-intensive and results typically not reproducible. Consequently, one must resort to simulations, which enable reproducible results and also make it possible to explore wide ranges of platform and application scenarios. In this paper we describe the SimGrid framework, a simulation-based framework for evaluating cluster, grid and P2P algorithms and heuristics. This paper focuses on SimGrid v3, which greatly improves on previous versions thanks to a novel and validated modular simulation engine that achieves higher simulation speed without hindering simulation accuracy. Also, two new user interfaces were added to broaden the targeted research community. After surveying existing tools and methodologies we describe the key features and benefits of SimGrid.
Efficient Scheduling Schemes for Sabotage-Tolerance in Volunteer Computing Systems
Authors: Son Hong Ngo, Masaru Fukushi, Xiaohong Jiang, Susumu Horiguchi
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Volunteer computing is very promising to build large scale parallel computing systems from enormous number of computers over the Internet. In a volunteer computing system, sabotage-tolerance is an important issue because there may be malicious users on the Internet who sabotage system by intentionally submitting erroneous results. In this paper, we consider the task scheduling problem of volunteer computing systems which implement sabotage-tolerance mechanism. Although existing sabotage-tolerance mechanisms can guarantee the requirement of credibility for computing results, however, such mechanisms always cause a high performance slowdown in terms of overall execution time. In this paper, we propose an efficient scheduling mechanism called Priority Round Robin (PRR) that takes into account the computing capacity of each volunteer computer. By grouping volunteer computers that have similar computing capacity, the PRR scheduling mechanism can help to reduce overall execution time in comparison with the conventional Round Robin (RR) scheduling, as shown by our extensive simulation results.
Cross-Layer Optimization for Data Rate Utility Problem in UWB-Based Ad Hoc Networks
Authors: Yi Shi, Y. Thomas Hou, Hanif D. Sherali
Venue: IEEE Transactions on Mobile Computing (2008)

There is growing interest in employing ultra-wideband (UWB) communication systems at the physical layer for multi-hop wireless networks. Recent efforts show that networking problems involving UWB systems should follow a cross-layer approach with consideration at multiple layers. Due to the non-linear nature of the optimization problem, there are very limited theoretical results for this important problem. In this paper, we address this problem by considering a UWB-based ad hoc network. We study how to maximize capacity (in the form of a data rate utility) for a set of communication sessions. Via a cross-layer approach, we formulate this utility maximization problem into a nonlinear programming (NLP) problem, which takes into consideration routing, scheduling, and power control. We develop a solution procedure based on the so-called branch-and-bound framework. Within this framework, we employ a powerful optimization technique called reformulation linearization technique (RLT). We use numerical results to validate the efficacy of this solution procedure and offer insights on UWB-based ad hoc networks. This work provides a theoretical result for the achievable performance bound for a UWB-based ad hoc network.
Fabrication of ultra high aspect ratio Bragg gratings for optical filter
Authors: Stefano Sardo, Fabrizio Giacometti, Sergio Doneda, Umberto Colombo, Davide Crippa, Melissa Di Muri, Antonio Fiorino, Audrey Garnier, Romano Morson, Alessandro Nottola, Giorgio Zuliani, Massimo Gentili, Marco Romagnoli
Venue: Microelectronic Engineering (2008)

In this paper a novel process for fabrication of high finesse and large spectral range integrated optics filtering structure for optical communication applications is presented. The technology approach used in the fabrication make use of glass-on-silicon substrates and comprise deep submicron ultra-high aspect ratio Bragg gratings which are deeply buried into the waveguide glass materials.
A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed
Authors: A. I. Barvinok
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

We prove that for any dimension d there exists a polynomial time algorithm for counting integral points in polyhedra in the d-dimensional Euclidean space. Previously such algorithms were known for dimensions d=1,2,3, and 4 only.
Effective RTL Method to Develop On-Line Self-Test Routine for the Processors Using the Wavelet Transform
Authors: Amin Asghari, Seied Ahmad Motamedi, Sepehr Attarchi
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

In this paper, we introduce a new efficient register transfer level (RTL) method to develop on-line self-test routines. We consider some prioritizations to select the components and instructions of the processor. In addition, we choose test patterns based on spectral RTL test pattern generation (TPG) strategy. For the purpose of spectral analysis, we use the wavelet transform. Also, we use a few extra instructions for the purpose of the signature monitoring to detect control flow errors. We demonstrate that the combination of these three strategies is effective for developing small test programs with high fault coverage in a small test development time. In this case, we only need the instruction set architecture (ISA) and RTL information. Our method not only provides a simple and fast algorithm for on-line self-test applications, also gains the advantages of utilizing lower memory and reducing the test generation time complexities in comparison with proposed methods so far. We focus on the application of this approach for Parwan processor. We develop a self-test routine using our proposed method for Parwan processor and demonstrate the effectiveness of our proposed methodology for on-line testing by presenting experimental results for Parwan processor.
Approximation schemes for constrained scheduling problems
Authors: L. A. Hall
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

Several constrained scheduling problems are considered. The first polynomial approximation schemes for the problem of minimizing maximum completion time in a two-machine flow shop with release dates and for the problem of minimizing maximum lateness for the single and parallel-machine problem with release dates are described. All of these algorithms are based upon the notion of an outline, a set of information with which it is possible to compute, with relatively simple procedures and in polynomial time, an optimal or near-optimal solution to the problem instance under consideration. Two related precedence-constrained scheduling problems are discussed, and new approximation results are presented.
On the Computability of Blochs Constant
Authors: Robert Rettinger
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

We prove the computability of Blochs constant by presenting the first algorithm for this constant.
Integro-differential polynomials and operators
Authors: Markus Rosenkranz, Georg Regensburger
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

We propose two algebraic structures for treating integral operators in conjunction with derivations: The algebra of integro-differential polynomials describes nonlinear integral and differential operators together with initial values. The algebra of integro-differential operators can be used to solve boundary problems for linear ordinary differential equations. In both cases, we describe canonical/normal forms with algorithmic simplifiers.
Rhetoric Online: Persuasion and Politics on the World Wide Web
Authors: Barbara Warnick
Venue:  (2007)

Rhetoric Online is a systematic examination of the forms and nature of Web-based public discourse in the fields of social activism, political campaigning, and other venues where rhetorical discourses are addressed to public audiences. Warnick develops and adapts existing rhetorical theories to the study of Web-based persuasive discourse in the public sphere.
What do we "mashup" when we make mashups?
Authors: Jeffrey Wong, Jason Hong
Venue: Proceedings of the 4th international workshop on End-user software engineering (2008)

This paper describes preliminary work in the uncovering of mashup patterns in order to find new directions for the design of mashup tools. We conducted a qualitative survey of high-quality mashups, as nominated in two popular mashup directories, and examined how the mashups made use of existing websites or improved upon them, how data from multiple websites were combined, and what kinds of user tasks these mashups might be suitable for. We describe a set of patterns what we found in our sample of mashups.
A Survey of Policy-Based Management Approaches for Service Oriented Systems
Authors: Tan Phan, Jun Han, Jean-Guy Schneider, Tim Ebringer, Tony Rogers
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Policy based management in Service Oriented Architecture (SOA) allows organizations to apply rules and regulations on their business processes. Policy has long been employed in the management of traditional distributed systems and many policy frameworks have been proposed. However,SOA differs in several aspects to traditional systems; thus, there is a unique set of requirements for an effective SOA policy system. In this paper, we evaluate five popular policy frameworks which are IETF, Ponder, KAoS, Rei and WS-Policy against a number of general and SOA-specific criteria to identify what features of these existing systems can be adopted for SOA and what are not. We then, based on their feature sets, discuss the applicability of the frameworks for SOA management.
Efficient spectral-Galerkin algorithms for direct solution of fourth-order differential equations using Jacobi polynomials
Authors: E. H. Doha, A. H. Bhrawy
Venue: Applied Numerical Mathematics (2008)

It is well known that for the discretization of the biharmonic operator with spectral methods (Galerkin, tau, or collocation) we have a condition number of O(N^8), where N is the number of retained modes of approximations. This paper presents some efficient spectral algorithms, for reducing this condition number to O(N^4), based on the Jacobi-Galerkin methods for fourth-order equations in one variable. The key to the efficiency of these algorithms is to construct appropriate base functions, which lead to systems with specially structured matrices that can be efficiently inverted. Jacobi-Galerkin methods for fourth-order equations in two dimension are considered. Numerical results indicate that the direct solvers presented in this paper are significantly more accurate at large N values than that based on the Chebyshev- and Legendre-Galerkin methods.