ppxscal/embedding_network huggingface dataset:
Proposing a hybrid-intelligent framework to secure e-government web applications
Authors: Asaad Moosa, Eanas Muhsen Alsaffar
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

One of the essential needs to implement a successful e-Government web application is security. Web application firewalls (WAF) are the most important tool to secure web applications against the increasing number of web application attacks nowadays. WAFs work in different modes depending on the web traffic filtering approach used, such as positive security mode, negative security mode, session-based mode, or mixed modes. The proposed WAF, which is called (HiWAF), is a web application firewall that works in three modes: positive, negative and session based security modes. The new approach that distinguishes this WAF among other WAFs is that it utilizes the concepts of Artificial Intelligence (AI) instead of regular expressions or other traditional pattern matching techniques as its filtering engine. Both artificial neural networks and fuzzy logic concepts will be used to implement a hybrid intelligent web application firewall that works in three security modes.
Automated discovery of social networks in text-based online communities
Authors: Anatoliy Gruzd
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

As a way to gain greater insights into the operation of online communities, this dissertation applies automated text mining techniques to text-based communication to identify, describe and evaluate underlying social networks among online community members. The main thrust of the study is to find a way to use computers to discover social ties that form between community members just from the digital footprints left behind in their online forum postings automatically. As part of this work, a web-based system for content and network analysis called the Internet Community Text Analyzer (ICTA) is being developed. A prototype of ICTA is available at http://textanalytics.net.
Graphic simulation for camera calibration in visual-servoing applications
Authors: Dorian Cojocaru, Razvan Tudor Tanasie
Venue: Proceedings of the 8th conference on Signal processing, computational geometry and artificial vision (2008)

Hyperredundant robots produce changes of configuration using a continuous backbone made of sections which bend. The lack of no discrete joints is a serious and difficult issue in the determination of the robot's shape. Next development of such application is the vision based control of the robot, kinematics and dynamics. Camera calibration is the essential procedure for all such applications: positioning and orienting the cameras in order to support the accuracy of the image features extraction. The calibration for a pan/tilt/zoom camera orientation is achieved by means of an engineered environment and a simulation graphic module. The paper presents experimental details showing the effectiveness of the technique used with the hyperredundant manipulator.
Asynchronous sequential processes
Authors: Denis Caromel, Ludovic Henrio, Bernard Paul Serpette
Venue: Information and Computation (2009)

Deterministic behavior for parallel and distributed computation is rather difficult to ensure. To reach that goal, many formal calculi, languages, and techniques with well-defined semantics have been proposed in the past. But none of them focused on an imperative object calculus with asynchronous communications and futures. In this article, an object calculus, Asynchronous Sequential Processes (ASP), is defined, with its semantics. We prove also confluence properties for the ASP calculus. ASPs main characteristics are asynchronous communications with futures, and sequential execution within each process. This paper provides a very general and dynamic property ensuring confluence. Further, more specific and static properties are derived. Additionally, we present a formalization of distributed components based on ASP, and show how such components are used to statically ensure determinacy. This paper can also be seen as a formalization of the concept of futures in a distributed object setting.
Medical and health care computing
Authors: Vaughn Alexander
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

The '75 NCC will provide an all-day forum during which physicians and computer specialists will examine mutual problems and concerns. Emphasis will be on medical and health care users' needs. Problems, applications, and the future of medical computing will be assessed by physicians active in medical computing plus authorities from the information processing field. 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
Research on Optimal Coverage Problem of Wireless Sensor Networks
Authors: Xueqing Wang, Fayi Sun, Xiangsong Kong
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In a wireless sensor network, the size of radio nodes has direct relation to the cost of total wireless sensor networks, and at the same time, the problem is closely connected to wireless sensor networks' performance, such as robust, fault-tolerance, and further more, it is considered at first as wireless sensor networks are designed. Therefore, the research on the size of radio nodes has significant meanings of theory and practice to design of wireless sensor networks. The paper simplifies complex coverage problem step by step. By means of math modeling, theoretical analysis and formula deducting, classical geometric theories and the method of mathematics induction are adopted, at last, the analysis formula of minimum number of nodes is theoretically educed under circumstances of entire and seamless coverage in WSN. In addition, it is worth mentioning that the conclusion is the full same with computing the number of communication nodes of wireless sensor networks.
Retailer's optimal ordering and discounting policies under advance sales discount and trade credits
Authors: Yu-Chung Tsao
Venue: Computers and Industrial Engineering (2009)

