ppxscal/embedding_network huggingface dataset:
Sustainable warehouse management
Authors: Kah-Shien Tan, M. Daud Ahmed, David Sundaram
Venue: Proceedings of the International Workshop on Enterprises & Organizational Modeling and Simulation (2009)

Sustainable warehouse is about integrating, balancing and managing the economic, environmental and social inputs and outputs of the warehouse operations. Sustainability is a core value to many businesses but they find it hard to implement in their current business setting especially when they use third party logistics management system like warehousing and distribution in their supply chain business network. This paper explores the application of sustainability principles in the context of warehouse storage and distribution management and introduces a sustainability model for setting up of a warehouse or transformation of an existing warehouse that provides the storage services. The model in corporates the usage of third party transportation systems for supply and distribution services.
Hardware implementation of an efficient internet protocol routing filter design
Authors: A. A. Raj, M. Suganthi
Venue: International Journal of Computers and Applications (2008)

In this paper we propose a new mechanism for an efficient router design with focus to an IP address lookup algorithm, which uses a small amount of memory. Typically each filter is a destination address prefix and longest prefix matching is used to determine the next hop for each incoming packets. By exploiting the low memory access latency and high bandwidth of on chip memory high speed packet forwarding can be achieved using this data structure. When designing a router, three pertinent issues are to be addressed (i.e., routing lookup, switching and scheduling). The main objective of this paper is to design an efficient router that uses a fast routing lookup algorithm and an efficient data compression algorithm to store the routing table in a tree, which uses a very little memory in the router. The route lookup mechanism proposed in this paper, when implemented in a pipeline fashion in hardware, can achieve one route lookup for every memory access. With the current 50 ns DRAM, this corresponds to approx 20 x 106 packets (lookups) per second. Analysis shows that this algorithm needs only 400kb memory for storing 20 k entries thus achieving a high compression. This design can be easily scaled up from Internet protocol version 4 (Ipv4) to Internet protocol version 6 (IPv6).
Brief paper: Design of input shapers using modal cost for multi-mode systems
Authors: Ravi Kumar, Tarunraj Singh
Venue: Automatica (Journal of IFAC) (2010)

This paper presents two techniques for the determination of modal weights for the design of robust input shapers for multi-mode systems. The weights for the first technique are derived based on the scaling factor for the potential energy in each mode, such that the modal displacement is the same. The second technique exploits the modal cost analysis which uses the angle between the right eigenvectors and the row vectors of the output matrix to determine the contribution of each mode to the output. Two examples are used to illustrate the improvement in performance of the modal weighted minimax shapers compared to the traditional minimax shaper which equally weights all the modes.
Formal design and implementation of constraints in software components
Authors: Antonio Coronato, Giuseppe De Pietro
Venue: Advances in Engineering Software (2010)

This paper deals with the modeling, automatic implementation and runtime verification of constraints in component-based applications. Constraints have been assuming an ever more relevant role in modeling distributed systems as long as business rules implementation, design-by-contract practice, and fault-tolerance requirements are concerned. Nevertheless, component developers are not sufficiently supported by existing tools to model and implement such features. In this paper, we propose a methodology and a set of tools that enable developers both to model component constraints and to generate automatically component skeletons that already implement such constraints. The methodology has been extended to support implementation even in case of legacy components.
Numerical modelling of fatigue crack initiation of martensitic steel
Authors: S. Glode, N. Jezernik, J. Kramberger, T. Lassen
Venue: Advances in Engineering Software (2010)

Numerical simulation of micro-crack initiation that is based on Tanaka-Mura micro-crack nucleation model is presented. Three improvements were added to this model. Firstly, multiple slip bands where micro-cracks may occur are used in each grain. Second improvement deals with micro-crack coalescence by extending existing micro-cracks along grain boundaries and connecting them into a macro-crack. The third improvement handles segmented micro-crack generation, where a micro-crack is not nucleated in one step like in Tanaka-Mura model, but is instead generated in multiple steps. Numerical simulation of crack-initiation was performed with ABAQUS, using a plug-in that was written specially for handling micro-crack nucleation and coalescence. Since numerical model was directed at simulating fatigue properties of thermally cut steel with martensitic structure, edge properties of specimen were additionally inspected in terms of micro-structural properties, surface roughness and residual stresses.
Normalization rules of the object-oriented data model
Authors: Vojtěch Merunka, Jiří Brožek, Martin Šebek, Martin Molhanec
Venue: Proceedings of the International Workshop on Enterprises & Organizational Modeling and Simulation (2009)

