ppxscal/embedding_network huggingface dataset:
Elements and principal stages in the design of non-profit websites
Authors: Pavel Makagonov, Celia B. Reyes Espinosa
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

The principal elements of the methodology for the creation of websites for non-profit institutions will be shown through the development of a website for a regional museum. In this methodology, two principal stages stand out: in the first stage final user models are created, characteristics of the most successful regional museum websites are researched, and concrete recommendations for the creation of the website are made taking into account what specific characteristics of the region the website will focus on. Based on these recommendations, a quick experimental prototype of the website is created for a regional museum dedicated to the Mixtec Culture. This prototype is later used as a collaboration tool with real users and at the same time considered the final product of this collaboration. The publication of the site permits the start of a process of monitoring various aspects involved in the accessing of the site, based on which the proposed user profiles will be verified and the site updated.
Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration
Authors: Chinyao Low, Chou-Jung Hsu, Chwen-Tzeng Su
Venue: Computers Mathematics with Applications (2008)

This article considers a single machine scheduling problem with an availability constraint under simple linear deterioration. The non-preemptive case is taken into account as well. The objective is to minimize the makespan in the system. The addressed problem is first described as a 0-1 integer programming model, and is then solved optimally. Subsequently, we prove that the addressed problem belongs to NP-hard. Thus, some heuristic algorithms based on the bin packing concepts are provided for solving the addressed problem. Computational results show that the proposed algorithm H3 performs well. In addition, a good strategy that sets the maintenance to start epoch when half the jobs have been already processed is suggested as well.
Large scale agent-based simulation on the grid
Authors: Dan Chen, Georgios K. Theodoropoulos, Stephen J. Turner, Wentong Cai, Robert Minson, Yi Zhang
Venue: Future Generation Computer Systems (2008)

The development of many complex simulation applications requires collaborative effort from researchers with different domain knowledge and expertise, possibly at different locations. These simulation systems often require huge computing resources and data sets, which can be geographically distributed. In order to support collaborative model development and to cater for the increasing complexity of such systems, it is necessary to harness distributed resources over the Internet. The emergence of Grid technologies provides exciting new opportunities for large-scale distributed simulation, enabling collaboration and the use of distributed computing resources, while also facilitating access to geographically distributed data sets. This paper presents HLA_Grid_RePast, a middleware platform for executing large scale collaborating RePast agent-based models on the Grid. The paper also provides performance results from a deployment of the system between UK and Singapore.
The troubleshooting task implementation in automotive chassis using virtual interactive technique and knowledge-based approach
Authors: Janus S. Liang
Venue: Journal of Network and Computer Applications (2008)

In this study, a troubleshooting task model of automobile chassis is proposed. It integrates a task implementation method with virtual interactive techniques. Declarative knowledge entities make up the kernel of task model. It makes the task more controllable and automatable. Solution of the knowledge entities is directly used to support automotive chassis repair and maintenance. Furthermore, this system allows learners to operate a practical task module for troubleshooting through the Internet. The framework developed is not dependent on specific automobile style or software configuration and it uses open software (e.g. Java, MySQL, etc.) in the problem reasoning, virtual display and data storage. The framework can achieve the advantages and goals of (1) providing references for technicians in detection of chassis problems to promote repairing skills; (2) constructing a Web-based troubleshooting architecture of automotive chassis that can enhance learners' (e.g. students, freshman, and drivers) knowledge and techniques; and (3) creating a prototype environment for distance learning to eliminate the limitation of space and time.
Detecting Effective Connectivity in Human Brain using Granger Causality
Authors: Zhenyu Zhou, Yun Jiao, Tianyu Tang, Zuhong Lu, Yijun Liu, Yonghong Chen, Mingzhou Ding
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

An analysis approach that based on the Granger causality method is proposed to study the directional effective influence between brain regions in the fMRI data. Granger causality was employed to extracted BOLD signals to investigate effective connectivity inthe brain network. Data from an emotion task were used to validate this method, and the emotion pathway was partly clarified illustrated focus on the right amygdala. The presented results, exploring directional influences between activated brain regions, indicated that the Granger causality mapping combined with spectral matrix factorization and principal component analysis in the frequency domain could improve upon existing applications of traditional pairwise Granger causality mapping method in human brain effectiveconnectivity studies.
Quantum-evolutionary algorithms: a SW-HW approach
Authors: D. Porto, A. Martinez, S. Scimone, E. Sciagura
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