Providing advance sales discount program to attract consumers or eliminate demand uncertainty is commonly in today's business, such as music disk, apparel, books, etc. Also, trade credit is a popular payment behavior in B2B and B2C transactions. In this research, we use EOQ to model the decisions under advance sales discount and two-echelon trade credits, which involve how much to order and how much to discount to minimize the total related cost. Several examples are given to illustrate the solution procedures and discuss the impact of various system parameters. We conclude with a computational analysis that leads to variety of managerial insights.
Optimal Pixel Matching between Images
Authors: Yuichi Yaguchi, Kenta Iseki, Ryuichi Oka
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

A two-dimensional continuous dynamic programming (2DCDP) method is proposed for two-dimensional spotting recognition of images. Spotting recognition is simultaneous segmentation and recognition of an image by optimal pixel matching between a reference and an input image. The proposed method performs optimal pixel-wise image matching and two-dimensional pixel alignment, which are not available in conventional algorithms. Experimental results show that 2DCDP precisely matches the pixels of non-linearly deformed images.
Hierarchical Classifiers for Complex Spatio-temporal Concepts
Authors: Jan G. Bazan
Venue: Transactions on Rough Sets IX (2008)

The aim of the paper is to present rough set methods of constructing hierarchical classifiers for approximation of complex concepts. Classifiers are constructed on the basis of experimental data sets and domain knowledge that are mainly represented by concept ontology. Information systems, decision tables and decision rules are basic tools for modeling and constructing such classifiers. The general methodology presented here is applied to approximate spatial complex concepts and spatio-temporal complex concepts defined for (un)structured complex objects, to identify the behavioral patterns of complex objects, and to the automated behavior planning for such objects when the states of objects are represented by spatio-temporal concepts requiring approximation. We describe the results of computer experiments performed on real-life data sets from a vehicular traffic simulator and on medical data concerning the infant respiratory failure.
A Team CGA Learning Method TCCLA
Authors: Yanbin Zheng, Zhansheng Mou
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

In distributed virtual environment, through learning, individual CGA(Computer Generated Actor) can adapt environment and other CGA in team, so the team capability of solving problems, the adaptability and robust of CGA team have been increased. When the learning based on random games of team CGA has multiple equilibriums, the equilibrium selection problem of every member in team must be solved. This paper gives a learning method for team CGA called TCCLA. It divides the learning into two levels: managerial member learning and non-managerial member learning. Every member in team selects its optimization actions according to its preference. Non-managerial member learns the optimization equilibrium under the direction of managerial member, so the problem of equilibrium selection has been solved. The IPL algorithm has been improved. The high efficiency of TCCLA has been verified through experiment.
Time-forward computer simulations and the problem of population expansion detection
Authors: Krzysztof A. Cyran, Dariusz Myszor
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

The detection of population expansion is a common problem in contemporary population genetics. There are plenty of methods used for that purpose. One of them utilizes genetic information preserved in microsatellites i.e., short tandem repeat motifs in the genome. We address the problem by simulating microsatellites evolution in different population growth scenarios. Namely we use time-forward computer simulation methods which are based on real life scenarios when succeeding generations are created basing on the preceding ones. The objective of this article is to show advantages and disadvantages of time forward simulation processes, and compare results obtained from this kind of simulation with outcomes of methods based on coalescent theory.
The Transmission Problem for Elliptic Second Order Equations in a Domain with Conical Boundary Points
Authors: Mikhail V. Borsuk
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

We investigate the behavior of weak solutions to the transmission problem for linear and weak quasi-linear elliptic divergence second order equations in a neighborhood of the boundary conical point. We obtain best possible estimates of the weak solutions to the transmission problem near conical boundary point. 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
Assessment for Ontology-Supported Deep Web Search
Authors: Yoo Jung An, Soon Ae Chun, Kuo-chuan Huang, James Geller
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)

Ontologies could play an important role in assisting users in their search for Web pages. This paper considers the problem of constructing domain ontologies that support users in their Web search efforts and that increase the number of relevant Web pages that are returned. To achieve this goal, this paper suggests combining Deep Web information, which consists of dynamically generated Web pages, which cannot be indexed by the existing automated Web crawlers, with ontologies. Improvements when finding Deep Web sites returned by a search engine are assessed based on the framework formulated in this paper. Experimental results suggest that the proposed methods assist users in finding more relevant Web sites.
Efficient and Effective Similar Shape Retrieval
Authors: Jia Wang, Wendy Chang, Raj Acharya
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

