ppxscal/embedding_network huggingface dataset:
Agent-based patient admission scheduling in hospitals
Authors: Anke K. Hutzschenreuter, Peter A. N. Bosman, Ilona Blonk-Altena, Jan van Aarle, Han La Poutré
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: industrial track (2008)

Scheduling decisions in hospitals are often taken in a decentralized way. This means that different specialized hospital units decide autonomously on patient admissions or operating room schedules. In this paper we present an agent-based model for the selection of an optimal mix for patient admissions. Admitting the right mix of patients is important in order to optimize the resource usage and patient throughput. Our model is based on an extensive case analysis, involving data analysis and interviews, conducted in a case study at a large hospital in the Netherlands. We focus on the coordination of different surgical patient types with probabilistic treatment processes involving multiple hospital units. We also consider the unplanned arrival of other patients requiring (partly) the same hospital resources. Simulation experiments show the applicability of our agent-based decision support tool. The simulation tool allows for the assessment of resource network usage as a function of different policies for decision making. Furthermore, the tool incorporates a first optimization module for the resource allocation of postoperative care beds.
Using survival analysis on conservation metadata to benchmark treatment frequency
Authors: Jeremy Hutchings, Jonathan Ashley Smith
Venue: Journal on Computing and Cultural Heritage (JOCCH) (2008)

This research addresses the question of what is an acceptable period between conservation treatments. Taking the cleaning of impressionist paintings as a case study, survival analysis is carried out on metadata from conservation records for the Tate, UK, the National Gallery in Oslo, Norway, and the National Trust, UK. Currently the only guidance available is offered by the National Trust. Based on cost-benefit analysis, it suggests an interval of 25 years for light surface cleaning and 100 years for major treatment. The majority of paintings held by the National Trust are pre-20th century, with a varnish layer protecting the paint surface. Arguments are put forward that this guidance cannot be applied to unvarnished paintings with exposed ground and a fragile paint layer. The cleaning process for these types of paintings poses a greater risk as it inevitably causes some loss of paint. Any cleaning of paintings in this category is more akin to a major conservation treatment. The Kaplan Meier Product Limit estimator uses metadata collected from the conservation records to estimate an average inter-cleaning period for the Tate, UK, and National Gallery, Oslo. The result of the theoretical analysis, although highly dependent on the quality of conservation records available, is supplemented by evidence from practical experience. Current views on acceptable frequency of cleaning and the associated risks of treatment are sought using a survey of conservators with experience of treating impressionist and post-impressionist paintings. This is applied to a case study of the Munch paintings in the University Aula, Oslo, that are currently unacceptably dirty. In the past, these paintings have been cleaned on average once every 14 years, which is clearly too often. The results suggest that the intercleaning period should be increased by a factor of three. Criteria are discussed for improving the environment within the University Aula, Oslo, to achieve this goal.
Neural Network Research Progress and Applications in Forecast
Authors: Shifei Ding, Weikuan Jia, Chunyang Su, Liwen Zhang, Zhongzhi Shi
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

This paper roughly reviews the history of neural network, briefly introduces the principles, the features, and the applied fields of neural network, and puts emphasis on discussing the current situation of the latest research from parameters selection, algorithms improvement, network structure improvement and activation function; expounds the effect of neural network in modeling and forecast, from forward direction modeling and reverse direction modeling, describes the principles of modeling and forecast based on neural network in details, analyzes the basic steps of forecast using neural network, then discusses the latest research progress and the facing problems in this field, at last looks forward to the developing trend of this advancing front theory and its applied prospect in forecast.
An Argumentation Based Semantics for Agent Reasoning
Authors: Sanjay Modgil
Venue: Languages, Methodologies and Development Tools for Multi-Agent Systems: First International Workshop, LADS 2007, Durham, UK, September 4-6, 2007. Revised Selected Papers (2008)