There are only very few approaches to normalizing object-oriented data. In this paper we present an approach to normalization of the object-oriented conceptual model based on UML class diagrams. First part of the paper describes the current status in the area of formal methods used for object-oriented data modeling. Second part presents four normalization rules, which are based on own experience and modified Ambler-Beck approach. These normalization rules are introduced on an example. Our method has been used in education at several universities. It has been and is also used for database design in software development projects, which we carried out. Recently, development of the CASE tool based on this approach has been started.
Modelling and predictive control of a multivariable process using recurrent neural networks
Authors: N. Sivakumaran, T. K. Radhakrishnan
Venue: International Journal of Modelling and Simulation (2008)

Industrial processes are naturally multivariable in nature, which exhibit non-linear behaviour and complex dynamic properties. The multivariable four-tank system has attracted recent attention as it exhibits elegantly complex dynamics, which includes interaction, transmission zero, and non-minimum phase characteristics that emerge from a simple cascade of tanks. In this paper, a neural model predictive controller (NMPC) is compared with a decentralized PI controller designed for a four-tank system. The approach adopts the approximation capabilities of a recurrent Elman network for modelling purposes. The learning process is performed with a modification of a back propagation through time (BPTT) algorithm. The algorithms are simulated using MATLAB and the performances of NMPC and decentralized PI control are compared based on integral square error (ISE) values for set point tracking and load changes. The performance comparison shows that NMPC is a suitable controller for four-tank system.
Viewing cancer genes from co-evolving gene modules
Authors: Jing Zhu, Hui Xiao, Xiaopei Shen, Jing Wang, Jinfeng Zou, Lin Zhang, Da Yang, Wencai Ma, Chen Yao, Xue Gong, Min Zhang, Yang Zhang, Zheng Guo
Venue: Bioinformatics (2010)

Motivation: Studying the evolutionary conservation of cancer genes can improve our understanding of the genetic basis of human cancers. Functionally related proteins encoded by genes tend to interact with each other in a modular fashion, which may affect both the mode and tempo of their evolution. Results: In the human PPI network, we searched for subnetworks within each of which all proteins have evolved at similar rates since the human and mouse split. Identified at a given co-evolving level, the subnetworks with non-randomly large sizes were defined as co-evolving modules. We showed that proteins within modules tend to be conserved, evolutionarily old and enriched with housekeeping genes, while proteins outside modules tend to be less-conserved, evolutionarily younger and enriched with genes expressed in specific tissues. Viewing cancer genes from co-evolving modules showed that the overall conservation of cancer genes should be mainly attributed to the cancer proteins enriched in the conserved modules. Functional analysis further suggested that cancer proteins within and outside modules might play different roles in carcinogenesis, providing a new hint for studying the mechanism of cancer. Contact: guoz@ems.hrbmu.edu.cn Supplementary information: Supplementary data are available at Bioinformatics online. 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
The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm
Authors: Temel Öncan, Abraham P. Punnen
Venue: Computers and Operations Research (2010)

In this paper we consider the quadratic minimum spanning tree problem (QMSTP) which is known to be NP-hard. Given a complete graph, the QMSTP consists of finding a minimum spanning tree (MST) where interaction costs between pairs of edges are prescribed. A Lagrangian relaxation procedure is devised and an efficient local search algorithm with tabu thresholding is developed. Computational experiments are reported on standard test instances, randomly generated test instances and quadratic assignment problem (QAP) instances from the QAPLIB by using a transformation scheme. The local search heuristic yields very good performance and the Lagrangian relaxation procedure gives the tightest lower bounds for all instances when compared to previous lower bounding approaches.
A video error resilience redundant slices algorithm and its performance relative to other fixed redundancy schemes
Authors: Pierre Ferré, Dimitris Agrafiotis, David Bull
Venue: Image Communication (2010)

In this paper, a redundant picture formation algorithm that takes into account a given redundancy rate constraint is presented for error resilient wireless video transmission without reliance on retransmissions. The algorithm assigns priorities to macroblocks (MBs) according to two suggested metrics and ranks MBs accordingly. The first metric is based on an end-to-end distortion model and aims at maximising the reduction in distortion per redundancy bit. The end-to-end distortion accounts for the effects of error propagation, mismatch between the primary and redundancy description and error concealment. MBs providing large distortion reduction for fewer bits spent are assigned a higher priority. The second metric employs the variance of the motion vectors of a macroblock and those of its neighbouring blocks. Results show that the rate distortion metric outperforms other examined metrics by up to 2dB. A comparison with other error resilience schemes, such as loss adaptive-rate distortion optimisation (LA-RDO) and cross packet forward error correction (FEC), is also presented. Results show that our approach outperforms the LA-RDO solution. Cross packet FEC provides better performance in the presence of random packet losses. However, results show that our approach can tackle bursty losses better. With bursty errors, the correction capabilities of the Reed-Solomon codes can be exceeded, and the availability of a coarse representation of the coded macroblocks, through a redundant slice scheme, can offer performance gains of up to 1dB.
Using natural language processing to identify the rhetoric of deception in business and competitive intelligence email communications
Authors: Daniel R. Rota
Venue:  (2008)