In this paper, we present the design and implementation of a content-based retrieval system which achieves efficient and effective similar shape retrieval using a modified geometric hashing technique. The system contains four main components: a feature acquisition module, a query manager, a search engine, and a hash table. The hash table houses the feature information. The query manager accepts the user query and extracts contours from the query image. The feature acquisition module transforms and quantizes the image contours and formulates the hash table entries. Given a visual query, the search agent derives a list of potentially similar shape images by searching the hash table using a majority voting algorithm. Extensive experiments have been conducted to demonstrate that the proposed designs offer a viable and practical approach to similar shape retrieval.
SRAW: A Speech Rehabilitation Assistance Workbench - Speech Ability Evaluation by Audio-Video Input
Authors: Atsuo Yoshitaka, Satoshi Katsuki, Tadao Ichikawa, Masahito Hirakawa
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

As the initial diagnosis of patients of paralytic speech impediment, stability of periodical pronunciation of basic sounds such as 'pa-pa-pa...' is measured by a doctor's viewing. However, measuring periodicity, preciseness and other features of pronunciation by a doctor at a time is a difficult task.In this paper, we describe a system named SRAW (Speech Rehabilitation Assistance Workbench) which measures the ability of basic pronunciation of patients by a camera and a microphone. The system measures the periodicity of pronunciation, speech/pause duration in each cycle of pronunciation, and temporal correlation of a mouth movement and vocal features obtained from voice analysis.
Unsupervised Change Detection of Remotely Sensed Images Using Fuzzy Clustering
Authors: Susmita Ghosh, Niladri Shekhar Mishra, Ashish Ghosh
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

In this paper two fuzzy clustering algorithms, namely Fuzzy C-Means (FCM) and Gustafson Kessel Clustering (GKC), have been used for detecting changes in multitemporal remote sensing images. Change detection maps are obtained by separating the pixel-patterns of the difference image into two groups. To show the effectiveness of the proposed technique, experiments are conducted on three multispectral and multitemporal images. Results are compared with those of existing Marko Random Field (MRF) & neural network based algorithms and found to be superior. The proposed technique is less time-consuming and unlike MRF do not need any a priori knowledge of distribution of changed and unchanged pixels (as required by MRF).
Implementation and Experimentation of a Mixed Reality Collaborative Design Space
Authors: Xiangyu Wang
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

During the last decade, the Mixed Reality (MR) concept and supporting technologies emerges to present the real and virtual contents together onto a single display. This paper mainly focuses on three parts: the first part of this paper presents the theory of Mixed Reality boundaries by Benford, which is envisaged to construct innovative collaborative design spaces; The second part of the paper implements Mixed Reality boundaries theory into the creation of a real-time mixed design space (MDS) between architects and interior designers; The last part of the paper presents the results from an empirical study where the sense of presence in MDS with head-mounted display (HMD) was measured compared with 2D screen to validate the determination of display alternatives for achieving higher level of presence in MDS. The results of the experimentation reveal that the task completion in the HMD session was approximately 25% faster than in the 2D screen session. However, subjects using HMD were more aware of interfaces that distracted their sense of presence and experience in MDS.
Dynamic thermal-aware scheduling on chip multiprocessor for soft real-time system
Authors: Jin Cui, Douglas L. Maskell
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Thermal aware scheduling (TAS) is an important system level solution for dealing with the thermal issues on CMP. We propose a TAS algorithm based on look up tables to allow the rapid calculation of the post-thermal map from the current thermal profile. We propose two different metrics for determining where to place the task: one based on the maximum core temperature in the post-thermal map; and another based on the sum of the product of the post-thermal map temperature and the remaining task runtime for each core. Experimental results show that our algorithms are better, particularly for high power applications, at minimizing the peak/average temperature, and are able to achieve an average rejection ratio of about 30% to 50% of that chieved by existing algorithms from the literature.
BioTop: An upper domain ontology for the life sciences: A description of its current structure, contents and interfaces to OBO ontologies
Authors: Elena Beisswanger, Stefan Schulz, Holger Stenzhorn, Udo Hahn
Venue: Applied Ontology (2008)

