ppxscal/embedding_network huggingface dataset:
An embeddable testbed for insurgent and terrorist agent theories: InsurgiSim
Authors: Barry G. Silverman, Aline Normoyle, Praveen Kannan, Richard Pater, Deepthi Chandrasekaran, Gnana Bharathy
Venue: Intelligent Decision Technologies (2008)

Many simulators today contain traditional opponents and lack an asymmetric insurgent style adversary. InsurgiSim prototypes an embeddable testbed containing a threat network of agents that one can easily configure and deploy for training and analysis purposes. The insurgent network was constructed inside a socio-cognitive agent framework (FactionSim-PMFserv) that includes: (a) a synthesis of best-of-breed models of personality, culture, values, emotions, stress, social relations, mobilization, as well as (b) an IDE for authoring and managing reusable archetypes and their task-sets (Section 2). Agents and markups in this library are not scripted, and act to follow their values and fulfill their needs. So it's desirable to profile the agents (eg, faction leaders, cell logisticians, followers, bomb maker, financier, recruiter, etc.) as faithfully to the real world as possible. Doing this will improve the utility of InsurgiSim for studying what may be driving the insurgent agents in a given area of operation as Section 3 explains. InsurgiSim's bridge is an HLA federate and can be embedded to drive all or some of the insurgent agents in a 3rd party simulator. Three such examples are summarized in Section 4. The paper closes with next steps to improve InsurgiSim's capabilities and utility.
Nexus Network Journal 8,2: Architecture and Mathematics
Authors: Kim Williams
Venue:  (2007)

This book presents an exploration of the arch from the points of view of architecture, mathematics, engineering, construction history, and cultural symbolism. The arch, one of the most beautiful ways that architects invented to go from "here to "there, spans greater distances and sustains larger loads than a simple post and beam structure, but because it is also more complex, an Eastern proverb called it "the structure that never sleeps. Leonardo da Vinci described the arch as "two weaknesses which, leaning on each other, become a strength, a metaphor for the way that science and art lean on each other to strengthen our lives.
Incorporating information networks into military simulations
Authors: Darryl K. Ahner, Jonathon K. Alt, Francisco Baez, John Jackson, Susan M. Sanchez, Thorsten Seitz
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Information superiority is considered a critical capability for future joint forces. As advances in technology continue to boost our ability to communicate in new and different ways, military forces are restructuring to incorporate these technologies. Yet we are still limited in our ability to measure the contributions made by information networks. We describe three recent studies at the Naval Postgraduate School that involve information networks. First, we examine a simulation model expanded from a two-person, zero-sum game to explore how information superiority contributes to battlefield results and how sensitive it is to information quality. Second, we examine how network-enabled communications affect the logistics operations in a centralized receiving and shipping point. The results are intended to provide operational insights for terminal node operations within a sustainment base. Third, we explore how social networks might be incorporated into agent-based models representing civilian populations in stability operations.
On the Pseudo-achromatic Number Problem
Authors: Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

We study the parameterized complexity of the pseudo-achromatic number problem: Given an undirected graph and a parameter k, determine if the graph can be partitioned into k groups such that every two groups are connected by at least one edge. This problem has been extensively studied in graph theory and combinatorial optimization. We show that the problem has a kernel of at most (k ¿ 2)(k + 1) vertices that is constructable in time $O(m\sqrt{n})$, where n and m are the number of vertices and edges, respectively, in the graph, and k is the parameter. This directly implies that the problem is fixed-parameter tractable. We also study generalizations of the problem and show that they are parameterized intractable.
CALVIN: an immersimedia design environment utilizing heterogeneous perspectives
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Abstract: Describes CALVIN (Collaborative Architectural Layout Via Immersive Navigation), an immersive multimedia approach to applying virtual reality in architectural design and collaborative visualization, emphasizing heterogeneous perspectives. These perspectives, including multiple mental models as well as multiple visual viewpoints, allow virtual reality to be applied in the earlier, more creative, phases of design, rather than just as a walkthrough of the finished space. CALVIN's interface employs visual, gestural and vocal input to give the user greater control over the virtual environment. A prototype of CALVIN has been created and used in the CAVE virtual reality theatre.
Molecular conformation of n-alkanes using terrain/funneling methods
Authors: Rajeswar R. Gattupalli, Angelo Lucia
Venue: Journal of Global Optimization (2009)

