ppxscal/embedding_network huggingface dataset:
A column generation heuristic for a dynamic generalized assignment problem
Authors: Luigi Moccia, Jean-François Cordeau, Maria Flavia Monaco, Marcello Sammarra
Venue: Computers and Operations Research (2009)

This paper studies the dynamic generalized assignment problem (DGAP) which extends the well-known generalized assignment problem by considering a discretized time horizon and by associating a starting time and a finishing time with each task. Additional constraints related to warehouse and yard management applications are also considered. Three linear integer programming formulations of the problem are introduced. The strongest one models the problem as an origin-destination integer multi-commodity flow problem with side constraints. This model can be solved quickly for instances of small to moderate size. However, because of its computer memory requirements, it becomes impractical for larger instances. Hence, a column generation algorithm is used to compute lower bounds by solving the linear program (LP) relaxation of the problem. This column generation algorithm is also embedded in a heuristic aimed at finding feasible integer solutions. Computational experiments on large-scale instances show the effectiveness of the proposed approach.
Analysis of Sanskrit Text: Parsing and Semantic Relations
Authors: Pawan Goyal, Vipul Arora, Laxmidhar Behera
Venue: Sanskrit Computational Linguistics: First and Second International Symposia Rocquencourt, France, October 29-31, 2007 Providence, RI, USA, May 15-17, 2008 Revised Selected and Invited Papers (2009)

In this paper, we are presenting our work towards building a dependency parser for Sanskrit language that uses deterministic finite automata(DFA) for morphological analysis and 'utsarga apavaada' approach for relation analysis. A computational grammar based on the framework of Panini is being developed. A linguistic generalization for Verbal and Nominal database has been made and declensions are given the form of DFA. Verbal database for all the class of verbs have been completed for this part. Given a Sanskrit text, the parser identifies the root words and gives the dependency relations based on semantic constraints. The proposed Sanskrit parser is able to create semantic nets for many classes of Sanskrit paragraphs(¿¿¿¿¿¿¿). The parser is taking care of both external and internal sandhi in the Sanskrit words.
Measuring Interaction QoE in Internet Videoconferencing
Authors: Prasad Calyam, Mark Haffner, Eylem Ekici, Chang-Gun Lee
Venue: Proceedings of the 10th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services: Real-Time Mobile Multimedia Services (2008)

Internet videoconferencing has emerged as a viable medium for communication and entertainment. However, its widespread use is being challenged. This is because videoconference end-users frequently experience perceptual quality impairments such as video frame freezing and voice dropouts due to changes in network conditions on the Internet. These impairments cause extra end-user interaction effort and correspondingly lead to unwanted network bandwidth consumption that affects user Quality of Experience (QoE) and Internet congestion. Hence, it is important to measure and subsequently minimize the extra end-user interaction effort in a videoconferencing system. In this paper, we describe a novel active measurement scheme that considers end-user interaction effort and the corresponding network bandwidth consumption to provide videoconferencing interaction QoE measurements. The scheme involves a "Multi-Activity Packet-Trains" (MAPTs) methodology to dynamically emulate a videoconference session's participant interaction patterns and corresponding video activity levels that are affected by transient changes in network conditions. Also, we describe the implementation and validation of the Vperf tool we have developed to measure the videoconferencing interaction QoE on a network path using our proposed scheme.
On the I/O Volume in Out-of-Core Multifrontal Methods with a Flexible Allocation Scheme
Authors: Emmanuel Agullo, Abdou Guermouche, Jean-Yves L'Excellent
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

Sparse direct solvers, and in particular multifrontal methods, are widely used in various simulation problems. Because of their large memory requirements, the use of out-of-core solvers is compulsory for large-scale problems, where disks are used to extend the core memory. This study is at the junction of two previous independent works: it extends the problem of the minimization of the volume of I/O [4] in the multifrontal method to the more general flexible parent allocation algorithm [8]. We explain how to compute the I/O volume with respect to this scheme and propose an efficient greedy heuristic which significantly reduces the I/O volume on real-life problems in this new context.
3D edutainment environment: learning physics through VR/AR experiences
Authors: Sylvia Irawati, Sengpyo Hong, Jinwook Kim, Heedong Ko
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

