ppxscal/embedding_network huggingface dataset:
A cross entropy-Lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
Authors: M. Caserta, E. Quiñonez Rico
Venue: Computers and Operations Research (2009)

The aim of this article is to introduce a hybrid algorithm for the multi-item multi-period capacitated lot-sizing problem with setups. In this problem, demands over a finite planning horizon must be met, where several items compete for space with limited resources in each period, and a portion of these resources is used by setups. The proposed scheme considers a Lagrangean relaxation of the problem and applies a cross entropy-based metaheuristic to the uncapacitated version of the original problem. A thorough experimental plan has been designed and implemented to test the effectiveness and the robustness of the algorithm: first, drawing inspiration from the response surface methodology, we calibrate the algorithm by identifying the optimal parameters value for any given instance size. Next, we carry out experiments on large scale instances, collecting information about solution quality and computational time, and comparing these results with those offered by a global optimizer.
Method of Adaptive Quality Control in Service Oriented Architectures
Authors: Tomasz Szydlo, Krzysztof Zielinski
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Internet era is very attractive for growing up small companies and start-ups because of simplicity of selecting services that need to be used for composing complex applications. This model requires a novel approach to accounting and providing Quality of Service defined by Service Level Agreement. By characterizing these needs we make a proposal for service adaptation that can dynamically change offered quality with respect to customer's preferences and budget.
On a faster parallel implementation of the split-step Fourier method
Authors: J. Sánchez-Curto, P. Chamorro-Posada
Venue: Parallel Computing (2008)

A new parallel implementation of the split-step Fourier method is presented. The computational core of our scheme focuses on the parallelization of the whole linear step using a combination of fast cyclic convolutions and fast Fourier transforms. For all problems and cluster sizes tested, our method exhibits better performance than conventional parallel implementations of the split-step Fourier method using state-of-the art parallel fast Fourier transforms.
Spatial Fuzzy Clustering Using Varying Coefficients
Authors: Huaqiang Yuan, Yaxun Wang, Jie Zhang, Wei Tan, Chao Qu, Wenbin He
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

To consider spatial information in spatial clustering, the Neighborhood Expectation-Maximization (NEM) algorithm incorporates a spatial penalty term in the objective function. Such an addition leads to multiple iterations in the E-step. Besides, the clustering result depends mainly on the choice of the spatial coefficient, which is used to weigh the penalty term but is hard to determine a priori. Furthermore, it may not be appropriate to assign a fixed coefficient to every site, regardless of whether it is in the class interior or on the class border. In estimating class posterior probabilities, sites in the class interior should receive stronger influence from their neighbors than those on the border. To that end, this paper presents a variant of NEM using varying coefficients, which are determined by the correlation of explanatory attributes inside the neighborhood. Our experimental results on real data sets show that it only needs one iteration in the E-step and consequently converges faster than NEM. The final clustering quality is also better than NEM.
Splitting Atoms with Rely/Guarantee Conditions Coupled with Data Reification
Authors: Cliff B. Jones, Ken G. Pierce
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

This paper presents a novel formal development of a non-trivial parallel program: Simpson's implementation of asynchronous communication mechanisms (ACMs). Although the correctness of the "4-slot algorithm" has been shown elsewhere, earlier developments are by no means intuitive. The aims of this paper include both the presentation of an understandable (yet formal) design history and the establishment of another way of "splitting (software) atoms". Using the "fiction of atomicity" as an aid to understanding the initial steps of development, the top-level specification is developed to code. The rely-guarantee approach is, here, combined with notions of read/write frames and "phased" specifications; the atomicity assumptions implied by rely/guarantee conditions are realised by clever choice of data representation. The development method herein is compared with other approaches ---in a spirit of cooperation--- as the authors believe that constructive comparison elucidates many of the finer points in the "4-slot" specification/development and of parallel programs in general.
Newton's Method for ω-Continuous Semirings
Authors: Javier Esparza, Stefan Kiefer, Michael Luttenberger
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

Fixed point equations ${\bf\it X} = {\bf\it f}({\bf\it X})$ over &iquest;-continuous semirings are a natural mathematical foundation of interprocedural program analysis. Generic algorithms for solving these equations are based on Kleene's theorem, which states that the sequence ${\bf{0}}, {\bf\it f}({\bf{0}}), {\bf\it f}({\bf\it f}({\bf{0}})), \ldots$ converges to the least fixed point. However, this approach is often inefficient. We report on recent work in which we extend Newton's method, the well-known technique from numerical mathematics, to arbitrary &omega;-continuous semirings, and analyze its convergence speed in the real semiring.
The 7th Asian Symposium on Visualization
Authors: S. H. Winoto
Venue: Journal of Visualization (2004)