In this paper a HW/SW platform for the implementation of an optimizer based on a evolutionary algorithm, called quantum-inspired evolutionary algorithm (QEA), is introduced. It is based on the concept and principles of quantum computing, such as quantum bit and superposition of states, whose features are briefly described. The hardware implementation of the QEA using a FPGA board is therefore described together with the use of a customable software fitness in order to solve general purpose problems. HW-SW connections are provided by a PCI interface. Final aim is to build a flexible object able to optimize the choices of some sensible parameters in a dynamic system quickly, with particular attention on industrial and automotive applications.
Imitation-based evolution of artificial game players
Authors: Steffen Priesterjahn
Venue: ACM SIGEVOlution (2007)

Because of the rapid progress of commercial computer games in recent years the development of artificial characters that inhabit the presented game worlds has become a challenging task with very specific requirements. A particular computer game specific requirement is that, as the objective of computer games is the entertainment of the player, the artificial intelligence should not only be competitive but also show intelligent and human-like behaviours. Therefore, the following article proposes the usage of imitation techniques to generate more human-like behaviours in an action game, whereas the imitation is achieved by recording players and by using these recordings as the basis of an evolutionary learning approach.
Ensemble-space visualization improves perception of 3D state of molecular dynamics simulation
Authors: Israel Huff, Chris Weigle, David C. Banks
Venue: Proceedings of the 5th symposium on Applied perception in graphics and visualization (2008)

Large-scale molecular dynamics (GD) simulations are some of the primary applications running on today's supercomputers. These simulations frequently compute the interactions of millions of atoms over millions of time steps, and petascale simulations will target billion atom simulations in the near future. Visualizing the state of such large-scale simulations poses a significant challenge for both data reduction and perception. Standard tools for 3D visualization of MD simulations -- such as direct visualization of the molecules in their simulated physical arrangement -- eventually grow so dense (with more atoms than screen pixels) that only the volumetric shape of the simulation domain is apparent, rather than its detailed content. In this paper, we describe a method for visualizing simulations of a compound in bulk which we refer to as the ensemble display. An ensemble display is produced by superimposing molecular neighborhoods onto fixed reference molecules. This results in a 3D visualization which preserves inter-molecular distances and angles between pairs of molecules while greatly reducing the visual complexity. We performed human-subjects experiments to test the hypothesis that subjects could deduce a bulk physical property of the simulation (temperature) from the ensemble display more accurately than from other common visualizations of GD simulation. Our results show that temperature estimates under the ensemble display had the least error of the tested visualization techniques.
Fundamental tradeoffs in distributed algorithms for rate adaptive multimedia streams
Authors: Vilas Veeraraghavan, Steven Weber
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

Rate adaptive multimedia streams adjust the encoding rate dynamically (with corresponding changes in media content resolution) in response to changing levels of congestion along the route. The field of optimization based congestion control has yielded sophisticated distributed algorithms for resource allocation among competing elastic streams. In this work we study the fundamental tradeoffs for a class of optimization based distributed algorithms for rate adaptive streams. We focus on three tradeoffs: (i) the tradeoff between maximizing client average quality of service (QoS) and client fairness, (ii) the tradeoff between granularity of control (both temporal and spatial) and QoS, and (iii) the tradeoff between maximizing the received volume and minimizing the fluctuations in received rate. We illustrate these tradeoffs through extensive ns-2 simulations on two distinct topologies - (i) a single bottleneck like and (ii) a linear network.
Employee retention: By way of management control systems
Authors: Vinay K. Srivastava, Shailesh Rastogi
Venue: Ubiquity (2008)

Loyalty is passé in the modern time and professionalism is the buzzword in the contemporary corporate world. The reasons of employee attrition are also changing. Now-a-days employee leaves an organization for many reasons. Some leave for growth, some leave for some family problems but majority of people switchover jobs due to only one reason that is DISSATISFACTION. Undoubtedly satisfaction and dissatisfaction sort of things have different meaning for different people but having majority of people satisfied is pretty germane for sustainable growth and high level of productivity in any organization. A threadbare analysis of attrition brings some major concerns like not having objectivity in job allocation, employee recognition and fairness in career advancements for consideration. They are also important causes of dissatisfaction for employees in organizations. This dissatisfaction finally gets a vent in the form of changing the job. This subjectivity in the issues of employee handling is the key for dissatisfaction. Management Control System is fully capable of bringing objectivity in the organization and managing this dissatisfaction which would finally be translated into high employee retention, and better productivity and better organizations.
Structuring Data and Building Algorithms: An ANSI-C Based Approach, First edition
Authors: Ian Chai; Jonathon David White
Venue:  (2007)

