ppxscal/embedding_network huggingface dataset:
Heuristic algorithms for two-machine flowshop with availability constraints
Authors: Li-Man Liao, Chin-Hui Tsai
Venue: Computers and Industrial Engineering (2009)

The majority of the scheduling studies carry a common assumption that machines are available all the time. However, machines may not always be available in the scheduling period due to breakdown or preventive maintenance. Taking preventive maintenance activity into consideration, we dealt with the two-machine flowshop scheduling problem with makespan objective. The preventive maintenance policy in this paper was dependent on the number of finished jobs. The integer programming model was proposed. We combined two recent constructive heuristics, HI algorithm and H algorithm, with Johnson's algorithm, and named the combined heuristic H&J algorithm. We also developed a constructive heuristic, HD, with time complexities O(n^2). Based on the difference in job processing times on two machines, both H&J and HD showed good performance, and the latter was slightly better. The HD algorithm was able to obtain the optimality in 98.88% of cases. We also employed the branch and bound (B&B) algorithm to obtain the optimum. With a good upper bound and a modified lower bound, the proposed B&B algorithm performed significantly effectively.
Planning for software tool implementation: experience with Schemacode
Authors: Pierre N. Robillard, Réjean Plamondon
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

The interactive tool called Schemacode assists users in the development, documentation, and structured coding of programs. Its unique property of word-graphic type of communication can be of great help during the main phase of program development: defining the control structure of the program at different levels of refinement. A Schematic Pseudocode which represents the control skeleton of the program constitutes the very-high-level language input. Construction of the schematic structure and its translation into an appropriate language are the two main functions of Schemacode. These transformations involve editing, formatting, cross referencing, and structure checking. The use of a formal language appears only at the end of the development, after the logic of the problem has been solved. A real advantage provided by Schemacode is that every program developed has a unique up-to-date documentation and listing. However, modest changes are made in the way programming is done. An integration plan is specifically designed to minimize disturbances in the work milieu where Schemacode is to be implemented and is thus effected in three phases: creation first of a virtual environment, then of linked environment, and finally of an integrated environment. The virtual environment promotes the introduction of the methodology, the linked environment favors an interactive process for learning about the tool, and the integrated environment leads the new users to autonomous control of Schemacode.
Graph-based specification and simulation of featherweight Java with around advice
Authors: Tom Staijen, Arend Rensink
Venue: Proceedings of the 2009 workshop on Foundations of aspect-oriented languages (2009)

In this paper we specify an operational run-time semantics of Assignment Featherweight Java -- a minimal subset of Java with assignments -- with around advice, using graph transformations. We introduce a notion of correctness of our specification with respect to an existing semantics and claim a number of advantages over traditional mathematical notations, that come forth from the executable nature of graph-transformation-based semantics. Using test programs as graphs during specification of the semantics, simulation can help in verifying the correctness of the rules simply by testing, increasing the rigorousness of the specification process. Also, execution of the semantics results in a state space that can be used for analysis and verification, giving rise to an effective method for aspect program verification. As a criterion for correctness, we use a structural operational semantics of this language from the so-called Common Aspect Semantics Base.
Policy Evolution with Grammatical Evolution
Authors: Yow Tzu Lim, Pau Chen Cheng, John Andrew Clark, Pankaj Rohatgi
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

Security policies are becoming more sophisticated. Operational forces will often be faced with making tricky risk decisions and policies must be flexible enough to allow appropriate actions to be facilitated. Access requests are no longer simple subject access object matters. There is often a great deal of context to be taken into account. Most security work is couched in terms of risk management, but the benefits of actions will need to be taken into account too. In some cases it may not be clear what the policy should be. People are often better at dealing with specific examples than producing general rules. In this paper we investigate the use of Grammatical Evolution (GE) to attempt to infer Fuzzy MLS policy from decision examples. This approach couches policy inference as a search for a policy that is most consistent with the supplied examples set. The results show this approach is promising.
Realization of a bounded feedback in a nonlinear control problem
Authors: R. Gabasov, F. M. Kirillova, E. A. Ruzhitskaya
Venue: Cybernetics and Systems Analysis (2009)

