ppxscal/embedding_network huggingface dataset:
An irregular grid approach for pricing high-dimensional American options
Authors: S. J. Berridge, J. M. Schumacher
Venue: Journal of Computational and Applied Mathematics (2008)

We propose and test a new method for pricing American options in a high-dimensional setting. The method is centered around the approximation of the associated complementarity problem on an irregular grid. We approximate the partial differential operator on this grid by appealing to the SDE representation of the underlying process and computing the root of the transition probability matrix of an approximating Markov chain. Experimental results in five-dimensions are presented for four different payoff functions.
Cyberabstracts: a portal on the subject of abstracting designed to improve information literacy skills
Authors: Maria Pinto
Venue: Journal of Information Science (2008)

With the overall purpose of improving the information literacy skills of librarianship and information science students, an academic portal specifically centred on abstracts and abstracting resources is proposed. We take the existing literature, together with our knowledge and experience of abstract/abstracting topics and web-based technologies to conceive the research design. The research mainly consists of the selection, assessment and web-display of the most relevant abstracts on knowledge management, information representation, natural language processing, abstract/abstracting, modelling the scientific document, information retrieval and information evaluation. The resulting Cyberabstracts portal presents its products consistently and includes reference, abstract, keywords, assessment and access to the full document. Improvement opportunities for this unique subject-based gateway, representing much more than a mere subject catalogue, are uncovered as the starting point on a planned route towards excellence.
A Mechanism for Securing Digital Evidences in Pervasive Environments
Authors: Jae-Hyeok Jang, Myung-Chan Park, Young-Shin Park, Byoung-Soo Koh, Young-Rak Choi
Venue: Proceedings of the APWeb/WAIM 2007 DBMAN, WebETrends, PAIS and ASWAN international workshops on Advances in Web and Network Technologies, and Information Management (2007)

In pervasive environment, for the mal functions in appliances and system errors, the unaccepted intrusion should be occurred. The evidence collecting technology uses the system which was damaged by intruders and that system is used as evidence materials in the court of justice. However the collected evidences are easily modified and damaged in the gathering evidence process, the evidence analysis process and in the court. That's why we have to prove the evidence's integrity to be valuably used in the court. In this paper, we propose a mechanism for securing the reliability and the integrity of digital evidence that can properly support the Computer Forensics. The proposed mechanism shares and manages the digital evidence through mutual authenticating the damaged system, evidence collecting system, evidence managing system and the court(TTP: Trusted Third Party) and provides a secure access control model to establish the secure evidence management policy which assures that the collected evidence has the corresponded legal effect.
Intra-Domain Delay-Based Quality of Service Using Differentiated Routing
Authors: Ioannis Papanagiotou, Michael Howarth
Venue: Proceedings of the 11th IFIP/IEEE international conference on Management of Multimedia and Mobile Networks and Services: Management of Converged Multimedia Networks and Services (2008)

Differentiated routing is an approach to providing service differentiation in networks, a field that is currently receiving significant research attention. In this report we present an algorithm, namely Intra-Domain Differentiated Routing (IDDR), which supports qualitative delay differentiation in IP networks. We review existing differentiated routing approaches and then introduce IDDR and present initial results. We demonstrate that using IDDR we can achieve qualitative delay differentiation for two classes of flows.
Strong stability of singly-diagonally-implicit Runge--Kutta methods
Authors: L. Ferracina, M. N. Spijker
Venue: Applied Numerical Mathematics (2008)

This paper deals with the numerical solution of initial value problems, for systems of ordinary differential equations, by Runge-Kutta methods (RKMs) with special nonlinear stability properties indicated by the terms total-variation-diminishing (TVD), strongly stable and monotonic. Stepsize conditions, guaranteeing these properties, were studied earlier, see e.g. Shu and Osher [C.-W. Shu, S. Osher, J. Comput. Phys. 77 (1988) 439-471], Gottlieb et al. [S. Gottlieb, C.-W. Shu, E. Tadmor, SIAM Rev. 43 (2001) 89-112], Hundsdorfer and Ruuth [W.H. Hundsdorfer, S.J. Ruuth, Monotonicity for time discretizations, in: D.F. Griffiths, G.A. Watson (Eds.), Proc. Dundee Conference 2003, Report NA/217, Univ. Dundee, 2003, pp. 85-94], Higueras [I. Higueras, J. Sci. Computing 21 (2004) 193-223; I. Higueras, SIAM J. Numer. Anal. 43 (2005) 924-948], Gottlieb [S. Gottlieb, J. Sci. Computing 25 (2005) 105-128], Ferracina and Spijker [L. Ferracina, M.N. Spijker, SIAM J. Numer. Anal. 42 (2004) 1073-1093; L. Ferracina, M.N. Spijker, Math. Comp. 74 (2005) 201-219]. Special attention was paid to RKMs which are optimal, in that the corresponding stepsize conditions are as little restrictive as possible within a given class of methods. Extensive searches for such optimal methods were made in classes of explicit RKMs, see e.g. Gottlieb and Shu [S. Gottlieb, C.-W. Shu, Math. Comp. 67 (1998) 73-85], Spiteri and Ruuth [R.J. Spiteri, S.J. Ruuth, SIAM J. Numer. Anal. 40 (2002) 469-491; R.J. Spiteri, S.J. Ruuth, Math. Comput. Simulation 62 (2003) 125-135], Ruuth [S.J. Ruuth, Math. Comp. 75 (2006) 183-207]. In the present paper we search for methods that are optimal in the above sense, within the interesting class of singly-diagonally-implicit Runge-Kutta (SDIRK) methods, with s stages and order p. Some methods, with 1==3) which we conjecture to be optimal for p=2 and p=3, respectively. Furthermore we prove, for strongly stable SDIRK methods, the order barrier p=
Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts
Venue: ACM International Conference Proceeding Series; Vol. 349 (2008)