Virtual Reality (VR) as well as Augmented Reality (AR) environment can be used as media for edutaining. They provide pleasant environments for educating students through experiences. In this paper, we present a 3D edutainment environment which provides an experience-based learning environment for understanding the Newtonian physics law. We design a physics-based simulation application that simulates a domino effect in the 3D environment. Using this application, the user can learn physics by interacting and experiencing different kinds of domino effect in the VR/AR environment. We propose a new way to help the user tuning the simulation conditions to produce a desired simulation effect by illustrating an expected trajectory of the object of interest. Therefore, the user can easily distinguish the simulation results from different configurations by comparing the trajectories of the selected object.
Designing Verifiable and Reusable Data Access Layer Using Formal Methods and Design Patterns
Authors: Faheem Sohail, Farooq Zubairi, Nabeel Sabir, Nazir Ahmad Zafar
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Layering is a concept widely used in computer and software modeling. Many modern information systems are designed and built using a layered model where the function of each layer is specified and well defined. In this paper we will be discussing the layer whose responsibilities include data extraction, manipulation and provision of data to the rest of the application. Common design problems that designers face while designing object oriented system can be resolved by using design patterns. These patterns are reusable solutions used heavily in application framework design. Formal methods are mathematical techniques used to construct models that can be proved for consistency, completeness and correctness of computerized systems. We have applied formal methods to data access layer patterns which has resulted a verifiable recipes for solving data access layer design problems. Our formal models are described using VDM++ specification language and are analyzed and validated using the VDM++ Toolbox.
A Multi Interface Grid Discovery System
Authors: A. Ali, A. Anjum, J. Bunn, F. Khan, R. McClatchey, H. Newman, C. Steenberg, M. Thomas, Ian Willers
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

Discovery Systems (DS) can be considered as entry points for global loosely coupled distributed systems. An efficient Discovery System in essence increases the performance, reliability and decision making capability of distributed systems. With the rapid increase in scale of distributed applications, existing solutions for discovery systems are fast becoming either obsolete or incapable of handling such complexity. They are particularly ineffective when handling service lifetimes and providing up-to-date information, poor at enabling dynamic service access and they can also impose unwanted restrictions on interfaces to widely available information repositories. In this paper we present essential the design characteristics, an implementation and a performance analysis for a discovery system capable of overcoming these deficiencies in large, globally distributed environments.
Performing DNA computation with RecA-mediated triple-stranded DNA structure
Authors: Gang Fang, Jin Xu, Shemin Zhang
Venue: Natural Computing: an international journal (2009)

A new method of DNA computing using an unusual triple-stranded DNA structure mediated by RecA protein is introduced and a minor 3-variable instance of the satisfiability (SAT) problem is solved. Separations were performed by using biotinylated oligodeoxynucleotide probes coated with RecA protein. During the computation, sequence-specific recognition of double-stranded DNA by homologous oligodeoxynucleotides was fulfilled in the presence of ATP&gamma;S. Captured by the magnetic particles coated with streptavidin, the desirable double-stranded DNA strands were retained and extracted. It is suggested that the methods employed here may help decrease the errors in DNA computation and solve some larger size NP- complete problems.
Authentication of Nodes among Different Symmetric Key Groups in MANETs Using 4G Technologies
Authors: Azeem Irshad Sheikh, Wajahat Noshairwan, Muhammad Rashid, Syed Mushhad Gilani, Ehtsham Irshad, Muhammad Usman
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

MANET security has long been an issue for its infrastructure-less nature. The sort of networks gives rise to authentication and key-management problems in MANETs. The absolute TTP based schemes seem to be infeasible for being adopted in MANETs and so are the non-TTP based self-organized schemes which suffer security problems regarding key identity of nodes. A hybrid scheme can serve the purpose. One of the hybrid schemes addressed these issues effectively by pre-assigned logins on offline basis and issuing certificates being online, using 4th generation services. However, the scheme revealed overheads in different scenarios. We have proposed a scheme where the nodes having common interests, once authenticated through external resources, form a group with a single key shared for the whole group. The overlapping nodes sharing different groups facilitate authentication of other nodes communicating from those groups. In this way the external messages for authentication among the nodes of different groups can be reduced to a great extent.
Cryptanalysis of Mu et al.'s and Li et al.'s Schemes and a Provably Secure ID-Based Broadcast Signcryption (IBBSC) Scheme
Authors: S. Sharmila Selvi, S. Sree Vivek, Ragavendran Gopalakrishnan, Naga Naresh Karuturi, C. Pandu Rangan
Venue: Information Security Applications: 9th International Workshop, WISA 2008, Jeju Island, Korea, September 23-25, 2008, Revised Selected Papers (2009)

