ppxscal/embedding_network huggingface dataset:
Global optimization of higher order moments in portfolio selection
Authors: Dietmar Maringer, Panos Parpas
Venue: Journal of Global Optimization (2009)

We discuss the global optimization of the higher order moments of a portfolio of financial assets. The proposed model is an extension of the celebrated mean variance model of Markowitz. Asset returns typically exhibit excess kurtosis and are often skewed. Moreover investors would prefer positive skewness and try to reduce kurtosis of their portfolio returns. Therefore the mean variance model (assuming either normally distributed returns or quadratic utility functions) might be too simplifying. The inclusion of higher order moments has therefore been proposed as a possible augmentation of the classical model in order to make it more widely applicable. The resulting problem is non-convex, large scale, and highly relevant in financial optimization. We discuss the solution of the model using two stochastic algorithms. The first algorithm is Differential Evolution (DE). DE is a population based metaheuristic originally designed for continuous optimization problems. New solutions are generated by combining up to four existing solutions plus noise, and acceptance is based on evolutionary principles. The second algorithm is based on the asymptotic behavior of a suitably defined Stochastic Differential Equation (SDE). The SDE consists of three terms. The first term tries to reduce the value of the objective function, the second enforces feasibility of the iterates, while the third adds noise in order to enable the trajectory to climb hills.
A generalized inverse eigenvalue problem in structural dynamic model updating
Authors: Yong-Xin Yuan, Hua Dai
Venue: Journal of Computational and Applied Mathematics (2009)

This paper is concerned with the problem of the best approximation for a given matrix pencil under a given spectral constraint and a submatrix pencil constraint. Such a problem arises in structural dynamic model updating. By using the Moore-Penrose generalized inverse and the singular value decomposition (SVD) matrices, the solvability condition and the expression for the solution of the problem are presented. A numerical algorithm for solving the problem is developed.
Satellite Integration into Networks for UMTS Services (SINUS)
Authors: Michel Mazzella
Venue: Space Communications (1999)

The Universal Mobile Telecommunications System (UMTS) under development in the international community has been agreed to include both terrestrial and space segments as integral parts of the system. The purpose of the SINUS project is to demonstrate that UMTS services can be provided seamlessly via satellite, and to make recommendations concerning the interworking between space and terrestrial segments. The SINUS laboratory system demonstrator is being developed to illustrate the role of the Satellite-UMTS, including a real-time emulator with programmable perturbations in the link to the mobile user, representing all expected satellite constellation and mobile link characteristics. The Mobile Terminal and Fixed Earth Station (FES) consist of CDMA modulator/demodulators for satellite-specific communication functions, and also include software for more generic UMTS network functions (e.g., call management, mobility, handover). To demonstrate the realistic operation of the system, several examples of multimedia applications will be implemented from end to end.
Everything You Know About CSS is Wrong!
Authors: Rachel Andrew, Kevin Yank
Venue:  (2008)

Get ready to experience an eye-opening expos on CSS as you know it today. You'll discover a fresh approach to coding Cascading Style Sheets, making old hacks and workarounds a distant memory. In this book, you'll learn how to start taking full advantage of Internet Explorer 8 using the very latest CSS techniques -- whilst still catering for those nasty old browsers. You'll unearth what's put the final nail in the HTML table-based layout coffin, and gain an understanding from two experts why CSS has a very bright future. Some of the valuable insights in this book include:how you can take full advantage of IE8 how to take CSS tables to the limit and beyond letting you say goodbye to old hacks and workarounds FOREVER! help you rediscover what you first loved about CSS ensure make the most of what CSS has to offer understand the road ahead for CSS CSS was conceived in an age when web site design was simple; its creators never anticipated the level of intricacy required in the designs that it would be asked to deliver today. Clever designers figured out ways to make CSS do what they needed, but using techniques so convoluted that it became unpredictable and difficult to master. CSS just became too hard ... The good news is, that's all about to change, and this book will show you how!
Data Retrieval and Security Using Lightweight Directory Access Protocol
Authors: Mohammad Salim, M. Sana Akhtar, Mohammed A. Qadeer
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

In the present world of communication and information interchange where more and more users are bound to use the same services and data with different access levels, the need for providing protection against potential breach of secured data has gained profound importance. Some of the common services are Virtual Private Network (VPN), Remote Access Server (RAS), Web Server, Mail Server etc. In the following paper we present the technique of providing customized user level access and security through the use of LDAP for above mentioned services. The profiles of all users are maintained under LDAP directory Information Tree (DIT) from which information about any particular user, willing to login or retrieve data, can be used to provide successful authentication.
SIP intrusion detection and response architecture for protecting SIP-based services
Authors: KyoungHee Ko, Hwan-Kuk Kim, JeongWook Kim, Chang-Yong Lee, HyunCheol Jeong
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

