ppxscal/embedding_network huggingface dataset:
A hybridization of simulated annealing and electromagnetic-like mechanism for job shop problems with machine availability and sequence-dependent setup times to minimize total weighted tardiness
Authors: R. Tavakkoli-Moghaddam, M. Khalili, B. Naderi
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

In this paper, we explore job shop problems with two recently popular and realistic assumptions, sequence-dependent setup times and machine availability constraints to actualize the problem. The criterion is a minimization of total weighted tardiness. We establish a simple criterion to integrate machine availability constraints and scheduling decisions simultaneously. We propose a hybrid meta-heuristic to tackle the given problem. This meta-heuristic method, called EMSA, is a combination of two meta-heuristics: (1) Electromagnetic-like mechanism (EM); and (2) simulated annealing (SA). The hybridization is done to overcome some existing drawbacks of each of these two algorithms. To evaluate the proposed hybrid meta-heuristic method, we carry out a benchmark by which the proposed EMSA is compared with some existing algorithms as well as simulated annealing and electromagnetic-like mechanism alone in a fixed given computational time. All the related results and analysis obtained through the benchmark illustrate that our proposed EMSA is very effective and supersedes the foregoing algorithms.
Proposing a Conceptual Readiness Assessment Model of MIS/IS Deployment in Manufacturing Companies (A Case Study Conducted on the Applications of the Suggested Model in MehrCamPars Co.1)
Authors: Jale Mirzaei, Fariborz Mosavi Madani
Venue: Proceedings of the 2009 International Conference on Information, Process, and Knowledge Management (2009)

In order to, proliferate capabilities of Information Systems as a managerial leverage and a means of decision making, organizations need the support of software, hardware and humanware infrastructures. Without such support, implementation efforts may adversely suffer from excessive development costs, delays or may even fail before completion. Hence, readiness assessment studies and exploration of prerequisite conditions play a vital role in successful MIS deployment. Although studies have revealed that IT project risks are mostly attributed to non-technical aspects, most of the available assessment models rely on technical dimensions and usually works for a specific platform or software solution. Also, some assessment models monitor project success after the implementation phase has been settled down. In this paper we propose a generic conceptual model for readiness assessment comprised of total of 18 factors. These factors are verified by field research through factor analysis technique. Our proposed model incorporates cultural, structural, process-based, infrastructural and managerial dimensions in a comprehensive and integrated fashion. The model was tested using the results obtained by the case study conducted on an auto parts manufacturing company (MehrCamPars Co.).
Early aspect identification from use cases using NLP and WSD techniques
Authors: Alejandro Rago, Esteban Abait, Claudia Marcos, Andrés Diaz-Pace
Venue: Proceedings of the 15th workshop on Early aspects (2009)

In this article, we present a semi-automated approach for identifying candidate early aspects in requirements specifications. This approach aims at improving the precision of the aspect identification process in use cases, and also solving some problems of existing aspect mining techniques caused by the vagueness and ambiguity of text in natural language. To do so, we apply a combination of text analysis techniques such as: natural language processing (NLP) and word sense disambiguation (WSD). As a result, our approach is able to generate a graph of candidate concerns that crosscut the use cases, as well as a ranking of these concerns according to their importance. The developer then selects which concerns are relevant for his/her domain. Although there are still some challenges, we argue that this approach can be easily integrated into a UML development methodology, leading to improved requirements elicitation.
Wirelength modeling for homogeneous and heterogeneous FPGA architectural development
Authors: Alastair M. Smith, Steven J.E. Wilton, Joydip Das
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

This paper describes an analytical model that relates the architectural parameters of an FPGA to the average prerouting wirelength of an FPGA implementation. Both homogeneous and heterogeneous FPGAs are considered. For homogeneous FPGAs, the model relates the lookup-table size, the cluster size, and the number of inputs per cluster to the expected wirelength. For heterogeneous FPGAs, the number and positioning of the embedded blocks, as well as the number of pins on each embedded block is considered. Two applications of the model to FPGA architectural design are also presented.
On-demand Trust Evaluation
Authors: David O'Callaghan, Brian Coghlan
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

Security is a critical factor in interoperability of grid middleware. There is an opportunity to automate the trust evaluation and accreditation process for grid certification authorities to allow continuous evaluation of their policies and practices. To assess the feasibility and usefulness of automatic evaluation of trust in CAs a trust evaluation system has been designed and a prototype implemented. The service will evaluate a CA based on its published policies and observed practices with respect to a set of rules based on the requirements from an authentication profile. Development and testing are ongoing and we hope to deploy a pilot system shortly.
Smoothed form of nonlinear phase macromodel for oscillators
Authors: M. M. Gourary, S. G. Rusakov, S. L. Ulyanov, M. M. Zharov, B. J. Mulvaney, K. K. Gullapalli
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