Entertainment and Art are constantly evolving. They are tied to no particular platform, format or place in time, but shaped by the visionaries, innovators, entrepreneurs and brand developers who embrace technology, look to the future and inspire creativity. As a result, new ideas and art forms are brought to life. The recent significant advances in computer entertainment, multi-player/online gaming, technology-enabled art, culture and performance do create new forms of entertainment practices and artistic expression that attract, immerse and absorb their participants. The phenomenal success of such a "culture" to initiate a mass audience in patterns and practices of its own consumption has supported the evolution of an enormously powerful mass entertainment, digital art and performance industry extending deeply into every aspect of our lives, leading further to major societal and business contacting changes. The ACM Special Interest Group on Computer-Human Interaction, Singapore Chapter, has recognized the major role of digital interactive media technologies towards such effect, and has recently initiated the annual International Conference on Digital Interactive Media in Entertainment and Arts (DIMEA) that spans these breath-taking emerging technologies and application areas and envisions bringing together both research and commercial communities, promoting digital interactive media research and practice in the technology-mediated entertainment and art worlds. On behalf of the Organizing Committee of DIMEA 2008, we would like to welcome you to the 3rd ACM International Conference and Exhibition on Digital Interactive Media in Entertainment and Arts (DIMEA 2008), to be held on September 10-12, 2008, at Athens Information Technology in Athens, Greece. DIMEA 2008 is organized jointly by Athens Information Technology (AIT), The Singapore Chapter of ACM SIG on Computer-Human Interaction (SIGCHI, Singapore Chapter) and the Society for Excellence and Innovation in Interactive Experience Design (InExDe), in cooperation with ACM SIG CHI.
Optimality of Reaching Movements Based on Energetic Cost under the Influence of Signal-Dependent Noise
Authors: Yoshiaki Taniai, Jun Nishii
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

As candidates of a constraint which determines human arm reaching trajectories, criteria of the minimum torque change and of the minimum end-point variance have been proposed and it has been shown that these criteria well predict the characteristics of reaching trajectories. In our previous work, we have shown that these criteria would also suppress the energy cost for reaching movements, when motor command is affected by signal-dependent noise. In this study, we computed the trajectories which minimize the energy cost under the effect of the signal-dependent noise, and compared them with those of human subjects. The optimal trajectories were in good agreement with the measured trajectories at the points that when the movement duration is short, the speed profile of the hand movement takes a bell shape, and when the duration is long, the speed profiles take a collapsed shape. These results would suggest that human brain solves the redundancy problem of trajectory planning by the constraint of minimization of the expected value of energy cost.
A Modelling Approach with Coloured Petri Nets
Authors: Christine Choppy, Laure Petrucci, Gianna Reggio
Venue: Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies (2008)

When designing a complex system with critical requirements (e.g. for safety issues), formal models are often used for analysis prior to costly hardware/software implementation. However, writing the formal specification starting from the textual description is not easy. An approach to this problem has been developed in the context of algebraic specifications [CR06], and was later adapted to Petri nets [CP04, CPR07]. Here, we show how such a method, with precise and detailed guidelines, can be applied for writing modular coloured Petri nets. This is illustrated on a model railway case study, where modules are a key aspect.
Touch the invisibles
Authors: Junji Watanabe, Eisuke Kusachi Hideyuki Ando
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

We have developed a novel interface that can superimpose tactile information onto surface or images displayed on a computer monitor. Based on this interface technology, we produced an artwork on how we perceive the real and digital world through the sense of touch [1].
Fabric Sewability Evaluation Based on KPCA Using SFC-RBFNN
Authors: Yonghui Pan
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