In the life sciences, there is an ample need for semantic interoperability of data. Thus shared vocabularies are needed for consistently expressing metadata in terms of semantic annotations as well as for querying bibliographic information systems. In the past years, lots of highly specialized, yet also fragmented terminologies have evolved. However, they lack principled forms of conceptual interlinkage. In order to provide an ontological basis for a seamless integration of such isolated parts of biological knowledge, we here introduce BioTop, an upper domain ontology for molecular biology. We describe its structure and contents, as well as its current interfaces to a selected set of OBO ontologies, which contain more detailed terminological knowledge about specific areas of molecular biology, e.g., cell types, molecular functions, biological processes and chemical compounds.
Group Recommending: A methodological Approach based on Bayesian Networks
Authors: Luis M. de Campos, Juan M. Fernandez-Luna, Juan F. Huete, Miguel A. Rueda-Morales
Venue: Proceedings of the 2007 IEEE 23rd International Conference on Data Engineering Workshop (2007)

The problem of building Recommender Systems has attracted considerable attention in recent years, but most recommender systems are designed for recommending items for individuals. The aim of this paper is to automatically recommend and rank a list of new items to a group of users. The proposed model can be considered as a collaborative Bayesian network-based group recommender system, where the group's rates are computed from past voting patterns of other users with similar tastes. The use of Bayesian networks allows us to obtain an intuitive representation of the mechanisms that govern the relationships between the group members.
Domain adaptation of information extraction models
Authors: Rahul Gupta, Sunita Sarawagi
Venue: ACM SIGMOD Record (2009)

Domain adaptation refers to the process of adapting an extraction model trained in one domain to another related domain with only unlabeled data. We present a brief survey of existing methods of retraining models to best exploit labeled data from a related domain. These approaches that involve expensive model retraining are not practical when a large number of new domains have to be handled in an operational setting. We describe our approach for adapting record extraction models that exploits the regularity within a domain to jointly label records without retraining any model.
Flow-optimized random access for wireless multihop networks
Authors: Juha Leino, Aleksi Penttinen, Jorma Virtamo
Venue: Performance Evaluation (2009)

We study elastic traffic performance in time-slotted wireless random access networks, where the link access probabilities are adjusted at flow level each time a new flow (file transfer) arrives or a flow in progress terminates. By defining the capacity sets of such networks we carry out performance analysis in a dynamic setting, where the flows come and go and share the resources according to the balanced fairness principle. We derive flow throughput analytically for three special scenarios and devise an algorithm for general networks. At low loads, flow-optimized random access yields almost the same performance as optimal/deterministic scheduling.
A fast and reliable multi-sender algorithm for peer-to-peer networks
Authors: Mohammad Hamed Firooz, Alireza Nasiri Avanaki, Mohammad Reza Pakravan, Keivan Ronasi
Venue: Journal of Network and Computer Applications (2009)

Due to special constraints in peer-to-peer (P2P) networks (such as bandwidth limitation) and because of their highly dynamic characteristics, a single node cannot provide a reliable multimedia stream to the receivers. Several multi-sender algorithms are proposed to reliably deliver a media stream to the receiver through the intrinsically unreliable P2P networks. Based on upload bandwidths and availability of peers as well as the bandwidths of the links connecting the senders and the receiver, PROMISE selects a set of active senders to maximize the expected bit-rate delivered to the receiver. By careful investigation of PROMISE, in this paper, we present why and how it deviates from finding the optimal solution. The proposed algorithm, we call IPROMISE, consistently provides a higher media quality to the receiver, with a computational complexity similar to PROMISE. We also introduce FastIPROMISE which provides the same quality as IPROMISE but requires much less computations. That is achieved by shrinking the search space.
A note on the expressibility problem for modal logics and star-free regular expressions
Authors: Balder ten Cate
Venue: Information Processing Letters (2009)

The purpose of this note is to (i) raise attention for an interesting type of decision problem for logics, known under different names such as the expressibility problem and the uniform clone membership problem, (ii) disseminate a remarkable and powerful negative result of M.F. Rat@? from the 1980s that seems to have escaped attention of many researchers, and (iii) show, with the help of Rat@?'s theorem, that the problem is undecidable for star-free regular expressions. In Section 1 we introduce the expressibility problem, taking Boolean formulas as an example. In Section 2, we present, and improve upon, Rat@?'s theorem for transitive modal logics. In Section 3, we derive, as a consequence of Rat@?'s theorem, the undecidability of the expressibility problem for star-free regular expressions. Finally, we conclude in Section 4 with some open questions.