ppxscal/embedding_network huggingface dataset:
A steady-state genetic algorithm for multi-product supply chain network design
Authors: Fulya Altiparmak, Mitsuo Gen, Lin Lin, Ismail Karaoglan
Venue: Computers and Industrial Engineering (2009)

Supply chain network (SCN) design is to provide an optimal platform for efficient and effective supply chain management (SCM). The problem is often an important and strategic operations management problem in SCM. The design task involves the choice of facilities (plants and distribution centers (DCs)) to be opened and the distribution network design to satisfy the customer demand with minimum cost. This paper presents a solution procedure based on steady-state genetic algorithms (ssGA) with a new encoding structure for the design of a single-source, multi-product, multi-stage SCN. The effectiveness of the ssGA has been investigated by comparing its results with those obtained by CPLEX, Lagrangean heuristic, hyrid GA and simulated annealing on a set of SCN design problems with different sizes.
Evaluation of an ultra-wide bandwidth wireless indoor non-line-of-sight channels
Authors: Yang Wang, Jie Zhang, Qinyu Zhang, Naitong Zhang
Venue: Wireless Communications Mobile Computing (2009)

In this paper, based on the analysis of the experimental data using a new post-processing method for time-domain channel measurements, a new double-cluster statistical model for UWB systems with a bandwidth lower than 1&thinsp;GHz in non-line-of-sight (NLOS) indoor propagation environment is proposed. By using the proposed model, both the model itself and the parameter estimation of the corresponding model are simplified. By defining the polarity of a particular model parameter, the model has the flexibility to deal with both &lsquo;soft NLOS&rsquo; and &lsquo;hard NLOS&rsquo; indoor propagation environments. Therefore, the channel impulse responses (CIRs) generated by the proposed model &lsquo;resemble&rsquo; the measured CIR better than the SV (Saleh--Valenzuela)-IEEE 802.15.3a model not only in terms of the average values, but also in terms of the cumulative distribution functions (CDFs) of the small-scale statistics. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Some Issues of the Paradigm of Multi-Learning Machine-Modular Neural Networks
Authors: Pan Wang, Shuai Feng, Zhun Fan
Venue: International Journal of Distributed Sensor Networks (2009)

This paper addresses some issues on the weighted linear integration of modular neural networks (MNN: a paradigm of hybrid multi-learning machines). First, from the general meaning of variable weights and variable elements synthesis, three basic kinds of integrated models are discussed that are intrinsic-factors-determined, extrinsic-factors-determined, and hybrid-factors-determined. The authors point out: integrations dominated by both of the internal and external elements are highly correlative with not only the historical quality of the sub-networks, but also with the environment in which the information is processed. In the sense of the mean of square error (MSE), several sufficient conditions to improve the whole system's performance are given while deleting one/some sub-networks in all the networks population. Meanwhile, when the whole performance of the current MNN system possesses is unsatisfactory, a corresponding improved strategy which need add one/some sub-networks is presented. For the optimal weights vector under the framework of the weighted sum of the sub-networks' outputs, we point out some constraints forms of the sub-networks' integrated weights are unreasonable and present a general form while the corresponding computational algorithms are described briefly. The authors present a new training algorithm of sub-networks named “'Expert in one thing and good at many' (EOGM).” In this algorithm, every sub-network is trained on a primary dataset with some of its near neighbors as the accessorial datasets. Simulated results with a kind of dynamic integration methods show the effectiveness of these algorithms, where the performance of the algorithm with EOGM is better than that of the algorithm with a common training method.
Shape-Value Abstraction for Verifying Linearizability
Authors: Viktor Vafeiadis
Venue: Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (2008)

This paper presents a novel abstraction for heap-allocated data structures that keeps track of both their shape and their contents. By combining this abstraction with thread-local analysis and rely-guarantee reasoning, we can verify a collection of fine-grained blocking and non-blocking concurrent algorithms for an arbitrary (unbounded) number of threads. We prove that these algorithms are linearizable, namely equivalent (modulo termination) to their sequential counterparts.
Some results on topological properties of folded hypercubes
Authors: Xie-Bin Chen
Venue: Information Processing Letters (2009)

An n-dimensional folded hypercube FQ"n is an attractive variance of an n-dimensional hypercube Q"n, it is obtained by adding an edge between every pair of vertices with complementary addresses. Recently, Hsieh studied edge-fault-tolerant Hamiltonicity of FQ"n, and Fang studied (bi)panconnectivity of FQ"n. In this paper, we first give a result on the connection between FQ"n and Q"n, then applying known topological properties of hypercubes, we improve the results of Hsieh; also, we obtain some results on fault-tolerant (bi)panconnectivity of FQ"n that generalize the results of Fang. By our method it is possible to obtain other topological properties of FQ"n.
A Structured Approach to Support 3D User Interface Development
Authors: Juan Manuel González-Calleros, Jean Vanderdonckt, Jaime Muñoz-Arteaga
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