In this paper, a supervised fuzzy clustering RBF neural network (SFC-RBFNN) based on Kernel PCA is introduced for constructing the fabric sewability evaluation system. Our experimental results demonstrate that the proposed system could efficiently be used as an objective seam pucker evaluation system with high accuracy and is robust for various structures and mechanical properties of middle-thickness woolen fabric.
Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
Authors: Feng Zou, Xianyue Li, Donghyun Kim, Weili Wu
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

Given a graph G = (V,E) with node weight w: V ¿R + and a subset S ¿ V, find a minimum total weight tree interconnecting all nodes in S. This is the node-weighted Steiner tree problem which will be studied in this paper. In general, this problem is NP-hard and cannot be approximated by a polynomial time algorithm with performance ratio a ln n for any 0 < a < 1 unless NP ¿ DTIME(n O(logn)), where n is the number of nodes in s. In this paper, we show that for unit disk graph, the problem is still NP-hard, however it has polynomial time constant approximation. We will present a 4-approximation and a 2.5ρ-approximation where ρ is the best known performance ratio for polynomial time approximation of classical Steiner minimum tree problem in graphs. As a corollary, we obtain that there is polynomial time (9.875+¿)-approximation algorithm for minimum weight connected dominating set in unit disk graphs.
Searching Services "on the Web": A Public Web Services Discovery Approach
Authors: Chen Wu, Elizabeth Chang
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

With the surge of Service-Oriented Architecture (SOA) and Web services, service discovery has become increasingly crucial. Public Web services that are available "on the Web" provide unlimited values for a great number of online service consumers and developers. However, the public UDDI Business Registry – the primary service discovery mechanism over the Internet – has been shut down permanently since 2006. This has raised serious problems for public Web services discovery. In this paper, we propose a WSDL-based public Web service discovery approach. It provides a simple-to-use yet effective Web service discovery mechanism that can retrieve relevant Web services directly from the Internet to suffice various requirements. The major contributions of this paper include: (1) a review on the state-of-the-art WSDL-based Web services discovery approaches; (2) the unique WSDL crawling and manipulation algorithms catering for the Vector Space Model, and (3) a proof-of-concept prototype – an online Web services search engine – based on the proposed approach.
Adaptive fuzzy tracking control of nonlinear time-delay systems with unknown virtual control coefficients
Authors: Min Wang, Bing Chen, Kefu Liu, Xiaoping Liu, Siying Zhang
Venue: Information Sciences: an International Journal (2008)

In this paper, a novel adaptive fuzzy control scheme is proposed for a class of uncertain single-input and single-output (SISO) nonlinear time-delay systems with the lower triangular form. Fuzzy logic systems are used to approximate unknown nonlinear functions, then the adaptive fuzzy tracking controller is constructed by combining Lyapunov-Krasovskii functionals and the backstepping approach. The proposed controller guarantees uniform ultimate boundedness of all the signals in the closed-loop system, while the tracking error converges to a small neighborhood of the origin. An advantage of the proposed control scheme lies in that the number of adaptive parameters is not more than the order of the systems under consideration. Finally, simulation studies are given to demonstrate the effectiveness of the proposed design scheme.
A Visual Data Mining Environment
Authors: Stephen Kimani, Tiziana Catarci, Giuseppe Santucci
Venue: Visual Data Mining: Theory, Techniques and Tools for Visual Analytics (2008)

It cannot be overstated that the knowledge discovery process still presents formidable challenges. One of the main issues in knowledge discovery is the need for an overall framework that can support the entire discovery process. It is worth noting the role and place of visualization in such a framework. Visualization enables or triggers the user to use his/her outstanding visual and mental capabilities, thereby gaining insight and understanding of data. The foregoing points to the pivotal role that visualization can play in supporting the user throughout the entire discovery process. The work reported in this chapter is part of a project aiming at developing an open data mining system with a visual interaction environment that supports the user in the entire process of mining knowledge.
A Secure Hybrid Wireless Mesh Protocol for 802.11s Mesh Network
Authors: Md. Shariful Islam, Young Jig Yoon, Md. Abdul Hamid, Choong Seon Hong
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