This paper proposes an improvement to the well-known oscillator nonlinear phase macromodel based on Floquet theory. A smoothed form of the nonlinear phase macromodel is derived by eliminating highly oscillatory terms in the macromodel, resulting in a significant speed-up in transient simulation. For an LC oscillator under sinusoidal excitation the new macromodel is equivalent to the Adler model. Numerical experiments confirm a considerable decrease of computational efforts. It is further shown that the new macromodel allows one to perform phase noise analysis of locked oscillators under arbitrary periodic injection.
CTO Roundtable: Virtualization Part I
Authors: Mache Creeger
Venue: Queue (2009)

CTOs from key players in the virtualization market examine current trends in virtualization and how IT managers can make the most effective use of it.
A simple index for assessing fire danger rating
Authors: J. J. Sharples, R. H. D. McRae, R. O. Weber, A. M. Gill
Venue: Environmental Modelling Software (2009)

Fire danger rating systems are used to assess the potential for bushfire occurrence, fire spread and difficulty of fire suppression. Typically, fire danger rating systems combine meteorological information with estimates of the moisture content of the fuel to produce a fire danger index. Fire danger indices are used to declare fire bans and to schedule prescribed burns, among other applications. In this paper a simple fire danger index F that is intuitive and easy to calculate is introduced and compared to a number of fire danger indices pertaining to different fuel types that are used in an operational setting in Australia and the United States. The comparisons suggest that F provides a plausible measure of fire danger rating and that it may be a useful pedagogical tool in the context of fire danger and fire weather.
Interference and Outage Evaluation of a Network Coding Based Detection and Defense Mechanism for WRN
Authors: Rafaela Villalpando Hdz., César Vargas Rosales, David Munoz Rodríguez
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

Wireless Reconfigurable Networks (WRN) are prone to several routing security attacks such as packet dropping, data integrity, selective forwarding, black holes, and wormholes. In this paper, we introduce an interference and outage probability analysis of the distributed security attack detection and defense method (DDM) for WRN proposed. The accuracy capabilities of the method are analyzed under nearest neighbor case of interference and Rayleigh fading outage conditions. The analysis is commanded where a dynamic adversary is introduced, under several network densities and transmission ranges over a network where node mobility disallowed. Several network parameters like packet overhead and successfully received packet as well as the detection accuracy of the method are evaluated. We found that the best performance of the method is attained under high node density when node mobility is introduced.
Numerical Simulation of the Fan Cooling Effect on a 10000t/d Cement Rotary Kiln
Authors: Haijian Dou, Zuobing Chen, Jiayun Xiao
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Industry production practice and CFD (Computational Fluid Dynamics) numerical simulation technology are integrated together in the study of the fan cooling effect on an overseas 10000t/d (ton/day) cement rotary kiln. The spot data of a 10000t/d cement production at home were collected and studied, which provided the vital data for numerical simulation of the fan cooling effect. Then aiming at the working ambient conditions of the overseas 10000t/d cement production line, the fan cooling effect of its rotary kiln was numerically simulated by considering natural convection and radiation heat-loss. Finally, based on the results of the simulation, a conclusion is drawn that the fan cooling effect is good enough to make the overseas rotary kiln safely run at its ambient conditions.
Domain independent data discrepancy detection using ensemble learning
Authors: Danico Lee, Costas Tsatsoulis
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Data entry and acquisition are prone to errors and discrepancies. The data cleaning problem is an important process and a key challenge in data warehousing, pattern recognition, knowledge discovery in databases, data mining, and data quality management. In this paper, we present an ensemble that automates the task of domain-independent data discrepancy detection. The system uses a set of predictors/classifiers combined into an ensemble, and identifies potentially erroneous attributes in data sets. The ensemble incorporates individual predictive algorithms and learns which is most accurate for each attribute in the data set. The system was trained and tested on five real-world data sets totaling over 25,000 data records, and on varying error detection thresholds. The results show that for the best error detection thresholds data errors are identified with median accuracy of 89% (average 87% with standard deviation of 12.6), and with low false positive rates (median 8.4%, and average of 13.5% with standard deviation of 9.5).
Recurrence-aware instruction set selection for extensible embedded processors
Authors: Paolo Bonzini, Laura Pozzi
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