A key challenge for agent architectures and programming paradigms is to account for defeasible reasoning over mental attitudes and to provide associated conflict resolution mechanisms. A growing body of work is looking to address these challenges by proposing argumentation based approaches to agent defeasible and practical reasoning. This work conforms to Dung's seminal argumentation semantics. In this paper we review our previous work in which we extend Dung's semantics to allow for inclusion of arguments that express preferences between other arguments. In this way we account for the fact that preference information required to resolve conflicts is itself defeasible and may be conflicting. We then propose the extended semantics as a semantics for agent defeasible and practical reasoning, and substantiate this claim by showing how our semantics can characterise, and indeed provide a framework for extending, existing approaches to agent reasoning over beliefs, goals, and actions.
A New Similarity Measure Based on Weibull Distribution for Detecting Plagiarized Source Codes
Authors: Jeong-Hoon Ji, Gyun Woo, Hwan-Gue Cho
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Most of previously released plagiarism detection tools and systems have been adopted normalized similarity measures which are unreliably sensitive to the size of programs compared. Also the most of previously announced tools have difficulties in determining the cutoff threshold to discriminate the plagiarized codes from innocent ones. In this paper, we present a new discriminating method based on Weibull distribution which was mainly used in studying genomic sequence similarity with statistical significance. We applied our new detection method to a real programming competition, ICPC East Asia Regional Contest. Our system was quite successful to detect a few plagiarized codes in the preliminary round of the contest. This experience clearly revealed the characteristics of similarity among the source codes submitted in programming contests.
A Study on Digital Media Security by Hopfield Neural Network
Authors: Minseong Ju, Seoksoo Kim, Tai-Hoon Kim
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

Recently, the distribution and using of the digital multimedia contents are easy by developing the internet application program and related technology. However, the digital signal is easily duplicated and the duplicates have the same quality compare with original digital signal. To solve this problem, there is the multimedia fingerprint which is studied for the protection of copyright. Fingerprinting scheme is a technique which supports copyright protection to track redistributors of electronic information using cryptographic techniques. Only regular user can know the inserted fingerprint data in fingerprinting schemes differ from a symmetric/asymmetric scheme and the scheme guarantee an anonymous before re-contributed data. In this paper, we present a new scheme which is the detection of colluded multimedia fingerprint by neural network. This proposed scheme is consists of the anti-collusion code generation and the neural network for the error correction. Anti-collusion code based on BIBD(Balanced Incomplete Block Design) was made 100% collusion code detection rate about the average linear collusion attack, and the Hopfield neural network using (n,k) code designing for the error bits correction confirmed that can correct error within 2bits.
Di-GAFR: Directed Greedy Adaptive Face-Based Routing
Authors: Tao Yang, Ye Huang, Jianxin Chen, Geng Yang, Chunming Rong
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

In this paper, we present Di-GAFR, a novel WSN geometric routing algorithm containing greedy, face and directed routing. In Di-GAFR, forwarding decisions merely depend on information about a node's immediate neighbors in the network topology, which made the algorithm absolutely local and highly scalable. Additionally, we have proved that Di-GAFR was asymptotically optimal. Simulations demonstrate that Di-GAFR sufficiently outperforms other prominent algorithms, such as GPSR and GOAFR, in the "critical" region.
A Perspective on SAGE: Discussion
Venue: IEEE Annals of the History of Computing (1983)

On October 26, 1982, several people who had participated in the design and development of the SAGE system gathered at the MITRE Corporation to discuss their work and its ramifications. Henry S. Tropp was moderator. Kent C. Redmond and Thomas M. Smith, authors of "Project Whirlwind" (Digital Press, 1980), who are writing a book on the SAGE project, were also present. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks
Authors: Xiangyong Li, Yash Aneja, Fazle Baki
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

This paper studies the routing strategy in non-bifurcated traffic grooming in WDM networks. It is to optimally route the specified traffic over a given logical topology to minimize the congestion of the WDM network. We first present the node-arc formulation. To overcome the computational complexity by implementing exact algorithms, we present an ant colony optimization (ACO) metaheuristic. The computational results compared to those of exact algorithms demonstrate that ACO is a computationally efficient and suitable approach for obtaining high-quality routing strategy in non-bifurcated traffic grooming problem in WDM networks.
Co-operative Co-evolutionary System for Solving Dynamic VRPTW Problems with Crisis Situations
Authors: Rafał Dreżewski, Łukasz Dronka, Jarosław Koźlak
Venue: Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2007)

Vehicle routing problems with time windows are NP-hard problems. Additional difficulties are introduced by dynamic client requests and crisis situations. One of the techniques used in order to solve such problems are evolutionary algorithms. In this paper a co-evolutionary algorithm with spatial population structure is presented. The system is verified with the use of dynamic vehicle routing problems with time windows and crisis situations.
Feedback Information Expression and Fusion Method for Human-Robot Interaction
Authors: Qijie Zhao, Dawei Tu, Jianxia Lu, Zhihua Huang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