Understanding molecular conformation is a first step in understanding the waxing (or formation of crystals) of petroleum fuels. In this work, we study the molecular conformation of typical fuel oils modeled as pure n-alkanes. A multi-scale global optimization methodology based on terrain methods and funneling algorithms is used to find minimum energy molecular conformations of united atom n-alkane models for diesel, home heating, and residual fuel oils. The terrain method is used to gather average gradient and average Hessian matrix information at the small length scale while funneling is used to generate conformational changes at the large length scale that drive iterates to a global minimum on the potential energy surface. In addition, the funneling method uses a mixture of average and point-wise derivative information to produce a monotonically decreasing sequence of objective function values and to avoid getting trapped at local minima on the potential energy surface. Computational results clearly show that the calculated united atom molecular conformations are comprised of zigzag structure with considerable wrapping at the ends of the molecule and that planar zigzag conformations usually correspond to saddle points. Furthermore, the numerical results clearly demonstrate that our terrain/funneling approach is robust and fast.
Windows Vista in Easy Steps
Authors: Harshad Kotecha
Venue:  (2007)

As the successor to Windows XP, Windows Vista is the wave of Microsofts future. This simple guide allows users of all skill levels to fully harness the power of this new program. Covering the five editions of Windows Vista (Business, Enterprise, Home Premium, Home Basic and Ultimate), and explaining its key features, this guide makes the adjustment to this new program seamless and productive.
The power of verification for one-parameter agents
Authors: Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
Venue: Journal of Computer and System Sciences (2009)

We initiate the study of mechanisms with verification for one-parameter agents. We give an algorithmic characterization of such mechanisms and show that they are provably better than mechanisms without verification, i.e., those previously considered in the literature. These results are obtained for a number of optimization problems motivated by the Internet and recently studied in the algorithmic mechanism design literature. The characterization can be regarded as an alternative approach to existing techniques to design truthful mechanisms. The construction of such mechanisms reduces to the construction of an algorithm satisfying certain ''monotonicity'' conditions which, for the case of verification, are much less stringent. In other words, verification makes the construction easier and the algorithm more efficient (both computationally and in terms of approximability).
Pipelining parallel image compositing and delivery for efficient remote visualization
Authors: Qishi Wu, Jinzhu Gao, Zizhong Chen, Mengxia Zhu
Venue: Journal of Parallel and Distributed Computing (2009)

Scientific datasets of large volumes generated by next-generation computational sciences need to be transferred and processed for remote visualization and distributed collaboration among a geographically dispersed team of scientists. Parallel visualization using high-performance computing facilities is a typical approach to processing such increasingly large datasets. We propose an optimized image compositing scheme with linear pipeline and adaptive transport to support efficient image delivery to a remote client. The proposed scheme arranges an arbitrary number of parallel processors within a cluster in a linear order and divides the image into a carefully selected number of segments, which flow through the linear in-cluster pipeline and wide-area networks to the remote client consecutively. We analytically determine the segment size that minimizes the final image display time and derive the conditions where the proposed image compositing and delivery scheme outperforms the traditional schemes including the binary swap algorithm. In order to match the transport throughput for image delivery over wide-area networks to the pipelining rate for image compositing within the cluster, we design a class of transport protocols using stochastic approximation methods that are able to stabilize the data flow at a target rate. The experimental results from remote visualization of large-scale scientific datasets justify the correctness of our theoretical analysis and illustrate the superior performances of the proposed method.
Towards the Automation of Modeling Language Independent Schema Integration
Authors: Peter Bellström, Jürgen Vöhringer
Venue: Proceedings of the 2009 International Conference on Information, Process, and Knowledge Management (2009)

View and schema integration are two very complex tasks in which several views and/or schemata are merged into one global conceptual schema. Due to its complexity, computer-based applications and tools that support and automate parts of the schema integration process are needed. In this paper we propose a composite schema-based matching approach in which we make use of not only taxonomies but also ontologies for facilitating the integration process. Our approach will be a first step towards developing a computer-based application for modeling language independent schema integration.
SemFace: a human face search engine based on the semantic web
Authors: Hamido Hourani, Mohammed Al Rawi, Abdel Latif Abu Dalhoum, Sabina Jeschke
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

SemFace is Semantic Web based search engine to retrieve human face images through face facial features. Each human face image has two ontologies (internal and external) that are associated with it. The classification of those ontologies is based on the data which are concerned for each image. Internal ontology is concerned with absolute (deterministic) data, whereas external ontology is concerned with relative (nondeterministic) data. This search engine consists of two steps (or more) to retrieve a human face images. The first step uses a user query that is the description of some face in order to retrieve the image most similar to that face. The second step is based on the semantic similarity between the selected images from the first step with other images. To mitigate the differences of interpretations between annotators and retrievers, we use coarse values for human facial attributes. One of the most promising issue that this work proposes is that the SemFace may be used in multimedia applications as well as increasing the efficiency of low image retrieval algorithms.
ABC - alphabetical computer-based handwriting investigation system
Authors: Dobrin Nestorov, Stefan Benchev, Stefan Bonchev, Georgi Gluhchev
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