We substantiate a method for design of a limited feedback to control a system whose mathematical model includes a nonlinear state function. Designing such a feedback is based on a positional solution of auxiliary optimal control problems which provides the transition from the vicinity of one equilibrium state to the vicinity of a new equilibrium state and stabilization of the system in the new state. Preassigned additional constrains on the trajectory of the control system are satisfied.
Probabilistic neural networks applied to mineral potential mapping for platinum group elements in the Serra Leste region, Carajás Mineral Province, Brazil
Authors: Emilson Pereira Leite, Carlos Roberto de Souza Filho
Venue: Computers Geosciences (2009)

This work presents an application of probabilistic neural networks to map the potential for platinum group elements (PGE) mineralization sites in the northeast portion of the Carajas Mineral Province (CMP), Brazilian Amazon. Geological and geophysical gamma-spectrometric and magnetic data were used to generate evidential maps to derive input feature vectors. Feature vectors representing known mineralized locations were used as training data. The networks were created based on the training dataset and the evidential maps were classified in terms of probabilities using these networks. We have produced mineral potential models that depict classes with high, moderate and low favorability for Au-PGE mineralization sites and a model with high and low favorability classes for Cr-PGE mineralization sites. The cut-off values for each class were selected as the inflexion points of the curves of favorability against cumulative percentage of the study area. These curves were also used to check for the efficiency of the models by plotting the favorability values at the training sites. Leave-one-out tests were applied to validate the models and the overall accuracy is 87.5%. For Au-PGE mineralization sites, the high favorability areas accounts for 0.57% of the study area and are comprised mainly within meta-pelites and meta-siltites. For Cr-PGE mineralization sites, the high favorability areas are much more restrict and accounts for only 0.17% of the study area, being associated chiefly with mafic and ultramafic rocks. These mineral potential maps can be used as reconnaissance guides for future detailed ground surveys of possible new PGE occurrences, which is of critical importance to shorten exploration time and costs in such densely forested Amazonian terrains.
Evaluation of an Internet-Based Application for Supporting Self-Care of Patients with Diabetes Mellitus Type 2
Authors: Nicol Nijland, Erwin R. Seydel, Julia E. W. C. van Gemert-Pijnen, Bart Brandenburg, Saskia M. Kelders, Marijke Will
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

The introduction of the Internet into medical practice as an information-sharing and communication medium has brought about many opportunities for the management of chronic care. Research has shown that teleconsultation for example is a practical, cost-effective, and reliable way of delivering a worthwhile health care service to diabetics. As a result, Internet-based applications are being developed to support patients in self-managing their diabetes by giving them the opportunity to e-mail with their caregiver, to monitor their health, and to enhance self-care by means of online education. Aim of this study was to assess the value of the Internet for supporting self-care of patients with diabetes type 2. We investigated user motivations and experiences with the Internet-based application. We focused on implementation, user-friendliness, and the process of care delivery via the application. A mixed-method design with usability tests, interviews, log-files, and a survey was used to gather data.
Stable Cutting of Deformable Objects in Virtual Environments Using XFEM
Authors: Lenka Jeřábková, Torsten Kuhlen
Venue: IEEE Computer Graphics and Applications (2009)

Most deformable object simulators suffer from stability problems caused by material slivers in the cut vicinity. The extended finite element method (XFEM) is a novel approach that uses element enrichment to effectively model discontinuities. In combination with an appropriate mass-lumping technique, XFEM provides a stable simulation regardless of cut location.
A simulation-based approach for inventory modeling of perishable pharmaceuticals
Authors: Ana R. Vila-Parrish, Julie Simmons Ivy, Russell E. King
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Pharmaceutical expenditures are increasing for hospital systems nationwide. We model the inventory and ordering policies for perishable drugs in the setting of an inpatient hospital pharmacy. We consider two stages of inventory: raw material and finished good (e.g. intravenous). We use a two-phased approach to explore policy structures that could be implemented in the hospital pharmacy. We develop a policy which is based on the idea that hospitals can improve both costs and patient demand fulfillment by using knowledge of patient mix to guide their drug inventory and preparation decisions. We compare this policy to a simpler stationary base stock policy. The policies are evaluated on the basis of (1) shortage cost, (2) outdating cost (expirations), and (3) holding cost through a range of cost scenarios.
Decision Making Modeling for Stock Portfolio Formation Process through Adaptive Neural Fuzzy Network
Authors: Babak Esmailpoor Ghochani, Leila Mansourian, Saeed Setayeshi, Hasan Ahmadi
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