On the basis of analyzing the information fusion method for human-robot interaction, a kind of information feedback structure for human---robot interaction platform has been provided, the source feedback information is handled with multi-layer processed structure, and the processed multi-mode information is integrated with certain interactive rules and knowledge in interaction knowledge database. A set of feedback information expression and fusion method has been presented in information integration process, the abstract information from feedback multimodality is expressed by the situation of task execution process and the stability of feedback modality, and then these information is fused in light of the result of task execution, at last, the fusion result is delivered to user by the most stable feedback modality. Some experiments have been done with the provided methods in the human---robot interaction system, and parts of the experiment results show that user's cognition loads can be decreased by this semantic information fusion and feedback method, moreover, high work efficiency also can be gotten in human-robot interaction.
Effective design in the development of public information infrastructure: A social constructionist approach
Authors: Dong-Hee Shin
Venue: Information Polity (2006)

This study investigates the processes involved in the development of broadband public information infrastructure in Northeast of US. Using an evaluative framework provided from the Social Construction of Technology perspective, this paper examines the political economy of such infrastructure by focusing on the direction, the nature, and the results of these infrastructure developments. Finally, this study suggests the effective approach in developing public information infrastructure to capture, clarify, and manage the complex practice and processes of future infrastructure systems.
Industrial Cooperation Resulting in Transfer
Authors: R. Schneider, L. Wedel, W. Marquardt
Venue: Collaborative and Distributed Chemical Engineering. From Understanding to Substantial Design Process Support: Results of the IMPROVE Project (2008)

This short section is to demonstrate that one of the characteristics of IMPROVE was a permanent exchange of ideas with industrial partners: Ideas were taken up from industry, symposia and workshops were held, spin-offs were founded, etc. So, the transfer center described in this chapter is essentially the result of our long-lasting and continuing cooperation with industry.
Switching power supplies for special vehicle applications
Authors: Adriana Florescu, Alexandru Vasile, Luigi Vladareanu, Dumitru Stanciu
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

The paper presents switching power supplies with MC34063 and µA78S40 monolithic switching regulator subsystems and DC-DC step-up converter that can be used in special vehicle applications. General description of MC34063 and µA78S40 operation modes, mathematical design and PSpice under ORCAD simulation of the whole switching power supply, a numerical example and the practical implementation are included. Some practical considerations are also presented.
On small blocking sets and their linearity
Authors: Peter Sziklai
Venue: Journal of Combinatorial Theory Series A (2008)

We prove that a small minimal blocking set of PG(2,q) is ''very close'' to be a linear blocking set over some subfield GF(p^e)
An efficient p-version multigrid solver for fast hierarchical vector finite element analysis
Authors: Y. J. Sheng, R. S. Chen, X. W. Ping
Venue: Finite Elements in Analysis and Design (2008)

In this paper, a kind of p-type multigrid (MG) method is applied to solve the large sparse linear systems arising from the application of hierarchical tangential vector finite element method (TVFEM) for the analysis of electromagnetic devices. Several waveguide problems are analyzed and our numerical results show that the p-type MG method can greatly save iterations and CPU time when compared with the preconditioned conjugate gradient iterative methods.
An Optimization of Context Sharing for Self-adaptive Mobile Applications
Authors: Nearchos Paspallis, George A. Papadopoulos
Venue: Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing (2008)

Because of the high potential of mobile and pervasive computing systems, there is an ongoing trend in developing applications exhibiting context awareness and adaptive behavior. While context awareness guarantees that the applications are aware of both their context and their own state, dynamic adaptivity enables them to react on their knowledge about it and optimize their offered services. However, because in pervasive computing environments there is also a need for enabling arbitrary synergies, such a behavior also requires appropriate algorithms implementing the adaptation logic required to reason on the sensed context and dynamically decide on the most appropriate adaptations. This paper discusses how utility function-based approaches can use context-awareness for that and, additionally, it shows how the decision-making process is improved with respect to both performance and resource consumption by using a more intelligent approach.
Application of the Revision Theory to Adaptation in Case-Based Reasoning: The Conservative Adaptation
Authors: Jean Lieber
Venue: Proceedings of the 7th international conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2007)