After 3GPP had selected SIP as the signaling protocol for IMS, it is expected that SIP plays an important role in IP multimedia services. But, since SIP-based services are offered over the internet, there are security threats inherited from the internet environment. There are also new security threats because new techniques have been introduced to deliver multimedia traffic over the internet. In this paper, we propose the SIP intrusion detection and response architecture for protecting SIP-based services. The proposed architecture consists of detection of SIP-based attacks, detection of SIP traffic anomaly, and management of SIP-aware security devices. This is helpful to counter newly introduced SIP-based attacks without degradation of multimedia quality.
Non-linear properties of nitride-based nanostructures for optically controlling the speed of light at 1.5µm
Authors: F. B. Naranjo, M. González-Herráez, S. Valdueza-Felip, H. Fernández, J. Solis, S. Fernández, E. Monroy, J. Grandal, M. A. Sánchez-García
Venue: Microelectronics Journal (2009)

Future bandwidth demand in optical communications requires all-optical devices based on optical non-linear behavior of materials. InN, with a room temperature direct bandgap well below 0.82eV (1.5@mm) is very attractive for these applications. In this work, we characterize the non-linear optical response and recombination lifetime of the interband transition of InN layers grown on GaN template and Si(111) by molecular beam epitaxy. Non-linear characterization shows a decrease of the third-order susceptibility, @g^(^3^), and an increase of recombination lifetime when decreasing the energy difference between the excitation and the apparent optical band-gap energy of the analysed samples. Taking into account the non-linear characterization, an optically controlled reduction of the speed of light by a factor S=4.2 is obtained for bulk InN at 1.5@mm. The S factor of InN (5nm)/In"0"."7Ga"0"."3N (8nm) multiple quantum well heterostructures at the same operation wavelength is analysed, predicting an increase of this factor of three orders of magnitude. This result would open the possibility of using InN-based heterostructures for all-optical devices applications.
A critical global convergence analysis of recurrent neural networks with general projection mappings
Authors: Chen Qiao, Zongben Xu
Venue: Neurocomputing (2009)

In this paper, we present some general analysis on global convergence of the recurrent neural networks (RNNs) with projection mappings in the critical case when M(L,@C), a matrix related to the weight matrices and the activation mappings of the networks, is nonnegative definite for some positive diagonal matrix @C. Considerable stability results have been obtained for the RNNs in the noncritical case when M(L,@C) is positive definite. In contrast, only a few conclusions have been conducted under the critical conditions. Comparing with the existing critical studies, the present critical stability results in this paper require no additional assumption on the weight matrices, can be applied to the RNNs with general projection mappings other than nearest point projection mappings, and can serve for both two fundamental RNN models. The results established for several typical RNN models unify, sharpen or generalize most of the existing stability assertions. Two examples are given to show both theoretical importance and practical feasibility of the critical results obtained.
Preprocessing and Feature Preparation in Chinese Web Page Classification
Authors: Weitong Huang, Luxiong Xu, Yanmin Liu
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

A detailed design and implementation of a Chinese web-page classification system is described in this paper, and some methods on Chinese web-page preprocessing and feature preparation are proposed. Experimental results on a Chinese web-page dataset show that methoss we designed can improve the performance from 75.82% to 81.88%.
Minimum-latency aggregation scheduling in multihop wireless networks
Authors: Peng-Jun Wan, Scott C.-H. Huang, Lixin Wang, Zhiyuan Wan, Xiaohua Jia
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

Minimum-latency aggregation schedule (MLAS) in synchronous multihop wireless networks seeks a shortest schedule for data aggregation subject to the interference constraint. In this paper, we study MLAS under the protocol interference model in which each node has a unit communication radius and an interference radius ρ ≥ 1. All known aggregation schedules assumed ρ = 1, and the best-known aggregation latency with ρ = 1 is 23R + Δ - 18 where R and Δ are the radius and maximum degree of the communication topology respectfully. In this paper, we first construct three aggregations schedules with ρ = 1 of latency 15R + Δ - 4, 2R + O(log R) + Δ and (1 + O(log R/3√R)) R + Δ respectively. Then, we obtain two aggregation schedules with ρ > 1 by expanding the first two aggregation schedules with ρ = 1. Both aggregation schedules with ρ > 1 have latency within constant factors of the minimum aggregation latency.
Using model checking for critiquing based on clinical guidelines
Authors: Perry Groot, Arjen Hommersom, Peter J. F. Lucas, Robbert-Jan Merk, Annette ten Teije, Frank van Harmelen, Radu Serban
Venue: Artificial Intelligence in Medicine (2009)