The famous mathematicians, physicist, theologian, and philosopher Sir Isaac Newton (1642-1727) once wrote,"If I have seen further [than certain other people], it is by standing on the shoulders of giants." This is very true in computer programming as well. Imagine if all programmers had to rediscover for themselves by trial and error how to solve common problems in programming! It is much better to learn the solutions that other programmers have already discovered and build upon that foundation. This book is about those foundational solutions. It describes how to structure data and build algorithms to solve common programming tasks. Some of these techniques have names that come from ordinary non-computer life - e.g. stacks, queues and sorting - and others have names that might be completely unfamiliar to a new student of the programming - e.g. recursion, backtracking and arrays - but they ara all standards in the programmer's tool chest. Occasionally, a new tool is discovered - or at least, refined - and we include one which was just discovered in 1999 - introspective sort. But most of them have been part of the standard programmer's tool chest for decades. Unlike the majority of textbooks in this field, this book takes a"code first" approach. After a brief introduction of the concepts, a short complete ANSI-C program is presented for students to analyse. A number of questions arising from the code are then posed and answered in the Socratic format. In this way, we hope that the reader will not only become fluent in the concepts but also in the "nuts and bolts" of translating these concepts into functioning, efficient standard C code. Variable pointer diagrams are developed and used extensively to aid understanding of the more complex data structures and their manipulation.
Allowing user-specified failure handling in web services composition
Authors: Yuna Kim, Jong Kim
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Recently, the advent of Web services gets rid of the troubles in cooperating with other systems regardless of their underlying platforms. Web services can be composed dynamically on demand and possibly produce value-added services which are mesmerizing enterprises. For dependable execution of the composite services, many failure handling and recovery schemes have been proposed. However, those schemes lack in supporting specific handling of failures as an individual user desires. In this paper, we propose a service composition framework for user-specified failure handling in web services orchestration. In this framework, an instance of executable business process is dynamically generated from common business logic with failure handling specific to each user. We also design an XML expression of a user's failure acceptance specification, and an algorithm for automatically generating an executable business process embedding user-specified failure handling, with architecture of the composite service provider for applying our proposed framework. The comparison of properties between previous works and the proposed one in terms of failure handling is provided as well.
The capability of image in hiding a secret message
Authors: Roshidi Din, Hanizan Shaker Hussain, Salehuddin Shuib
Venue: Proceedings of the 6th WSEAS International Conference on Signal, Speech and Image Processing (2006)

This paper focuses on the capability of image files as cover message to send the text files. The images are classified according to their compression technique either lossless or lossy compression. The measurements are identified in order to test their capability based on file size, color intensity level, integrity data, and the execution time. All the measurements are tested by using the developed tool called StegaMage. The result of the study is to suggest that BMP image is preferable than JPEG image.
Characterizing the I/O behavior of scientific applications on the Cray XT
Authors: Philip C. Roth
Venue: Proceedings of the 2nd international workshop on Petascale data storage: held in conjunction with Supercomputing '07 (2007)

Scientific applications use input/output (I/O) for obtaining initial conditions and execution parameters, as a persistent way of saving program output, and for safeguarding against system unreliability. Although system sizes are expected to continue increasing, I/O performance is not expected to keep pace with system computation and communication performance. Understanding application I/O demands and system I/O capabilities is the first step toward bridging this gap between them. In this paper, we present our approach for characterizing the I/O demands of applications on the Cray XT. We also present preliminary case studies showing the use of our I/O characterization infrastructure with climate studies and combustion simulation programs.
Origami and mathematics (abstract only)
Authors: Sean Riley
Venue: ACM Communications in Computer Algebra (2008)

Mathematics applied to the design of an origami model can be used to develop the most efficient fold patterns; more simply stated the largest finished model compared to the unit dimensions of origami paper in unfolded shape. Based on the final chapter of Origami Design Secrets by R. J. Lang, a collaboration of algorithms which mathematically models most all aspects of what is happening to the piece of paper (set U) during origami transformation is presented. In order to understand what is meant by the symbolism of these algorithms, knowledge of discrete math, linear algebra, trigonometry, calculus, etc. College level mathematics is a necessity.
Intelligent supervisory systems for industrial process control
Authors: Edmary J. Altamiranda M, Eliezer Colina M, Edgar Chacón R
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