Given its current state of the art, Model-Based UI Development (MBDUI) is able to fulfill the major requirements of desktop and mobile applications, such as form-based user interfaces that adapt to the actual context of use. More recent research deals with the development of 3D interactive multimodal environments. Though user-centered design is more and more driving the design of these environments, less attention is devoted to the development processes than to interactive tools supporting isolated phases in the realization process. In this paper we present an attempt to structure an approach to support 3DUIs development by introducing a MBDUI compliant method. The development method is articulated on three axes: models and their specification language, approach, and tools that support the method based on the underlying models.
Towards Flexible Information Architecture for Fractal Information Systems
Authors: Marite Kirikova
Venue: Proceedings of the 2009 International Conference on Information, Process, and Knowledge Management (2009)

In information systems development and usage the correspondence between concepts used at the business level and data structures processed at the computer systems level is to be established and maintained. The complexity of this task depends on the enterprise and information systems architectures that underlie a particular information system as well as on dynamic properties of information systems environment. In cases of heterogeneous domain ontologies and complex enterprise and information systems architectures, the fractal approach to information systems design can support balanced change propagation from business domain to computer systems domain that, in turn, allows to define and maintain flexible information architecture that supports business goals and processes. Fractal approach allows applying various systems development methods at different administrative levels of the business organization and thus can accelerate the IS development process and change management during the systems maintenance.
Simulation game-based virtual learning
Authors: Andreja Istenič Starčič
Venue: Proceedings of the 8th WSEAS international conference on Distance learning and web engineering (2008)

The paper describes the development of virtual simulation-game-based learning environment. Presented is a simulation-game tailored on the basis of constructivist theory for diversified student groups in graduate courses and employees in the tourism sector, aiming at giving them competences for international and global business management. The paper presents European project designing a VIRBUS simulation-game and virtual community for assisting collaboration among users: entrepreneurs, students, teachers and trainers. Focus groups were used in a design process and needs assessment was performed at the beginning of the project.
Study on Commercial Banks Credit Risk Based on AGA and Camel Rating System
Authors: Shaomei Yang, Junyan Zhao
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

The commercial banks risks come from all the uncertainty of the banking business, which have diffusibility and hidden features, if not timely controlled, will have a negative impact on the national economy. Therefore, it is necessary to design the corresponding index system according to the objectivity and relativity of the banking risks, and then control quantitatively the banks risk. Based on the analysis of commercial banks risk management situation and existing problems, this paper establishes a commercial banks credit risk evaluation index system with the camel rating thinking, and then describes AGA evaluation mechanism. In this paper, Hebei commercial bank credit risk evaluation index data as the network operator samples, we evaluated four commercial banks' credit risk in Beijing; the example results show that the model’s commonality is very good.
On the Spatial Distribution of Fingerprint Singularities
Authors: Raffaele Cappelli, Davide Maltoni
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

Fingerprint singularities play an important role in several fingerprint recognition and classification systems. Although some general relationships and constraints about the location of singularities in the different fingerprint classes are well known, to the best of our knowledge no statistical models have been developed until now. This paper studies the spatial distributions of singularity locations in nature and derives, from a representative dataset of labelled samples, the probability density functions of the four main fingerprint classes. The results obtained can be directly exploited to improve the accuracy of many techniques relying on the position of singularities, as confirmed by the results of two experiments on fingerprint classification and synthesis.
Optimal reconfiguration of distribution system by PSO and GA using graph theory
Authors: Mehdi Assadian, Malihe M. Farsangi, Hossein Nezamabadi-pour
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

This paper investigates the ability of particle swarm optimization (PSO) in cooperating by graph theory for network reconfiguration to reduce the power loss and voltage profile enhancement of distribution system. The numerical results are presented on a distribution system to illustrate the feasibility of the proposed method by PSO using graph theory. Furthermore, to validate the obtained results by PSO using graph theory, Genetic Algorithm (GA) using graph theory is applied and the results are compared.
Security of a Class of Knapsack Public-Key Cryptosystems against Low-Density Attack
Authors: Takeshi Nasako, Yasuyuki Murakami, Masao Kasahara
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In 2003, Kobayashi et al. proposed a new class of knapsack public-key cryptosystems over Gaussian integer ring. This scheme using two-sequences as the public key. In 2005, Sakamoto and Hayashi proposed an improved version of Kobayashi's scheme. In this paper, we propose the knapsack PKC using l-sequences as the public key and present the low-density attack on it. We have described Schemes R and G for l = 2, in which the public keys are constructed over rational integer ring and over Gaussian integer ring, respectively. We discusses on the difference of the security against the low-density attack. We show that the security levels of Schemes R and G differ only slightly.
Belief Function Theory Based Biometric Match Score Fusion: Case Studies in Multi-instance and Multi-unit Iris Verification
Authors: M. Vatsa, R. Singh, A. Noore, S. K. Singh
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