In applications like wireless content distribution, a central authority needs to deliver encrypted data to a large number of recipients in such a way that only a privileged subset of users can decrypt it. In addition, to avert junk content or spam, subscribers must have source authentication with respect to their broadcasters. The limited memory and computational power of mobile devices, coupled with escalating costs of wireless bandwidth make efficiency a major concern. Broadcast signcryption, which enables the broadcaster to simultaneously encrypt and sign the content meant for a specific set of users in a single logical step, provides the most efficient solution to this dual problem of confidentiality and authentication. It is arguably most efficiently implemented in the ID-based setting because of its well known advantages. Only three IBBSC schemes exist in literature, one of which has already been shown to be flawed and its security leaks fixed. In this paper, we show that the remaining two -- Mu et al.'s scheme and Li et al.'s scheme are also flawed. Specifically, we show that while Mu et al.'s scheme is insecure with respect to unforgeability, Li et al.'s scheme can be totally broken (with respect to both unforgeability and confidentiality). Following this, we propose a new IBBSC scheme and formally prove its security under the strongest existing security models for broadcast signcryption (IND-CCA2 and EUF-CMA).
Combining image captions and visual analysis for image concept classification
Authors: Tomas Kliegr, Krishna Chandramouli, Jan Nemrava, Vojtech Svatek, Ebroul Izquierdo
Venue: Proceedings of the 9th International Workshop on Multimedia Data Mining: held in conjunction with the ACM SIGKDD 2008 (2008)

We present a framework for efficiently exploiting free-text annotations as a complementary resource to image classification. A novel approach called Semantic Concept Mapping (SCM) is used to classify entities occurring in the text to a custom-defined set of concepts. SCM performs unsupervised classification by exploiting the relations between common entities codified in the Wordnet thesaurus. SCM exploits Targeted Hypernym Discovery (THD) to map unknown entities extracted from the text to concepts in Wordnet. We show how the result of SCM/THD can be fused with the outcome of Knowledge Assisted Image Analysis (KAA), a classification algorithm that extracts and labels multiple segments from an image. In the experimental evaluation, THD achieved an accuracy of 75%, and SCM an accuracy of 52%. In one of the first experiments with fusing the results of a free-text and image-content classifier, SCM/THD + KAA achieved a relative improvement of 49% and 31% over the text-only and image-content-only baselines.
PowerPoint 2007 Graphics Animation Made Easy, 1 edition
Authors: Sally Slack, Michelle Zavala
Venue: Made Easy Series (2008)

Get beyond the basics with PowerPoint 2007Take your PowerPoint skills to the next level with help from this highly visual, easy-to-follow guide. PowerPoint 2007 Graphics Animation Made Easy shows you how to enhance your presentations with everything from bullets and tables to dynamic slides that come to life on the screen. You'll learn to use the latest tools and techniques such as WordArt, SmartArt, charts, audio, and motion graphics. Discover how easy it is to build professional presentations with rich images, special effects, and high-impact animations that will capture your audience's attention every time you present. Design unique layouts customized for your needsCreate memorable photo albums with captions, textures, and themesAdd and manipulate clip artDisplay data in graphically rich tables and chartsEnhance text with fills, outlines, and artistic effects using WordArt Highlight important points, people, and objects with shapesTransform content into dynamic graphics using SmartArtAdd punch to your presentations with movies and soundCreate custom animations and impressive special effects Import Excel content quickly and easily into PowerPoint slides Table of contentsChapter 1. Creating Slide Layouts That PopChapter 2. Creating Custom LayoutsChapter 3. Illustrating with PicturesChapter 4. Creating a Photo AlbumChapter 5. Working with Clip ArtChapter 6. Working with TablesChapter 7. Using WordArt to Make Your PointChapter 8. Creating Effective ShapesChapter 9. Comparing and Illustrating Content with SmartArtChapter 10. Adding a Movie to Your PresentationChapter 11. Adding Sound to Your PresentationChapter 12. Creating and Using AnimationChapter 13. Importing Excel Content into PowerPoint 2007Chapter 14. Moving Graphics Between Word and PowerPointChapter 15. Working with Charts as Design Elements
Vision-based Korean Manual Alphabet recognition game for beginners
Authors: Young-Joon Oh, Keechul Jung
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

The Korean Manual Alphabet (KMA) corresponds to the vocabulary of Korean Sign Language (KSL) and people use this KMA when he/she spells each letter of a word such as a newly coined word without current body language in deaf society [1]. Hearing people usually does not know/understand KSL words, because he/she can use KMA in order to communicate simply with the deaf without learning complex sign languages. Min, et al developed the glove-based KMA recognition using blue-tooth [2]. In this paper, we propose the vision-based KMA recognition game interface using a low price Universal Serial Bus (USB) based camera. We aim to provide that beginners can learn KMA letters easily when playing game at the same time. In addition, the system is able to detect a user's hand from captured images and find out one Korean Alphabet (KA) falling letter in game that corresponds to a KMA letter. We evaluated capabilities of the proposed system in order to provide convenience and reliability to the users.
An Intelligent Mobile IP Routing Algorithm Based on the Active Network
Authors: Xiumei Fan, Xu Guo, Liping Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