The 7th Asian Symposium on Visualization (7ASV) was successfully held in Singapore from 3rd to 7th November 2003. This event was originally scheduled from 26th to 30th May 2003, but had to be postponed because of the outbreak of SARS (Severe Acute Respiratory Syndrome) in some parts of the world. A total number of 122 participants attended the Symposium of which, 107 were foreign participants from 16 countries (excluding Singapore) worldwide. There were 104 papers covering broad range of topics presented at the Symposium which were delivered in 2 x 7 long sessions, and 9 keynote papers.
Training military commanders with simulation: a phenomenological study of task-technology fit
Authors: Richard V. Mccarthy
Venue:  (2008)

Task-technology fit is defined by Goodhue (1995) as the extent that technology functionality matches task requirements and individual abilities" (p. 1829). Many information technology applications are purchased, developed, and deployed without an understanding of whether the technology fits the task or whether it fits the needs of the user. Simulation is used to create a pseudo virtual environment for training executives and managers in decision-making and operational tasks. Similarly, the military uses simulation to train its officers. While there is agreement on the major constructs of task-technology fit, the research has not converged upon a core set of variables within each of those constructs. The primary purpose of this research is to more precisely describe and understand the meaning and critical dimensions of task-technology fit. In addition to discovering and describing the meaning of task-technology fit, the research investigated whether or not there is task-technology fit for the use of simulation in training. In the context of military training, the research asked whether the trainees (military officers as executives or operational managers) experience a fit between the simulations with which they were trained and their tasks (e.g., strategy or procedures), as reflected by their perception of whether their performance (outcomes) improved, and whether (how closely) the simulation accommodated their individual activities. The research method used to investigate these questions follows the qualitative research tradition of transcendental phenomenology to query the experience of those who were trained with simulation. This research focused on utilizing interview questions that elicit respondents' experience in the broad areas of task-technology fit, and through phenomenological analysis, attempted to identify the salient variables within each of these constructs. The analysis resulted in the identification of themes of meaning with were compared with the existing task-technology fit variables. The research identified which variables are consistent with existing task-technology fit constructs and identified the possible emergence of new task-technology fit variables.
Plenary lecture V: the power of two, speed of light, force and energy and the universal gas constant
Authors: Charles A. Long, Siavash H. Sohrab
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

The application of c2 in relation to mass and energy had an interesting history. The Pythagorean theorem is involved. Even in basic Newtonian physics the studies of retarded speed (in collisions) suggest multiplication of sums. When p = mv, and v = c, the term m c2 appears, which was one relation of momentum written by Poincaré. He also related mass and the speed of light to a complementary electromagnetic force. De Pretto, by means of no offered calculations, proposed energy equal to the product of mass and the speed of light squared. This was precisely the famous equation. He applied it hypothetically into a supposed material ether. He certainly considered mass as comprised of a great amount of latent heat, and mentioned how small the particles of ethereal matter must be to have escaped notice. He implied matter was miniscule in relation to its latent energy. Einstein also recognized the compact and enormous energy in mass, writing out the famous equation thereby establishing its popularity. By algebraic manipulations of sums and products, even common denominators, the square of light speed c became commonplace in physics, never related to the Euclidian concept, although it could be and could have been. A possible way that De Pretto could have arrived at his number 8338 is suggested and his number is identified as the modified universal gas constant R = 8338 Joules/(kgmol-K).
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
Authors: Roland Meyer, Victor Khomenko, Tim Strazny
Venue: Proceedings of the 29th international conference on Applications and Theory of Petri Nets (2008)

In this paper we propose a technique for verification of mobile systems. We translate finite control processes, which are a well-known subset of &Pi; -Calculus, into Petri nets, which are subsequently used for model checking. This translation always yields bounded Petri nets with a small bound, and we develop a technique for computing a non-trivial bound by static analysis. Moreover, we introduce the notion of safe processes, which are a subset of finite control processes, for which our translation yields safe Petri nets, and show that every finite control process can be translated into a safe one of at most quadratic size. This gives a possibility to translate every finite control process into a safe Petri net, for which efficient unfolding-based verification is possible. Our experiments show that this approach has a significant advantage over other existing tools for verification of mobile systems in terms of memory consumption and runtime.
On Using Dimensionality Reduction Schemes to Optimize Dissimilarity-Based Classifiers
Authors: Sang-Woon Kim, Jian Gao
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