Case-based reasoning aims at solving a problem by the adaptation of the solution of an already solved problem that has been retrieved in a case base. This paper defines an approach to adaptation called conservative adaptation; it consists in keeping as much as possible from the solution to be adapted, while being consistent with the domain knowledge. This idea can be related to the theory of revision: the revision of an old knowledge base by a new one consists in making a minimal change on the former, while being consistent with the latter. This leads to a formalization of conservative adaptation based on a revision operator in propositional logic. Then, this theory of conservative adaptation is confronted to an application of case-based decision support to oncology: a problem of this application is the description of a patient ill with breast cancer, and a solution, the therapeutic recommendation for this patient. Examples of adaptations that have actually been performed by experts and that can be captured by conservative adaptation are presented. These examples show a way of adapting contraindicated treatment recommendations and treatment recommendations that cannot be applied.
A Low-Power 512-Bit EEPROM Design for UHF RFID Tag Chips
Authors: Jae-Hyung Lee, Gyu-Ho Lim, Ji-Hong Kim, Mu-Hun Park, Kyo-Hong Jin, Jeong-Won Cha, Pan-Bong Ha, Yung-Jin Gang, Young-Hee Kim
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

In this paper, a design for a low-power 512-bit synchronous EEPROM with flash cells for passive UHF RFID tag chip is presented. Applied are low-power schemes such as dual power supply voltage(VDD=1.5V and VDDP=2.5V), clocked inverter sensing, voltage-up converter, IO interface, and Dickson charge pump using schottky diode. An EEPROM is fabricated with the 0.25μm- EEPROM process. Simulation results show that power dissipations are 8.34μW in the read cycle and 57.7μW in the write cycle, respectively. The layout size is 449.3μm × 480.67μm.
Collaboration Between Hyperheuristics to Solve Strip-Packing Problems
Authors: Pablo Garrido, María Cristina Riff
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

In this paper we introduce a collaboration framework for hyperheuristics to solve hard strip packing problems. We have designed a genetic based hyperheuristic to cooperate with a hill-climbing based hyperheuristic. Both of them use the most recently proposed low-level heuristics in the literature. REVAC, which has recently been proposed for tuning [18], has been used to find the best operators parameter values. The results obtained are very encouraging and have improved the results from both the single heuristics and the single hyperheuristics' tests. Thus, we conclude that the collaboration among hyperheuristics is a good way to solve hard strip packing problems.
The Effect of Mediated Partnerships in Two-Sided Economic Search
Authors: Philip Hendrix, David Sarne
Venue: Proceedings of the 11th international workshop on Cooperative Information Agents XI (2007)

In this paper we investigate the effect of mediated partnerships over agents' equilibrium strategies in two-sided economic search. A mediated partnership is formed when an agent acts as a mediator, establishing a partnership between a pair of agents it encountered along its search, thereby reducing the other agents' amount of search. Surprisingly, this reduction in market friction induced by mediated partnerships does not always improve market efficiency. Use of mediated partnerships changes the equilibrium strategies used by agents in two-sided search models and introduces substantial computational complexity. This computational complexity is overcome with an innovative algorithm that facilitates equilibrium calculation.
Application of Genetic Algorithms for Microwave Oven Design: Power Efficiency Optimization
Authors: Juan Monzó-Cabrera, Alejandro Díaz-Morcillo, Elsa Domínguez-Tortajada, Antonio Lozano-Guerrero
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

In this work we present power efficiency optimization for microwave ovens by means of genetic algorithms (GA). Two kind of microwave applicators are analyzed in this case: cylindrical and rectangular ones. In the first case, optimization of the oven uses cavity dimensions, waveguide feeding location and polarization as design parameters. In the second case, waveguide slots are used to feed the rectangular multimode cavity. The slots' dimension, position and angle in the waveguide are optimized by the genetic algorithm in order to achieve the best power efficiency. All simulations are carried out by the CST Microwave StudioTM, a Finite Integration Technique (FIT) commercial software capable of solving electromagnetic (EM) structures in three dimensions whereas GA are implemented in MatlabTM. The obtained results show that combination of both the EM software and GA provides a very powerful tool for microwave oven design and optimization.
Debugging Lazy Functional Programs by Asking the Oracle
Authors: Bernd Braßel, Holger Siegel
Venue: Implementation and Application of Functional Languages: 19th International Workshop, IFL 2007, Freiburg, Germany, September 27-29, 2007. Revised Selected Papers (2008)

The complexity of lazy evaluation forbids classic debugging techniques like a simple step-by-step representation of the buggy program run. Therefore, most sophisticated tools for finding bugs in lazy functional programs try to display the run as if the program's underlying semantics was strict. In order to provide such a strict representation, current approaches gather a lot of information about the executed program.We utilized a new technique to drastically reduce the amount of gathered data and show how to use the reduced information to implement a debugging tool which supports declarative debugging as well as a strict step-by-step tracer.