This paper presents a supervisory control scheme based on the hybrid systems theory and fuzzy events detection approach presented in [1]. The fuzzy event detector is a linguistic model, which synthesizes complex relations between process variables and process events incorporating experts' knowledge about the process operation. The detection feature allows the anticipation of appropriate control actions, which depend upon the selected membership functions used to characterize the process under scrutiny. Additionally, it is also proposed a fuzzy logic based intelligent hierarchical system, which assigns priorities among simultaneous generated events in complex processes. The performance of the suggested scheme is applied to a theoretical evaporation system in terms of computational simulation results.
Robust fault detection and diagnosis in a class of nonlinear systems using a neural sliding mode observer
Authors: Qing Wu, Mehrdad Saif
Venue: International Journal of Systems Science (2007)

This article presents a robust fault detection and diagnosis scheme for any abrupt and incipient class of faults that can affect the state of a class of nonlinear systems. A nonlinear observer which synthesizes sliding mode techniques and neural state space models is proposed for the purpose of online health monitoring. The sliding mode term is utilized to eliminate the effect of system uncertainties on the state observation. The switching gain of the sliding mode is updated via an iterative learning algorithm and an iterative fuzzy model, respectively. Moreover, a bank of neural state space models is adopted to estimate various state faults. Robustness with respect to modeling uncertainties, fault sensitivity, and stability of this neural sliding mode observer-based fault diagnosis scheme are rigorously investigated in theory. Moreover, the proposed fault detection and diagnosis scheme is applied to the model of a fourth-order satellite dynamic system, and the simulation results illustrate the effectiveness of the proposed approach.
A Monoidal Category of Bifinite Chu Spaces
Authors: Fang-Ping Huang, Manfred Droste, Guo-Qiang Zhang
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Chu spaces are a general framework for studying the dualities of objects and properties, points and open sets, and terms and types, under rich mathematical contexts that are relevant to several sub-disciplines of computer science and mathematics. Traditionally, the study on Chu spaces had a ''non-constructive'' flavor. The recent work of Droste and Zhang [M. Droste, G.Q. Zhang, Bifinite Chu spaces. 2nd Conf. on Algebra and Coalgebra in Computer Science (CALCO), Lecture Notes in Computer Science 4624 (2007): 179-193] on bifinite Chu spaces provides a basis for a constructive analysis of Chu spaces and opens the door to a more systematic investigation of such an analysis in a variety of settings. As a step in this direction, we show in this paper that a category of bifinite Chu spaces is monoidal, but not monoidal closed.
Intelligent software agent framework for customized mobile services
Authors: Kirsti Simula
Venue: Proceedings of the 4th on Middleware doctoral symposium (2007)

In this paper, a framework for customized mobile services is presented to ease and speed up new Internet service development and deployment in mobile platforms. An intelligent software agent approach is used in framework realization together with the blackboard style. Agents are used because of their capabilities like autonomous, situated, reactive, proactive, flexible, robust and social. The presented framework consists of an extensible set of intelligent software agents managing connectivity to the networks, configuration, QoS, power consumption, and context-awareness including location-based information, intelligent handover, presence, security, firewalls and many others.
Handling of Interference Using Power Penalty Analysis and Frequency Assignment Problem Approach in Communication
Authors: A. V. Kulkarni, Bhavna Ambudkar
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

As communication is making the whole world a global village, there seems to be tremendous pressure on the service providers in this field.The greatest demand is for Quality Of Service (QoS) wherein the most important role is played by Interference. There are numerous parameters leading to interference in both wired and wireless communication. In this paper an attempt is made to minimize interference in wired and wireless communication. In wired, an analysis of All Optical Network is carried out whereas in wireless networks, overall interference is reduced using fundamental approach.
Hierarchical Domains for Decentralized Administration of Spatially-Aware RBAC Systems
Authors: Maria Luisa Damiani, Claudio Silvestri, Elisa Bertino
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Emerging models for context-aware role-based access control pose challenging requirements over policy administration. In this paper we address the issues raised by the decentralized administration of a spatially-aware access control model in a mobile setting. We present GEO-RBAC Admin, the administration model for the GEO-RBAC model. The model is based on the notion of hierarchy of spatial domains; a spatial domain is an entity grouping objects based on organizational and spatial proximity criteria. In the paper we formally define the model and introduce and prove relevant properties.
Process classes deployed in manufacturing enterprises
Authors: R. H. Weston, A. Guerrero, K. A. Chatha
Venue: International Journal of Computer Integrated Manufacturing (2007)

Previous authors have classified process types found in manufacturing enterprises (MEs). The current paper considers common and distinctive features found among these classifications, which govern their utility and completeness. Based on understandings gained about their collective features and shortcomings this paper argues a case for a unified classification of process types. Such a classification is presented and its applicability is discussed and exemplified.