The aim of this paper is to present a strategy by which a new philosophy for pattern classification pertaining to dissimilarity-based classifiers (DBCs) can be efficiently implemented. Proposed by Duin and his co-authors, DBCs are a way of defining classifiers among classes; they are not based on the feature measurements of individual patterns, but rather on a suitable dissimilarity measure among the patterns. The problem with this strategy is that we need to select a representative set of data that is both compact and capable of representing the entire data set. However, it is difficult to find the optimal number of prototypes and, furthermore, selecting prototype stage may potentially lose some useful information for discrimination. To avoid these problems, in this paper, we propose an alternative approach where we use all available samples from the training set as prototypes and subsequently apply dimensionality reduction schemes. That is, we prefer not to directly select the representative prototypes from the training samples; rather, we use a dimensionality reduction scheme after computing the dissimilarity matrix with the entire training samples. Our experimental results demonstrate that the proposed mechanism can improve the classification accuracy of conventional approaches for two real-life benchmark databases.
A mobile electronic toll collection for e-commerce applications
Authors: Chin E. Lin, Ling Yan Bi
Venue: Journal of Theoretical and Applied Electronic Commerce Research (2008)

This paper establishes a new mobile electronic toll collection (m-ETC) by integrating mobile communication with radio frequency (RF) communication on microprocessor control with an e-commerce business model. A simple ETC system architecture and protocol for e-transactions from vehicles to toll stations is proposed to complete toll interaction on wireless environment. A software flow through Internet is developed to link from toll station roadside units (RSU) to car units. A car unit (CU) for vehicle, a pair of roadside units (RSU), and an e-Center are established. A data flow and an interaction protocol are created. The proposed m-ETC system can be applied to different toll/charge systems with appropriate hardware and software. Some simulation test results verify basic system performance on ETC applications. A new business model for the proposed m-ETC is organized and discussed with feasibility analysis in e-commerce demonstration.
Computationally efficient mismatched filter design for pulse compression codes
Authors: Adly T. Fam
Venue:  (2007)

In this dissertation, computationally efficient mismatched filters are proposed to achieve sidelobe suppression in pulse compression codes. Length-optimal mismatched filters, that achieve the best possible peak sidelobe suppression or lowest integrated sidelobe levels for a given filter length, have been proposed in the literature. Since all the coefficients in these filters are optimized, a filter of length N, in general, requires N multipliers and N - 1 adders for its implementation. In this work, we propose two different types of mismatched filters that use significantly fewer multipliers and adders than the length-optimal filters for similar levels of sidelobe suppression. This is achieved at the cost of an increased latency compared to the length-optimal filters. As shown in this work, the proposed filters are particularly suitable for pulse compression codes that exhibit some regularity in the structure of their sidelobes. Results are presented for Barker codes and Huffman sequences and extended for compound Barker codes.
Checking Liveness Properties of Concurrent Systems by Reinforcement Learning
Authors: Tadashi Araragi, Seung Mo Cho
Venue: Model Checking and Artificial Intelligence: 4th Workshop, MoChArt IV, Riva del Garda, Italy, August 29, 2006, Revised Selected and Invited Papers (2007)

In this paper, we propose a new method of testing concurrent systems by using an artificial intelligence technique: reinforcement learning. In particular, the method verifies the liveness properties given in temporal logic formulas and dynamically controls a target system in runtime monitoring to efficiently reveal possible error against specification. In this control, the learning method accumulates necessary information by monitoring the running system. We built a simulator to evaluate this idea and conducted experiments with simple examples. As a result we showed the effectiveness of this approach for solving the difficult problem of testing the liveness properties of concurrent systems.
Few-cosine spherical codes and Barnes--Wall lattices
Authors: Robert L. Griess,  Jr.
Venue: Journal of Combinatorial Theory Series A (2008)

Using Barnes-Wall lattices and 1-cocycles on finite groups of monomial matrices, we give a procedure to construct tricosine spherical codes. This was inspired by a 14-dimensional code which Ballinger, Cohn, Giansiracusa and Morris discovered in studies of the universally optimal property. Their code has 64 vectors and cosines -37,-17,17. We construct the Optimism Code, a 4-cosine spherical code with 256 unit vectors in 16-dimensions. The cosines are 0,+/-14,-1. Its automorphism group has shape 2^1^+^8@?GL(4,2). The Optimism Code contains a subcode related to the BCGM code. The Optimism Code implies existence of a nonlinear binary code with parameters (16,256,6), a Nordstrom-Robinson code, and gives a context for determining its automorphism group, which has form 2^4:Alt"7.
Evaluating Interannual Vegetation Change in Songnen Plain from SPOT/VEGETATION Imagery
Authors: Fang Huang, Ping Wang, Xiangnan Liu
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