This paper aims at solving the following two problems about the standard Mobile IP protocol: the reduction of network payload throughput and the packets loss when plenty of mobile nodes move between domains frequently. The paper puts forward an intelligent mobile IP routing algorithm based on the active network. By using the mechanism of tree-based sending the binding update packets and the packets trace-back storing mechanism, the algorithm reduces the amount of binding update packets in the core network and depresses the packets loss ratio when the mobile nodes move between domains. The simulation results show that the algorithm putting forward by this paper depresses the packets loss ratio effectively and it also reduces the amount of binding update packets when there are lots of mobile nodes moving between domains frequently, and it improves simultaneity the bandwidth utilization.
An aspect-oriented methodology for designing secure applications
Authors: Geri Georg, Indrakshi Ray, Kyriakos Anastasakis, Behzad Bordbar, Manachai Toahchoodee, Siv Hilde Houmb
Venue: Information and Software Technology (2009)

We propose a methodology, based on aspect-oriented modeling (AOM), for incorporating security mechanisms in an application. The functionality of the application is described using the primary model and the attacks are specified using aspects. The attack aspect is composed with the primary model to obtain the misuse model. The misuse model describes how much the application can be compromised. If the results are unacceptable, then some security mechanism must be incorporated into the application. The security mechanism, modeled as security aspect, is composed with the primary model to obtain the security-treated model. The security-treated model is analyzed to give assurance that it is resilient to the attack.
A New Approach of Feature Selection for Chinese Web Page Categorization
Authors: Cunhe Li, Lina Zhu, Kangwei Liu
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

Feature selection is a key step of web page categorization. It can influence the accuracy of categorization directly as well as the efficiency. This paper proposes a new approach of feature selection based on Mutual Information algorithm. It brings in feature whose Mutual Information is negative and emphasizes the occurrence probabilities of features in different categories. Moreover, it makes some improvements on the web page preprocessing to reserve some useful features. The experiment shows that the new feature selection method improves the accuracy of categorization effectively.
HCI... not as it should be: inferential statistics in HCI research
Authors: Paul Cairns
Venue: Proceedings of the 21st British CHI Group Annual Conference on HCI 2007: People and Computers XXI: HCI...but not as we know it - Volume 1 (2007)

This paper surveys the use of inferential statistics over the last two BCS HCI conferences and the last year (2006) of two leading HCI journals. Of the 80 papers covered, 41 used some form of inferential statistics. However, all but one had some form of problem of reporting or analysis that undermined the value or the validity of the statistical testing and hence the research findings. This paper discusses the implications of such widespread issues for HCI research and considers approaches for improving the use of statistics in HCI.
Analysis of Momentum Factor in Neural Network Blind Equalization Algorithm
Authors: Zhang Liyi, Liu Ting, Zhang Jingyu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In this paper, the principle of neural network blind equalization algorithm was depicted, the fault of traditional BP (Back Propagation) algorithm, which is slow convergence rate and easy to fall into a local minimum, was analyzed, the influence of momentum factor to equalization performance was researched, the convergence track of traditional BP algorithm and momentum factor BP algorithm was compared. From the above, we can see the new algorithm can avoid effectively a local minimum and speed up the convergence rate. On this basis, three-layer forward neural network was adopted, the iteration equation of neural network blind equalization algorithm based on momentum factor was deduced. The computer simulation results show the effectiveness of the new algorithm.
An Observational Theory for Mobile Ad Hoc Networks (full version)
Authors: Massimo Merro
Venue: Information and Computation (2009)

We propose a process calculus to study the behavioural theory of Mobile Ad Hoc Networks. The operational semantics of our calculus is given both in terms of a Reduction Semantics and in terms of a Labelled Transition Semantics. We prove that the two semantics coincide. The labelled transition system is then used to derive the notions of (weak) simulation and bisimulation for ad hoc networks. The labelled bisimilarity completely characterises reduction barbed congruence, a standard branching-time and contextually-defined program equivalence. We then use our (bi)simulation proof method to formally prove a number of non-trivial properties of ad hoc networks.
Vesicle-synapsin interactions modeled with Cell-DEVS
Authors: Rhys Goldstein, Gabriel Wainer, James J. Cheetham, Roderick S. Bain
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Interactions between synaptic vesicles and synapsin in a presynaptic nerve terminal were modeled using the Cell-DEVS formalism. Vesicles and synapsins move randomly within the presynaptic compartment. Synapsins can bind to more than one vesicle simultaneously, causing clusters to form. Phosphorylation of synapsin reduces its affinity for vesicles, and causes the clusters to break apart. Upon dephosphosphorylation, new clusters form. Taking advantage of Cell-DEVS, as opposed to traditional techniques for implementing cellular automata, the model prevents collisions between arbitrarily large clusters using transition rules restricted to a 5-cell neighborhood. Simulation results indicate that, in a qualitative sense, the behavior of vesicles and synapsin in neurons was captured.