Objective: Medical critiquing systems compare clinical actions performed by a physician with a predefined set of actions. In order to provide useful feedback, an important task is to find differences between the actual actions and a set of 'ideal' actions as described by a clinical guideline. In case differences exist, the critiquing system provides insight into the extent to which they are compatible. Methods and material: We propose a computational method for such critiquing, where the ideal actions are given by a formal model of a clinical guideline, and where the actual actions are derived from real world patient data. We employ model checking to investigate whether a part of the actual treatment is consistent with the guideline. Results: We show how critiquing can be cast in terms of temporal logic, and what can be achieved by using model checking. Furthermore, a method is introduced for off-line computing relevant information which can be exploited during critiquing. The method has been applied to a clinical guideline of breast cancer in conjunction with breast cancer patient data.
A tale of two platforms: low-cost robotics in the CS curriculum
Authors: Peter Mawhorter, Elaine Shaver, Zeke Koziol, Zachary Dodds
Venue: Journal of Computing Sciences in Colleges (2009)

This synopsis presents work with two inexpensive robot platforms on which we have implemented a vision-based FastSLAM algorithm for landmark mapping. The results reinforce the educational scalability of the iRobot Create and IPRE Myro/Scribbler low-cost platforms: they offer not only a compelling invitation to the study of computer science and robotics, but a means of engaging students in the recent and ongoing work of the AI robotics community.
Haptic Palpation for the Femoral Pulse in Virtual Interventional Radiology
Authors: T. Coles, N. W. John, D. A. Gould, D. G. Caldwell
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

Interventional Radiology is a rapidly expanding speciality using minimally invasive techniques to treat a multitude of clinical problems. Current work in progress aims to create an affordable virtual training tool to reduce training times and patient risk during a trainee practitioners learning cycle. The procedure of arterial catheterisation has been broken down into a number of subtasks, one of which requires an operator to locate the femoral artery pulse by palpation. This is performed in preparation for a needle insertion to allow the entry of a guide wire and catheter into the patient. This paper presents the current state of research into a unique solution for affordable haptic simulation of pulse palpation in a virtual environment.
A committee machine with intelligent systems for estimation of total organic carbon content from petrophysical data: An example from Kangan and Dalan reservoirs in South Pars Gas Field, Iran
Authors: Ali Kadkhodaie-Ilkhchi, Hossain Rahimpour-Bonab, Mohammadreza Rezaee
Venue: Computers Geosciences (2009)

Total organic carbon (TOC) content present in reservoir rocks is one of the important parameters, which could be used for evaluation of residual production potential and geochemical characterization of hydrocarbon-bearing units. In general, organic-rich rocks are characterized by higher porosity, higher sonic transit time, lower density, higher @c-ray, and higher resistivity than other rocks. Current study suggests an improved and optimal model for TOC estimation by integration of intelligent systems and the concept of committee machine with an example from Kangan and Dalan Formations, in South Pars Gas Field, Iran. This committee machine with intelligent systems (CMIS) combines the results of TOC predicted from intelligent systems including fuzzy logic (FL), neuro-fuzzy (NF), and neural network (NN), each of them has a weight factor showing its contribution in overall prediction. The optimal combination of weights is derived by a genetic algorithm (GA). This method is illustrated using a case study. One hundred twenty-four data points including petrophysical data and measured TOC from three wells of South Pars Gas Field were divided into 87 training sets to build the CMIS model and 37 testing sets to evaluate the reliability of the developed model. The results show that the CMIS performs better than any one of the individual intelligent systems acting alone for predicting TOC.
Soft error rate computation in early design stages using boolean satisfiability
Authors: Syed Z. Shazli, Mehdi B. Tahoori
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Soft errors, due to cosmic radiations, are the major reliability barriers for VLSI designs. To meet reliability constraints in a costeffective way, it is critical to assess soft error reliability parameters in early design stages. In this paper, we present a framework to accurately obtain soft error rate (SER) for high-level (behavioral) descriptions (Verilog or VHDL). We transform the SER problem into an equivalent Boolean satisfiability (SAT) problem and use state-of-the-art SAT-solvers to obtain SER. We have developed an automated flow to convert high-level hardware descriptions into SAT formulations for exact SER computation. We compare our technique to traditional fault simulation techniques. The experimental results show that fault simulations with orders of magnitude run time overhead still result in significantly inaccurate underestimation of SER values. We applied the technique on the largest ISCAS benchmark circuits and found out that it scales well.
Numerical solutions of a Michaelis--Menten-type ratio-dependent predator--prey system with diffusion
Authors: Yuan-Ming Wang
Venue: Applied Numerical Mathematics (2009)