The temporal evolution of decadal NDVI composition is regarded as an effective time window which is able to show the natural seasonal variations. In this study, a time series of SPOT-VEGETATION Normalized Difference Vegetation Index (NDVI) data with 1×1 km² spatial resolution are used to detect the vegetation cover change in west Songnen plain, Northeast China during the period of 1998 to 2006. Our findings suggest that the yearly average Maximum Value Composite NDVI (MNDVI) over the study area decreased from 0.41 in 1998 to 0.39 in 2006, and the annual average NDVI value dropped by 0.015, which indicated the decreasing trend of vegetation activity. The degraded regions occupied 57.33% of the study area. Results can provide valuable information for environmental management policies involving biodiversity preservation and rational exploitation of natural and agricultural resources in this vulnerable ecotone.
Agent-based human behavior modeling for crowd simulation
Authors: Linbo Luo
Venue: Computer Animation and Virtual Worlds (2008)

Human crowd is a fascinating social phenomenon in nature. This paper presents our work on designing behavior model for virtual humans in a crowd simulation under normal-life and emergency situations. Our model adopts an agent-based approach and employs a layered framework to reflect the natural pattern of human-like decision making process, which generally involves a person's awareness of the situation and consequent changes on the internal attributes. The social group and crowd-related behaviors are modeled according to the findings and theories observed from social psychology (e.g., social attachment theory). By integrating our model into an agent execution process, each individual agent can response differently to the perceived environment and make realistic behavioral decisions based on various physiological, emotional, and social group attributes. To demonstrate the effectiveness of our model, a case study has been conducted, which shows that realistic human behaviors can be generated at both individual and group level. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Strategy-Trees: A Feedback Based Approach to Policy Management
Authors: Bradley Simmons, Hanan Lutfiyya
Venue: Proceedings of the 3rd IEEE international workshop on Modelling Autonomic Communications Environments (2008)

A strategy-tree is an abstraction that encapsulates and relates multiple strategies for achieving a high level directive. Policies represent the expression of how a strategy is to be implemented (i.e., what to do under a set of implicit assumptions). An architecture, based on a strategy-tree, is presented that monitors the effectiveness of the active policy set at achieving various directives, and is able to dynamically change strategy (policy set membership) in response to poor performance. An initial prototype is introduced and a simulation is discussed demonstrating the promise of this approach.
Fuzzy agent for elearner profile construction
Authors: Aboubekeur Hamdi-Cherif, Chafia Hamdi-Cherif, Ayedh Khalaf Rasheedi, Abdulaziz Saud Rasheedi
Venue: Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science (2008)

In this paper, we describe the design and development of a fuzzy agent-based system for an elarning environment that is capable of effective delivery of personalized courseware to elearners. By personalization, we mean that two different persons registered at the same e-course with comparable learning paces will have two different behaviors from the system. For so doing, we want to address a specific issue. We mean that we are given a set of courses displayed on the Web, a set of disciplines to which these courses belong, a number of visiting times any prospective elearner makes to the Web site. It is desired to find the fuzzy membership of this specific elearner to the given disciplines, and a profile for this elearner capable of predicting his future behavior i.e. what this elearner is planning to do without letting him explicitly express his query. In order to address this issue, we propose to use fuzzy logic to express gradual and imprecise membership and agent paradigm to express autonomy for mapping percepts coming from the environment into correct actions under the control of the logic embodied within it. Furthermore, we use state of the art advanced tools for implementation based on two versions. The first version, a prototype, is implemented using Matlab™. A second version using Microsoft™ .NET Technology, such as C#.NET™. This results in the development of an advanced fuzzy agent-based system for elearner profile construction capable of predicting human behavior during the process of learning while offering an intelligent Graphical User Interface (GUI).
A SPN-Based Delay Analysis of LEO Satellite Networks
Authors: Zhiguo Hong, Yongbin Wang, Minyong Shi
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

In this paper, we focus on the average time delay analysis of Low Earth Orbit (LEO) satellite networks. Firstly, a geometrical analysis of LEO satellite networks is given according to the characteristics of communication process. By taking the communication process of LEO satellite networks into account, average time delay is formulated by four parameters, i.e. average altitude of LEO satellite networks, uplink bandwidth, Inter-satellite links (ISLs) bandwidth and downlink bandwidth. Then, a Stochastic Petri Net (SPN) model is constructed. Accordingly, in order to represent the characteristics of average time delay, the arrival rate in the SPN model is mapped from the four above-mentioned parameters. Furthermore, the effects of these parameters on average time delay are also analyzed with Stochastic Petri Net Package (SPNP) 6.0. Because of its easiness and accuracy, the proposed approach has great benefit to the design and performance analysis of satellite networks.