This paper presents a framework for multi-biometric match score fusion when non-ideal conditions cause conflict in the results of different classifiers. The proposed framework uses belief function theory to effectively fuse the match scores and density estimation technique to compute the belief assignments. Fusion is performed using belief models such as Transferable Belief Model (TBM) and Proportional Conflict Redistribution (PCR) Rule followed by the likelihood ratio based decision making. Experimental results on multi-instance and multi-unit iris verification show that the proposed fusion framework with PCR rule yields the best verification accuracy even when individual biometric classifiers provide highly conflicting match scores.
Contrast restoration of weather degraded images
Authors: Srinivasa G. Narasimhan, Shree K. Nayar
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

Images of outdoor scenes captured in bad weather suffer from poor contrast. Under bad weather conditions, the light reaching a camera is severely scattered by the atmosphere. The resulting decay in contrast varies across the scene and is exponential in the depths of scene points. Therefore, traditional space invariant image processing techniques are not sufficient to remove weather effects from images. In this paper, we present a physics-based model that describes the appearances of scenes in uniform bad weather conditions. Changes in intensities of scene points under different weather conditions provide simple constraints to detect depth discontinuities in the scene and also to compute scene structure. Then, a fast algorithm to restore scene contrast is presented. In contrast to previous techniques, our weather removal algorithm does not require any a priori scene structure, distributions of scene reflectances, or detailed knowledge about the particular weather condition. All the methods described in this paper are effective under a wide range of weather conditions including haze, mist, fog, and conditions arising due to other aerosols. Further, our methods can be applied to gray scale, RGB color, multispectral and even IR images. We also extend our techniques to restore contrast of scenes with moving objects, captured using a video camera.
Authorization and Obligation Policies in Dynamic Systems
Authors: Michael Gelfond, Jorge Lobo
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

The paper defines a language for specifying authorization and obligation policies of an intelligent agent acting in a changing environment and presents several ASP based algorithms for checking compliance of an event with a policy specified in this language. The language allows representation of defeasible policies and is based on theory of action and change.
Ballistic mobility and saturation velocity in low-dimensional nanostructures
Authors: Ismail Saad, Michael L. P. Tan, Ing Hui Hii, Razali Ismail, Vijay K. Arora
Venue: Microelectronics Journal (2009)

Ohm's law, a linear drift velocity response to the applied electric field, has been and continues to be the basis for characterizing, evaluating performance, and designing integrated circuits, but is shown not to hold its supremacy as channel lengths are being scaled down. In the high electric field, the collision-free ballistic transport is predicted, while in low electric field the transport remains predominantly scattering-limited in a long-channel. In a micro/nano-circuit, even a low logic voltage of 1V gives an electric field that is above its critical value εc (ε>>εc) triggering non-ohmic behavior that results in ballistic velocity saturation. The saturation velocity is an appropriate thermal velocity for a non-degenerate and Fermi velocity for a degenerate system with given dimensionality. A quantum emission may lower this ballistic velocity. The collision-free ballistic mobility in the ohmic domain arises when the channel length is smaller than the mean free path. The results presented will have a profound influence in interpreting the data on a variety of low-dimensional nanostructures.
A simulation based scheduling model for call centers with uncertain arrival rates
Authors: Thomas R. Robbins, Terry P. Harrison
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In this paper we develop a two stage algorithm for scheduling call centers with strict SLAs and arrival rate uncertainty. The first cut schedule can be developed in less than a minute using a constructive heuristic. The schedule is then refined via a simulation based optimization approach. We find that when allowed to run for five minutes or less this two stage process can create a schedule with a total expected cost within a few percentage points of schedules generated using much more computationally intensive methods. This rapid scheduling process is designed to support front line managers who wish to evaluate multiple scheduling options in a what if analysis mode.
Parallelization of a Vlasov-Maxwell solver in four-dimensional phase space
Authors: L. K. S. Daldorff, B. Eliasson
Venue: Parallel Computing (2009)