Wireless Mesh Network (WMN) has emerged as a key technology and found a great deal of interest for the researchers in the recent past. Hybrid Wireless Mesh Protocol (HWMP) is the default path selection (i.e., routing) protocol fully specified in the current draft D.1.06 of 802.11s for WMN. However, security in routing or forwarding functionality is not specified in the standard. As a consequence, HWMP in its current from is vulnerable to various types of routing attacks. In this paper, we propose a secure version of HWMP (SHWMP) that operates similarly to that of HWMP but uses cryptographic extensions to provide authenticity and integrity of routing messages and prevents unauthorized manipulation of mutable fields in the routing information elements. We have shown through analyses and simulation that SHWMP is robust against identified attacks and provides higher packet delivery ratio and incurs little computational and storage overhead to ensure security.
Refining Topological Relations between Regions Considering Their Shapes
Authors: Roland Billen, Yohei Kurata
Venue: Proceedings of the 5th international conference on Geographic Information Science (2008)

Topological relations are sometimes insufficient for differentiating spatial configurations of two objects with critical difference in their connection styles. In this paper, we present the projective 9 + -intersection model, which refines topological relations into projective binary relations by considering projective properties of the objects' shapes. This is indeed a reformulation of projective concepts of the Dimensional Model within the framework of the 9 + -intersection. Thirty projective binary relationsare established between two regions in R 2, one of which has a multi-order boundary (region + mob). These relations are identified computationally by applying to all theoretical relations the existing constraints for topological region-region relations and seven new specific constraints. After defining the concept of continuous neighbours between two projective binary relations, a conceptual neighbourhood graph of the 30 projective region + mob-region relations is developed.
Adaptive Management of Communities Based on Peer Content and Reputation
Authors: Ioannis Pogkas, Vassil Kriakov, Zhongqiang Chen, Alex Delis
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

Most P2P file-sharing systems are unable to create self organizingcommunities of similar nodes that provide goodservices to their members. In this paper, we propose aGnutella-like file-sharing protocol based on the premisethat each peer only creates links with the best counterpartswhich the peer has discovered in the network. TermedAdaptive Gnutella Protocol (AGP), our proposal transformsthe overlay topology based on a reputation scheme thatevaluates the provided services and offers a mechanismthat organizes trusted nodes with similar content. We haveimplemented the AGP protocol using the PeerSim engineand conducted experiments on diverse network topologies.Over time, the network topology improves as every peer locatescounterparts with similar content and good reputation.Moreover, malicious nodes are pushed to the edge ofthe overlay network and are excluded from participating inthe AGP search.
A SOM Based Method for Classes Overlap Degree Evaluation
Authors: Ioan Lemeni, Nicolae Tepus
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

In a classification problem, the most difficult decision is to choose the artificial neural network (ANN) architecture that offers the best results. In this paper we present a method that permits to quickly evaluate the degree of overlapping between classes. Once we know this degree, we can easily choose the appropriate ANN architecture.
Analysis of Relevant Maxima in Distance Transform. An Application to Fast Coarse Image Segmentation
Authors: Luis Antón-Canalís, Mario Hernández-Tejera, Elena Sánchez-Nielsen
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

The Distance Transform is a powerful tool that has been used in many computer vision tasks. In this paper, the use of relevant maxima in distance transform's medial axis is proposed as a method for fast image data reduction. These disc-shaped maxima include morphological information from the object they belong to, and because maxima are located inside homogeneous regions, they also sum up chromatic information from the pixels they represent. Thus, maxima can be used instead of single pixels in algorithms which compute relations among pixels, effectively reducing computation times. As an example, a fast method for color image segmentation is proposed, which can also be used for textured zones detection. Comparisons with mean shift segmentation algorithm are shown.
iCharts: Charts for Software Process Improvement Value Management
Authors: Román López-Cortijo, Javier García Guzmán, Antonio Amescua Seco
Venue: Proceedings of the 14th European conference on Software Process Improvement (2007)

Software Process Improvement Programs provide many benefits to the companies investing in this type of activities.One of the main problems in relation with SPI Value Management consists of the difficulty to convince senior management to invest in this type of programs. This issue is solved by means of benchmarking with successful histories by means of case studies. The information of current of SPI case studies is very heterogeneous, making this task so difficult. This paper presents a technique to formalize the information enclosed in an SPI case study providing an easy access to the relevant information of a SPI case study. Moreover, the results, obtained from its application with pre-existing case studies are provided. This work has been partially supported by the Spanish National Project "Software Process Management Platform: modeling, reuse and measurement" (TIN2004-07083).
Towards a Neural-Networks Based Therapy for Limbs Spasticity
Authors: Alexandre Moreira Nascimento, D. Andina, Francisco Javier Ropero Peláez
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

This article presents a neural network model for the simulation of the neurological mechanism that produces limbs hiper-rigidity (spasticity). In this model, we take into account intrinsic plasticity, which is the property of biological neurons that consists in the shifting of the action potential threshold according to experience. In accordance to the computational model, a therapeutic technique for diminishing limbs spasticity is proposed and discussed.