A computer-based handwriting analysis system is described. It realizes the so called alphabetical approach aimed at the description of a large number of letters and symbols from the text under investigation in order to detect specific features and evaluate their frequency. It diminishes significantly the operator's workload and could be used for supervised or self- training of forensic experts. The system is implemented at the Research Institute of Forensic Science and Criminology at the Ministry of the Interior.
Feature Tracking for Mobile Augmented Reality Using Video Coder Motion Vectors
Authors: Gabriel Takacs, Vijay Chandrasekhar, Bernd Girod, Radek Grzeszczuk
Venue: Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality (2007)

We propose a novel, low-complexity, tracking scheme that uses motion vectors directly from a video coder. We compare our tracking algorithm against ground truth data, and show that we can achieve a high level of accuracy, even though the motion vectors are rate-distortion optimized and do not represent true motion. We develop a framework for tracking in video sequences with various GOP structures. Such a scheme would find applications in the context of Mobile Augmented Reality. The proposed feature tracking algorithm can significantly reduce the required rate of feature extraction and matching.
Foss 101: engaging introductory students in the open source movement
Authors: Ralph Morelli, Trishan de Lanerolle
Venue: ACM SIGCSE Bulletin (2009)

Can engaging students in free and open source software(FOSS) pique their interest in computer science? This paper describes an introductory computer science course that introduced students to using FOSS, to contributing to a humanitarian FOSS project, and to studying the broader impact of FOSS on our society. Students learned basic webprogramming skills (PHP/MySQL) and made small but significant contributions to a global FOSS project. Mistakes were made and opportunities were missed. But overall theexperiment was a success and the experience was enjoyable and educational for students and instructor alike. By building on what worked well, this course could serve as a model for incorporating study of FOSS into the introductory computing curriculum.
Detection of Neural Activities in FMRI Using Jensen-Shannon Divergence
Authors: Jayanta Basak
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

In this paper, we present a statistical technique based on Jensen-Shanon divergence for detecting the regions of activity in fMRI images. The method is model free and we exploit the metric property of the square root of Jensen-Shannon divergence to accumulate the variations between successive time frames of fMRI images. Experimentally we show the effectiveness of our algorithm. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Sequencing surgical cases in a day-care environment: An exact branch-and-price approach
Authors: Brecht Cardoen, Erik Demeulemeester, Jeroen Beliën
Venue: Computers and Operations Research (2009)

In this paper we investigate how to sequence surgical cases in a day-care facility. We specify a multi-criteria objective function in which we minimize the peak use of recovery beds, the occurrence of recovery overtime and the violation of various patient and surgeon preferences. The limited availability of resources and the occurrence of medical precautions, such as an additional cleaning of the operating room after the surgery of an infected patient, are taken into account. We apply column generation to solve this combinatorial optimization problem and propose a dynamic programming algorithm to solve the pricing problem. The computational efficiency of this dynamic programming approach is validated through comparison with a mixed integer linear programming approach. In order to obtain integer variables, we embed the column generation loop in an enumerative branch-and-price framework. We elaborate on various branching strategies and branching schemes and examine their impact on the solution quality. The test instances for the computational experiments are generated using real-life data of the surgical day-care center at the academic hospital UZ Leuven Campus Gasthuisberg (Belgium).
Robust Bit Extraction from Images
Authors: Jiri Fridrich
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

In this paper we describe an algorithm for robust extraction of bits from image blocks and a method for synthesizing a Gaussian pseudo-random sequence from those bits. The bits are extracted by thresholding projections onto random smooth patterns generated from a user-specified key. The extracted bits are further utilized to synthesize a Gaussian pseudo-random sequence that changes continuously with the image block yet depends sensitively on the secret key. The proposed technique is quite general and can be combined with majority of oblivious watermarking schemes that generate watermarks from pseudo-random sequences. We anticipate that this algorithm will find applications in many oblivious watermarking schemes including secure data embedding into videos and watermarking images for tamper detection.
Universal software packages to model the distributed-parameter systems
Authors: E. E. Dudnikov
Venue: Automation and Remote Control (2009)