Automatic generation of a customized instruction set, starting from an input application code, is a complex problem that has received considerable attention in the past few years. Because of its complexity, only simplified versions of the problem have been solved exactly so far. For example, exact algorithms have been proposed for custom instruction identification but that do not consider recurrence; other methods exist that can indeed handle recurrence, but are limited in how complex an instruction they can identify. However, an exact solution that can handle identification and recurrence simultaneously has been missing. We divide the problem into several parts and concentrate on covering, that is, selecting a set of nonoverlapping and possibly recurrent custom instructions to be implemented and used. We then propose a range of novel algorithms, both exact and approximate, to solve the covering problem in conjunction with the recurrence of candidate extensions. We propose an optimal search technique that uses branch-and-bound to improve an existing solution, in conjunction with a greedy search to help the algorithm out of any local optima, and achieve a tangible improvement over nonrecurrence-aware covering.
Rejoining Collaborative Graphics Editing in Ubiquitous Environments
Authors: Bo Jiang, Jiajun Bu, Chun Chen
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

In this paper we present a novel rejoin scheme for collaborative graphics editing systems in ubiquitous environments. The term `rejoin' is used to donate a mechanism that allows a late-coming participant to join an ongoing collaborative session after he quits from the former session. Generally, this requires that participants in the current session provide the rejoiner with the state of shared workspace to initialize the application instance of the latecomer. We propose the rejoining scheme that is based on the user interest prediction algorithm to promote the efficiency of rejoin process especially for those embedded mobile devices. The scheme and related algorithm are tested in our prototype system and proved that they can work well in ubiquitous environments.
Carnivorous domestic entertainment robots
Authors: Aleksandar Zivanovic, James Auger, Jimmy Loizeau
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

This paper describes a group of objects produced as a collaboration between designers and scientists/engineers. They explore an alternative approach to bringing robots into the domestic environment, exploring both the aesthetics and functionality that may elicit a symbiotic coexistence with humans in their homes. They are all based on the technology of biological fuel cells, which generate electricity by the action of micro-organisms on biological matter. The robots trap animal pests in the domestic environment and use the electricity produced by the fuel cells to lead autonomous existences.
Exploration of memory hierarchy configurations for efficient garbage collection on high-performance embedded systems
Authors: Jose Manuel Velasco, David Atienza, Katzalin Olcoz
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Modern embedded devices (e.g., PDAs, mobile phones) are now incorporating Java as a very popular implementation language in their designs. These new embedded systems include multiple applications that are dynamically launched by the user, which can produce very energy-hungry systems if the interactions between the applications and the garbage collectors (GCs) are not properly understood. In this paper we present a complete exploration, from an energy viewpoint, of the different possibilities of memory hierarchies for high-performance embedded systems when used by state-of-the-art GCs. Moreover, we explore the potential peformance improvement and energy reductions of using a scratchpad memory directed by the virtual machine to store critical code and data structures of the GCs; thus, enabling up to 40% performance improvements and 41% leakage reduction with respect to classical cache-based memory architectures. Our experimental results show that the key for an efficient low-power implementation of Java Virtual Machines (JVM) for high-performance embedded systems is the synergy between the GC choice, the memory architecture tuning, and the inclusion of power management schemes controlled by the JVM, exploiting knowledge of the used GC.
Automata and Answer Set Programming
Authors: Victor Marek, Jeffrey B. Remmel
Venue: Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science (2009)

In answer set programming (ASP), one does not allow the use of function symbols. Disallowing function symbols avoids the problem of having logic programs which have stable models of excessively high complexity. For example, Marek, Nerode, and Remmel showed that there exist finite predicate logic programs which have stable models but which have no hyperarithmetic stable model. Of course, by eliminating function symbols, one loses a lot of expressive power in the language. In particular, it is difficult to directly reason about infinite sets in ASP.Blair, Marek, and Remmel [BMR08] developed an extension of logic programming called set based logic programming. In the theory of set based logic programming, the atoms represent subsets of a fixed universe X and one is allowed to compose the one-step consequence operator with a monotonic idempotent operator O so as to ensure that the analogue of stable models are always closed under O. We show that if the sets represented by the atoms in a finite set based program P are languages accepted by finite automaton, and the operators involved in the construction have a certain natural property, then all the stable models of P are languages accepted by finite automaton and one can effectively check whether a language accepted by a finite automaton is a stable model of the set based logic program. Thus in this setting, one can effectively reason about certain classes of infinite sets.
AI in Greece
Authors: George A. Vouros
Venue: IEEE Intelligent Systems (2009)

The president of Greece's Hellenic Society of Artificial Intelligence describes the state of AI-related R D in that country, describes the recent momentum that researchers have achieved, and notes the obstacles ahead. Recent survey reports outline many of Greece's AI achievements.
Absolute field: proposal for a re-configurable spatial structure
Authors: Takuji Narumi, Tomohiro Akagawa, Young Ah Seong, Michitaka Hirose
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

Only architects have designed and built architectures until now. However, even if usage of the space is changed, it is difficult to change the internal space structure of architectures. On the other hand, we proposed the spatial structure which is dynamically configurable by using information technology. As such a technique, we consider a way to create a virtual architecture in real world without physical walls by using physical computing technology. This led to realization of re-configurable spatial structures which change according to the situation and the usage of space. In this paper, as an implementation of a proposed re-configurable spatial structure, we made "Absolute Field," which is an interactive art installation. In this artwork, we can duplicate a spatial structure in memory as a spatial structure in real world.
A six sigma DMADV project: the 787 LCF scheduling tool
Authors: Roberto F. Lu, Cliff J. Kirkham
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The Boeing 787 program revolutionized many aspects of commercial airplane production. One of the unique aspects of its global production system is that the major 787 structure components are transported via a small fleet of freighter airplanes. These freighter airplanes, called the Large Cargo Freighter (LCF), fly among five production sites to transport the 787 components forward and return their respective carrying tools back to their original sites. Simulating and optimizing LCF logistics related factors is an art as much as a science. This presentation depicts a Six Sigma approach combined with simulation modeling to improving existing tools and methods of the 787 LCF logistics. It is often difficult to start and conclude a LEAN Six Sigma project using simulation modeling. This presentation aims to share the valuable lessons learned through the practice of LEAN Six Sigma using simulation modeling.
A Secure Reputation System Based SMC
Authors: Liu Yanbin, Yang Bo, Sun Lingjie, Zhang Wenzheng
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Reputation systems are designed for reducing the risk entailed in interactions among total strangers in electronic marketplaces. Such systems can be used to collect and aggregate feedback on the past behavior of participants in electronic transactions, so as to derive reputation scores assumed to predict likely future behavior.The security of reputation system is vital for the system to run correctly, if reputation system is not secure, it may not be able to produce a correct result, and consequently affects the process of decision making. In this paper, a secure reputation system based on secure multiparty computation is proposed. Each of feedback provider generates an anonymous identity using smart card, and provides a rating about feedback target by a secure multiparty computation to a querying user. The system contains the following desirable features: privacy-preserving of feedback provider, tamper-preventing of feedback, masquerade-proofing of identity, shilling attack-preventing.
Relay Node Placement in Heterogeneous Wireless Sensor Networks with Basestations
Authors: Shouwei Li, Guangting Chen, Wei Ding
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. Heterogeneous wireless sensor networks are composed of a large number of sensors equipped with different transmission and sensing capabilities. The basestations are more powerful than sensors. In this paper, we study a relay node placement problem, which aims to deploy a minimum number of relay nodes to establish directed paths from any sensor node to a basestation, in heterogeneous wireless sensor networks with basestations. For this problem, we present a polynomial time 6-approximation algorithm and give an example which shows that 5 is a lower bound of the approximation ratio of the algorithm.
Analysis of tag within online social networks
Authors: Chao Wu, Bo Zhou
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

In recent years, tagging systems have been paid increasing attentions from both research communities and system designers. Most popular online social networking sites harness tag for managing and locating contents, for organizing and connecting users, and for recommending and sharing resources. We believe that tag acts like bridge between people and resources. Research on tag and tagging behavior will provide us insight about resource space and user activities on the Internet. In this paper, we present a two-level analysis of the tagging system of Del.icio.us. The results from both two levels confirm each other. In network level, we connect tags by users collaborative tagging to form a social network of tags. By investigating its network feature, we find phenomena of small world and scale-free network. We also discover that the links within this network have relatively strong semantic relatedness. In individual level, users' tagging behaviors and patterns are observed by visualizing their bookmarking history on Del.icio.us. Besides, we study the linked users by their tags and find that users within a subscription network share more common interests than random pairs of users. During the analysis, we also discuss the implications of the findings for the design of tag-based system.