This study extended previous work that identified linguistic-based cues (e.g. an increased use of modifiers), through the use of natural language processing techniques, as effective discriminators between truthful and deceptive messages in negotiative email communications. The extension of the previous research included linguistic-based cues as they related to management informative tasks comprised of business and competitive intelligence information, rather than negotiation-based information sharing. A follow-up survey captured demographic and socioeconomic and sociocultural information about participants. Such types of information have previously been shown as having the potential to influence participants' language use. The results of the study indicated that many of the linguistic-based cues that effectively discriminate between deceptive and truthful message senders differ in both type, and in many cases, direction, by genre discourse (negotiative versus informative), though some commonalities were found. Participants in this study also showed differences in affective characteristics associated with their levels of comfort in composing either truthful or deceptive messages. The confidence levels of participants also varied by management information types. Finally, when considering demographic (sex) and socioeconomic (income level) variables across informing conditions (truthful, deceptive), differences were found within several of the linguistic-based cues both independently and as a result of the moderating effects of sociocultural and/or demographic variables. These findings provide evidence of (1) the need to consider the genre of the writing when trying to detect deception; (2) the potential affective influences of deceptive writing tasks; (3) an area in higher education, forecasting, which may need to be remediated; and (4) the need to consider demographic and sociocultural information in the selection of cues to apply in detecting deception in business and competitive intelligence emailed communications. 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
Assigning roles to DNA regulatory motifs using comparative genomics
Authors: Fabian A. Buske, Mikael Bodén, Denis C. Bauer, Timothy L. Bailey
Venue: Bioinformatics (2010)