Consideration was given to the universal software packages for modeling objects and distributed-parameter systems obeying the partial differential equations. The packages may serve as important tools for industrial automation because the majority of industrial objects have distributed parameters. The review presented the results of comparing a number of commercial packages against a set of user-defined criteria. Its final part was devoted to some freeware packages. Conclusions were drawn, and recommendations for using the considered packages were given.
Comparative research on regional regulators' associations: A theory-driven path for progress
Authors: Annemijn van Gorp, Carleen Maitland
Venue: Telecommunications Policy (2009)

Since the 1990s regional economic communities have been increasingly involved in the development of model telecommunications policies and regulations. Through semi-independent regional regulators' associations, these communities aim to harmonize telecommunications policy and regulation across member states in hopes of stimulating cross-border investments and market development. To fully understand the role and effects of these administrative bodies, analyses are needed within and between a variety of regions. The research described herein facilitates such analyses by providing a series of theoretically derived propositions developed with reference to a number of regions including the Organization of Eastern Caribbean States (OECS), the Southern African Development Community (SADC), and the European Union (EU).
A Rough Set Based Approach for ECG Classification
Authors: Sucharita Mitra, M. Mitra, B. B. Chaudhuri
Venue: Transactions on Rough Sets IX (2008)

An inference engine for classification of Electrocardiogram (ECG) signals is developed with the help of a rule based rough set decision system. For this purpose an automated data extraction system from ECG strips is being developed by using a few image processing techniques. A knowledge base is developed after consulting different medical books as well as feedback of reputed cardiologists on interpretation and selection of essential time-plane features of ECG signal. An algorithm for extraction of different time domain features is also developed with the help of differentiation techniques and syntactic approaches. Finally, a rule-based rough set decision system is generated using these time-plane features for the development of an inference engine for disease classification. Two sets of rules are generated for this purpose. The first set is for general separation between normal and diseased subjects. The second set of rules is used for classifications between different diseases.
Truthful Stochastic and Deterministic Auctions for Sponsored Search
Authors: Esteban Feuerstein, Pablo Ariel Heiber, Marcelo Mydlarz
Venue: Proceedings of the 2008 Latin American Web Conference (2008)

Incentive compatibility is a central concept in auction theory, and a desirable property of auction mechanisms. In a celebrated result, Aggarwal, Goel and Motwani \cite{AGM2006} presented the first truthful deterministic auction for sponsored search (i.e., in a setting where multiple distinct slots are auctioned). Stochastic auctions present several advantages over deterministic ones, as they are less prone to strategic bidding, and increase the diversity of the winning bidders. Meek, Chickering and Wilson \cite{MCW2005} presented a family of truthful stochastic auctions for multiple identical items. %As the main result of this paper w We present the first class of incentive compatible stochastic auctions for the sponsored search setting. This class subsumes as special cases the \emph{laddered} auctions of \cite{AGM2006} and the stochastic auctions with the \emph{condex} pricing rule of \cite{MCW2005}, consolidating these two seemingly disconnected mechanisms in a single framework. Moreover, when the price per click depends deterministically on the bids the auctions in this class are unique. Accordingly, we give a precise characterization of \emph{all} truthful auctions for sponsored search, in terms of the expected price that each bidder will pay per click. We also introduce randomized algorithms and pricing rules to derive, given an allocation mechanism for the single- or multiple-identical-slots scenarios, a new mechanism for the multislot framework with distinct slots. These extensions have direct practical applications.
Design of Multimedia Database and a Query Language for Video Image Data
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

This paper presents a methodology of database design and query language for multimedia data, especially for video image data. We focus on how to specify / identify "objects'' in video frames, and the way of representing and storing them into a database. The result of the database query is a short "movie'', in which retrieved objects are always emphasized by spotlighting or highlighting. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A hybrid graph-theoretic method for mining overlapping functional modules in large sparse protein interaction networks
Authors: Shihua Zhang, Hong-Wei Liu, Xue-Mei Ning, Xiang-Sun Zhang
Venue: International Journal of Data Mining and Bioinformatics (2009)

Modular architecture, which encompasses groups of genes/proteins involved in elementary biological functional units, is a basic form of the organisation of interacting proteins. Here, we propose a method that combines the Line Graph Transformation (LGT) and clique percolation-clustering algorithm to detect network modules, which may overlap each other in large sparse PPI networks. The resulting modules by the present method show a high coverage among yeast, fly, and worm PPI networks, respectively. Our analysis of the yeast PPI network suggests that most of these modules have well-biological significance in context of protein localisation, function annotation, and protein complexes.