This paper is concerned with finite difference solutions of a Michaelis-Menten-type ratio-dependent predator-prey system with diffusion. The system is discretized by the finite difference method, and the investigation is devoted to the finite difference system for the time-dependent solution and its asymptotic behavior in relation to the various steady-state solutions. Three monotone iterative schemes for the computation of the time-dependent solution are presented, and the sequences of iterations are shown to converge monotonically to a unique positive solution. A simple and easily verifiable condition on the rate constants is obtained, which ensures that for every nontrivial nonnegative initial function the corresponding time-dependent solution converges either to a unique positive steady-state solution or to a semitrivial steady-state solution. The above results lead to computational algorithms for the solution as well as the global asymptotic stability of the system. Some numerical results are given. All the conclusions are directly applicable to the finite difference solution of the corresponding ordinary differential system.
Numerical Simulation for the Interaction between Soil and Cable in Deep Foundation Pit
Authors: Du-gan Qing, Zi-qiang Zhu, Qun-yi Liu, Xian-qi He
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Simplified mechanical model can not reflect the real situation of the interaction between foundation and cables. Then numerical software FLAC3D is used to simulate the procedure of foundation excavation and cable reinforcement. Deformation responses of foundation are analyzed as well as the mechanical response of cables. The results show that, (1) the procedure of excavation leads to the deformation of soil mass in foundation, which is the reasons of tensile failure and shear failure; for tensile failure areas, the length of soil nailing should be set surpass the slip plane; for shear failure areas, the density of cables should be set larger at the place of shear opening. (2) after excavation, the axial stress distributes different along the cable shaft, location of maximum axial stress along cable can indicate the location of potential slip plane. FLAC3D can simulate the excavation and reinforcement of foundation reasonably, whose result can give guidance for design and construction.
GridFMO Quantum chemistry of proteins on the grid
Authors: Tsutomu Ikegamial, Jun Maki, Toshiya Takami, Yoshio Tanaka, Mitsuo Yokokawa, Satoshi Sekiguchi, Mutsumi Aoyagi
Venue: Proceedings of the 8th IEEE/ACM International Conference on Grid Computing (2007)

A GridFMO application was developed by recoining the fragment molecular orbital (FMO) method of GAMESS with Grid technology. With the GridFMO, quantum calculations of macro molecules become possible by using large amount of computational resources collected from many moderate-sized cluster computers. A new middleware suite was developed based on Ninf-G, whose fault tolerance and flexible resource management were found to be indispensable for long-term calculations. The GridFMO was used to draw ab initio potential energy curves of a protein motor system with 16,664 atoms. For the calculations, 10 cluster computers over the Pacific rim were used, sharing the resources with other users via batch queue systems on each machine. A series of 14 GridFMO calculations were conducted for 70 days, coping with more than 100 problems cropping up. The FMO curves were compared against the molecular mechanics (MM), and it was confirmed that (1) the FMO method is capable of drawing smooth curves despite several cut-off approximations, and that (2) the MM method is reliable enough for molecular modeling.
Generalized Extremal Optimization for Solving Multiprocessor Task Scheduling Problem
Authors: Piotr Switalski, Franciszek Seredynski
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

In this paper we propose a solution of a multiprocessor task scheduling problem with use of a new meta-heuristic inspired by a model of natural evolution called Generalized Extremal Optimization (GEO). It is inspired by a simple co-evolutionary model based on a Bak-Sneppen model. One of advantages of the model is a simple implementation of potential optimization problems and only one free parameter to adjust. The idea of GEO metaheuristic and the way of applying it to the multi-processor scheduling problem are presented in the paper. In this problem the tasks of a program graph are allocated into multiprocessor system graph where the program completion time is minimized. The problem is know to be a NP-complete problem. In this paper we show that GEO is to able to solve this problem with better performance than genetic algorithm.
Belief Based Distributed Buyer Coalition Formation with Non-transferable Utility
Authors: Chi-Kong Chan, Ho-fung Leung
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

Online buyer coalition formation problem is an application of e-commerce and distributed agent technology. So far, most works in this topic are social utility based approaches, which assume the agents' utilities to be transferable and publicly known. However, such assumptions are not valid in many software agents applications where agents beliefs are private, and stability is often a more important concept than social utility. In this paper, we study the problem from a private-belief based non-transferable utility approach: instead of social utility maximization, our focus is on achieving stable solutions in term of the core, b-core and Pareto efficiency; instead of assuming common knowledge, we assume the agents' actions to be based on fallible private beliefs. We then propose a distributed mechanism where agents are allowed to propose incremental improvements toward a stable solution. We show by experiment that our mechanism is able to reach core stable solutions in over 97\% of the cases, and b-core stable solution in almost of all cases that we tested.