This paper focuses on the combination of intelligent, technical and time series techniques. It is necessary to use intelligent series to predict the process of stock price change and deduct the price patterns. In most of the applied intelligent methods, the predictions don't come through. In this project not only the newest intelligent techniques, which are neural and fuzzy Nets, are used, but also indicators and time serried regressions have been used simultaneously to increase approximation measure dramatically. This research is aimed at performing an intelligent technique by the help of adaptive neurofuzzy networks and mixing it with time series and technical analysis models. In this way the nonlinear behavior of the stock market, in spite of its rebellious form, can be used as a model. This is the main aim for carrying out this research dramatic error reduction to own the companies stock prices with a suitable approximation.
Making good points: application-specific pareto-point generation for design space exploration using statistical methods
Authors: David Sheldon, Frank Vahid
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

Field-programmable gate arrays (FPGAs) commonly implement system architectures composed from soft-core configurable components, such as a cache with configurable size or associativity, a processor with configurable datapath units, or a configurable network-on-chip connecting dozens of processors. Configurable components increasingly exist even on pre-fabricated platforms. Tuning configurable components to the particular application running on the architecture and to particular design constraints represents a challenging task often left to a designer. Knowledge of the Pareto-optimal points of a system for particular applications can be of benefit to designers seeking to make appropriate design tradeoffs for given constraints. Previous methods for generating Pareto points required extensive knowledge of an architecture's parameter interdependencies, used a simplistic approach that failed to find many parameters, or used randomized search algorithms that may have long runtimes. We introduce an algorithm for finding Pareto points, based on statistically rigorous methods derived from the Design of Experiments paradigm and extended for the purpose of finding Pareto points. The resulting DoE-based Pareto point Generator, or DPG, algorithm finds thorough Pareto points while running 3 times faster than randomized search algorithms, without requiring designer knowledge of parameter interdependencies--in fact, the approach determines those interdependencies automatically, representing an added bonus. We demonstrate DPG on Platune's configurable processor-bus-cache system-on-chip, Noxim's configurable network-on-chip, and the configurable Microblaze FPGA processor.
MPML3D: agent authoring language for virtual worlds
Authors: Sebastian Ullrich, Helmut Prendinger, Mitsuru Ishizuka
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

This paper describes an authoring language for specifying communicative behavior and interaction of agents in virtual worlds. We focus on the popular three-dimensional (3D) multi-user online world "Second Life" and the emerging "OpenSimulator" project. While tools for designing avatars and in-world objects exist, technology to support content creators in scripting (computer-controlled) agents ("bots") is currently missing. Therefore, we have implemented new client software that controls the verbal and non-verbal behavior of bots based on the Multimodal Presentation Markup Language 3D (MPML3D). This paper compares both platforms and discusses the merits and limitations of each from the perspective of adding agents.
A distributed controller for roaming robot formations using local sensing and limited range communications
Authors: E. M. Saad, M. H. Awadalla, A. M. Hamdy, H. I. Ali
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

This paper focuses on the development of wandering robot formations and shows the cooperation and coordination among the robot teammates to maintain the achieved formation regardless the complexity of the environment. To address these issues, this paper proposes a new behavior based robot architecture. This architecture is based on a novel technique for location determination using local sensing. The proposed architecture is implemented using the well known robot simulator Webots. Experiments for many difficult tasks such as the passage through narrow corridors, obstacle avoidance, swerving with large angles, have been conducted. The obtained results show that the constructed formations are more stable and accurate even in cluttered and uncluttered environments.
Learning about objects with human teachers
Authors: Andrea L. Thomaz, Maya Cakmak
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

A general learning task for a robot in a new environment is to learn about objects and what actions/effects they afford. To approach this, we look at ways that a human partner can intuitively help the robot learn, Socially Guided Machine Learning. We present experiments conducted with our robot, Junior, and make six observations characterizing how people approached teaching about objects. We show that Junior successfully used transparency to mitigate errors. Finally, we present the impact of "social" versus "non-social" data sets when training SVM classifiers.
Localised convex hulls to identify boundary nodes in sensor networks
Authors: Marwan Fayed, Hussein T. Mouftah
Venue: International Journal of Sensor Networks (2009)