Motivation: Transcription factors (TFs) are crucial during the lifetime of the cell. Their functional roles are defined by the genes they regulate. Uncovering these roles not only sheds light on the TF at hand but puts it into the context of the complete regulatory network. Results: Here, we present an alignment-and threshold-free comparative genomics approach for assigning functional roles to DNA regulatory motifs. We incorporate our approach into the Gomo algorithm, a computational tool for detecting associations between a user-specified DNA regulatory motif [expressed as a position weight matrix (PWM)] and Gene Ontology (GO) terms. Incorporating multiple species into the analysis significantly improves Gomo's ability to identify GO terms associated with the regulatory targets of TFs. Including three comparative species in the process of predicting TF roles in Saccharomyces cerevisiae and Homo sapiens increases the number of significant predictions by 75 and 200%, respectively. The predicted GO terms are also more specific, yielding deeper biological insight into the role of the TF. Adjusting motif (binding) affinity scores for individual sequence composition proves to be essential for avoiding false positive associations. We describe a novel DNA sequence-scoring algorithm that compensates a thermodynamic measure of DNA-binding affinity for individual sequence base composition. Gomo's prediction accuracy proves to be relatively insensitive to how promoters are defined. Because Gomo uses a threshold-free form of gene set analysis, there are no free parameters to tune. Biologists can investigate the potential roles of DNA regulatory motifs of interest using Gomo via the web ( http://meme.nbcr.net). Contact: t.bailey@uq.edu.au Supplementary information:Supplementary data are available at Bioinformatics online. 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
Recursive predictor design for state and output feedback controllers for linear time delay systems
Authors: Mrdjan Jankovic
Venue: Automatica (Journal of IFAC) (2010)

This paper presents a recursive method to design state and output feedback controllers for MIMO, block-feedforward linear systems with delays in the inputs, outputs, and interconnections between the blocks. The resulting controller is of predictor-type, which means that it contains finite integrals over past state and input values. The method is a generalization of the well-known model reduction approach for systems with input delay. A recursive procedure replaces delay terms with non-delay ones step by step, from the top of the cascade structure down. Controller gains are computed for the proxy system without delays, while the construction guarantees the same closed loop poles for the delay system and the proxy one. The observer is designed by applying the duality argument and the separation principle is also shown to apply.
An efficient retinex-like brightness normalization method for coding camera flashes and strong brightness variation in videos
Authors: Hoi-Kok Cheung, Wan-Chi Siu, Dagan Feng, Zhiyong Wang
Venue: Image Communication (2010)

Conventional hybrid video coding systems rely on the assumption that the brightness is constant. This does not take inter-frame brightness variations into consideration during motion estimation and compensation processes. Under the influence of inter-frame lighting variations like camera flashes, video motion activities are not accurately estimated and the pixel prediction is poor which directly increases the bits for prediction error coding. In this paper, we propose an efficient algorithm based on the retinex-like system which allows inter-frame brightness being normalized before applying the conventional motion estimation and compensation. Experimental results show that our approach is superior to all similar approaches in the literature and demonstrate that our proposed system is very robust against the inter-frame brightness variations. Further experimental works have been done using the verification models of the MPEG-4 and the H.264 on sequences with brightness variations, results of which show that our proposed system outperforms these coding systems, including the weighted prediction feature in H.264, which were specifically designed for this purpose.
Some extensions of Faà di Bruno's formula with divided differences
Authors: Aimin Xu, Chengjing Wang
Venue: Computers Mathematics with Applications (2010)

The well-known formula of Faa di Bruno's for higher derivatives of a composite function has played an important role in combinatorics. In this paper we generalize the divided difference form of Faa di Bruno's formula and give an explicit formula for the n-th divided difference of a multicomposite function. More generally, we establish the relationships of the Bell polynomials with respect to multicomposite functions. Applying these to multicomposite functions, we obtain some extensions of Faa di Bruno's formula.
Remote terminal units for distribution automation: development and commissioning experience
Authors: R. P. Gupta, S. C. Srivastava, R. K. Varma
Venue: International Journal of Computers and Applications (2008)

This paper describes indigenous design, development, and commissioning of Remote Terminal Units (RTUs) for computer-aided monitoring and control of 10MVA power distribution network of Indian Institute of Technology Kanpur in India. RTUs play a significant role in data monitoring and control of the power distribution network from a remote location. Remote monitoring and control of the distribution system is also called Distribution Automation (DA). The developed and commissioned RTUs are based on an architecture that eliminates the requirement of DC transducer stage. This significantly reduces the cost and size of the RTU and the effort required during installation and commissioning of the RTU. The developed RTUs support the industry standard open protocol "Distributed Network Protocol (DNP3.0)" for data communication.
Regulatory impact factors
Authors: Antonio Reverter, Nicholas J. Hudson, Shivashankar H. Nagaraj, Miguel Pérez-Enciso, Brian P. Dalrymple
Venue: Bioinformatics (2010)

Motivation: Although transcription factors (TF) play a central regulatory role, their detection from expression data is limited due to their low, and often sparse, expression. In order to fill this gap, we propose a regulatory impact factor (RIF) metric to identify critical TF from gene expression data. Results: To substantiate the generality of RIF, we explore a set of experiments spanning a wide range of scenarios including breast cancer survival, fat, gonads and sex differentiation. We show that the strength of RIF lies in its ability to simultaneously integrate three sources of information into a single measure: (i) the change in correlation existing between the TF and the differentially expressed (DE) genes; (ii) the amount of differential expression of DE genes; and (iii) the abundance of DE genes. As a result, RIF analysis assigns an extreme score to those TF that are consistently most differentially co-expressed with the highly abundant and highly DE genes (RIF1), and to those TF with the most altered ability to predict the abundance of DE genes (RIF2). We show that RIF analysis alone recovers well-known experimentally validated TF for the processes studied. The TF identified confirm the importance of PPAR signaling in adipose development and the importance of transduction of estrogen signals in breast cancer survival and sexual differentiation. We argue that RIF has universal applicability, and advocate its use as a promising hypotheses generating tool for the systematic identification of novel TF not yet documented as critical. Contact: tony.reverter-gomez@csiro.au Supplementary information: Supplementary data are available at Bioinformatics online. 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
Technical communique: On polytopic inclusions as a modeling framework for systems with time-varying delays
Authors: R. H. Gielen, S. Olaru, M. Lazar, W. P. M. H. Heemels, N. van de Wouw, S. -I. Niculescu
Venue: Automatica (Journal of IFAC) (2010)

One of the important issues in networked control systems is the appropriate handling of the nonlinearities arising from uncertain time-varying delays. In this paper, using the Cayley-Hamilton theorem, we develop a novel method for creating discrete-time models of linear systems with time-varying input delays based on polytopic inclusions. The proposed method is compared with existing approaches in terms of conservativeness, scalability and suitability for controller synthesis.