We present a parallelized algorithm for solving the time-dependent Vlasov-Maxwell system of equations in the four-dimensional phase space (two spatial and velocity dimensions). One Vlasov equation is solved for each particle species, from which charge and current densities are calculated for the Maxwell equations. The parallelization is divided into two different layers. For the first layer, each plasma species is given its own processor group. On the second layer, the distribution function is domain decomposed on its dedicated resources. By separating the communication and calculation steps, we have met the design criteria of good speedup and simplicity in the implementation.
Border Sampling through Coupling Markov Chain Monte Carlo
Authors: Guichong Li, Nathalie Japkowicz, Trevor J. Stocki, R. Kurt Ungar
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Recently, Progressive Border Sampling (PBS) was proposed for sample selection in supervised learning by progressively learning an augmented full border from small labeled datasets. However, this quadratic learning algorithm is inapplicable to large datasets. In this paper, we incorporate the PBS to a state of the art technique called Coupling Markov Chain Monte Carlo (CMCMC) in an attempt to scale the original algorithm up on large labeled datasets. The CMCMC can produce an exact sample while a naive strategy for Markov Chain Monte Carlo cannot guarantee the convergence to a stationary distribution. The resulting CMCMC-PBS algorithm is thus proposed for border sampling on large datasets. CMCMC-PBS exhibits several remarkable characteristics: linear time complexity, learner-independence, and a consistent convergence to an optimal sample from the original training sets by learning from their subsamples. Our experimental results on the 33 either small or large labeled datasets from the UCIKDD repository and a nuclear security application show that our new approach outperforms many previous sampling techniques for sample selection.
Profile Management and Authentication Using LDAP
Authors: Mohammed A. Qadeer, Mohammad Salim, M. Sana Akhtar
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

In this paper, we present the technique to manage user profiles and authentication using LDAP (Lightweight Directory Access Protocol). The User profiles maintained in the LDAP Directory Information Tree (DIT)which contains various information about users. This information can be retrieved by the users depending upon the level of access provided to them on the network. Various services use this authentication mechanism to allow the authorized users, who provide correct authentication information as stored in the LDAP Server, to use the corresponding services. Virtual Private Network (VPN), Remote Access Server (RAS), Web Server, Mail Server can use LDAP for authenticating users.
(Zn, Mg)O/ZnO-based heterostructures grown by molecular beam epitaxy on sapphire: Polar vs. non-polar
Authors: J. -M. Chauveau, C. Morhain, M. Teisseire, M. Laügt, C. Deparis, J. Zuniga-Perez, B. Vinter
Venue: Microelectronics Journal (2009)

Zinc oxide (ZnO) has recently attracted considerable attention because of its unique physical properties and its potential applications in the blue and UV spectral range. Up to now, ZnO-based heterostructures have mostly been grown in a c-orientation. The growth of non-polar layers along the a-direction [1 1 2¯0] has been proposed to avoid any built-in electric fields in the c-direction. Polar and non-polar quantum wells (QWs) embedded in (Zn, Mg)O barriers were grown on an optimized buffer. We compare the photoluminescence (PL) emission of a- and c-oriented QWs. From this comparison, we demonstrate that the QWs exhibit confinement but no indication of quantum confined Stark effect, contrary to what is observed in c-oriented structures. In the non-polar orientation, it is shown that the thermal quenching is not related to the thermal escape of excitons from the ZnO area, since the calculated activation energies are much lower.
On the convergence of a new time window discretization method for the traveling salesman problem with time window constraints
Authors: Xiubin Wang, Amelia C. Regan
Venue: Computers and Industrial Engineering (2009)

In this paper, we discuss convergence of a time window discretization method for the traveling salesman problem with time window constraints. This recently proposed discretization method leads to a lower bound to the minimization problem. Analysis shows that this method always guarantees convergence to the optimal solution. We also illustrate that the traditional method that gives feasible solutions does not always provide such a guarantee.
Applying Approximate Counting for Computing the&#x00a0;Frequency Moments of Long Data Streams
Authors: Andr&#x00e9; Gronemeier, Martin Sauerhoff
Venue: Theory of Computing Systems (2009)

This paper takes up a remark in the well-known paper of Alon, Matias, and Szegedy (J.&#x00a0;Comput. Syst. Sci. 58(1):137&#x2013;147, 1999) about the computation of the frequency moments of data streams and shows in detail how any&#x00a0;F k with k&#x2265;1 can be approximately computed using space O(km 1&#x2212;1/k (k+log&#x2009;m+log&#x2009;log&#x2009;&#x2009;n)) based on approximate counting. An important building block for this, which may be interesting in its own right, is a new approximate variant of reservoir sampling using space O(log&#x2009;log&#x2009;&#x2009;n) for constant error parameters.
A Note on Axiom System for SBL¬-algebras
Authors: Radomír Halaš
Venue: Fundamenta Informaticae (2009)

In the paper we resolve an open problem posed by D.Ciucci in [1] on the independence of axioms for SBL&not;-algebras. The main aim is to present its solution which is, in contrast to the one presented in [4], simple, transparent and easily verifiable.