Intuitively, identification of nodes close to the network edge is key to the successful setup, and continued operation, of many sensor network protocols and applications. Many virtual coordinate constructions rely on the furthest set of nodes as beacons, and sensing applications may find useful the knowledge of the network edge. In this paper, we propose local convex view (lcv) as a means to identify nodes close to the network edge. It is motivated by the hypothesis that some structural information relevant to the network is buried within view of many nodes. The lcv differs from most previous methods in that it is a localised algorithm. Nodes using lcv may establish neighbourhood coordinates if no location information is available a priori. In those cases where needed information is missing, we adopt a simple probabilistic model to decide the boundary status of a node. We identify two metrics for evaluation and compare via simulation the performance of lcv against two methods with similar properties. Further simulations reveal the surprising observation that lcv seems unaffected by position estimation error. We enumerate and analyse a complete set of node configurations seen by lcv. We conclude that the geometric properties underlying lcv are responsible for its resilience to error.
An Algebraic Framework for Defining Random Concurrent Behaviours
Authors: Józef Winkowski
Venue: Fundamenta Informaticae (2008)

The paper is devoted to characterizing systems with random behaviours. The characterization is based on considering systems in terms of their possible runs, called processes, where each process is represented by a pomset in an intrinsic, global time independent way and can possibly be obtained by composing sequentially and in parallel other processes.
Interacting with robots on Mars: operation of the mars exploration rovers
Authors: Steve Squyres
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

The rovers Spirit and Opportunity have been operating on the surface of Mars since January of 2004. Interaction with these robotic vehicles involves overcoming a number of operational challenges. The challenges include the distance between Mars and Earth (the one-way travel time for commands and data can be as long as 20 minutes), environmental factors (e.g., extreme temperatures, dust storms), and the need to respond quickly and effectively to unexpected events and scientific discoveries. In the five years since the rovers landed, the Mars Exploration Rover project team has developed operational procedures for interacting with the rovers that are both scientifically productive and sustainable for what has become a long-duration mission
Region-Based Super Resolution for Video Sequences Considering Registration Error
Authors: Osama A. Omer, Toshihisa Tanaka
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

Super-resolution (SR) for video sequences is a technique to obtain a higher resolution image by fusing multiple low-resolution (LR) frames of the same scene. In a typical super-resolution algorithm, image registration is one of the most affective steps. The difficulty of this step results in the fact that most of the existing SR algorithms can not cope with local motions because they assume global motion. In this paper, we propose a SR algorithm that takes into account inaccurate estimates of the registration parameters and the point spread function. When frames obey the assumed global motion model, these inaccurate estimates, along with the additive Gaussian noise in the low-resolution image sequence, result in different noise level for each frame. However, in case of existence of local motion and/or occlusion, regions that have local motion and/or occlusion have different noise level. To cope with this problem, we propose to adaptively weight each segment according to its reliability. The segments are generated by segmenting the reference frame using watershed segmentation. The experimental results using real video sequences show the effectiveness of the proposed algorithm compared to three state-of-the-art SR algorithms.
Automatic verification of data-centric business processes
Authors: Alin Deutsch, Richard Hull, Fabio Patrizi, Victor Vianu
Venue: Proceedings of the 12th International Conference on Database Theory (2009)

We formalize and study business process systems that are centered around "business artifacts", or simply "artifacts". Artifacts are used to represent (real or conceptual) key business entities, including both their data schema and lifecycles. The lifecycle of an artifact type specifies the possible sequencings of services that can be applied to an artifact of this type as it progresses through the business process. The artifact-centric approach was introduced by IBM, and has been used to achieve substantial savings when performing business transformations. In this paper, artifacts carry attribute records and internal state relations (holding sets of tuples) that services can consult and update. In addition, services can access an underlying database and can introduce new values from an infinite domain, thus modeling external inputs or partially specified processes described by pre-and-post conditions. The lifecycles associate services to the artifacts using declarative, condition-action style rules. We consider the problem of statically verifying whether all runs of an artifact system satisfy desirable correctness properties expressed in a first-order extension of linear-time temporal logic. We map the boundaries of decidability for the verification problem and provide its complexity. The technical challenge to static verification stems from the presence of data from an infinite domain, yielding an infinite-state system. While much work has been done lately in the verification community on model checking specialized classes of infinite-state systems, the available results do not transfer to our framework, and this remains a difficult problem. We identify an expressive class of artifact systems for which verification is nonetheless decidable. The complexity of verification is PSPACE-complete, which is no worse than classical finite-state model checking. This investigation builds upon previous work on verification of data-driven Web services and ASM transducers, while addressing significant new technical challenges raised by the artifact model.