ppxscal/embedding_network huggingface dataset:
Single-Player Monte-Carlo Tree Search
Authors: Maarten P. Schadd, Mark H. Winands, H. Jaap Herik, Guillaume M. Chaslot, Jos W. Uiterwijk
Venue: Proceedings of the 6th international conference on Computers and Games (2008)

Classical methods such as A* and IDA* are a popular and successful choice for one-player games. However, they fail without an accurate admissible evaluation function. In this paper we investigate whether Monte-Carlo Tree Search (MCTS) is an interesting alternative for one-player games where A* and IDA* methods do not perform well. Therefore, we propose a new MCTS variant, called Single-Player Monte-Carlo Tree Search (SP-MCTS). The selection and backpropagation strategy in SP-MCTS are different from standard MCTS. Moreover, SP-MCTS makes use of a straightforward Meta-Search extension. We tested the method on the puzzle SameGame. It turned out that our SP-MCTS program gained the highest score so far on the standardized test set.
Adaptable Lymphocytes for Artificial Immune Systems
Authors: Paul S. Andrews, Jon Timmis
Venue: Proceedings of the 7th international conference on Artificial Immune Systems (2008)

The adaptable lymphocyte hypothesis is identified as a possible source of inspiration for artificial immune systems. Based on a number of qualitative investigations we identify some properties of a theoretical system (the tunable activation threshold model and excitability) that could be applicable in an engineering domain. An example is shown of how we could exploit these properties.
Formula-Dependent Abstraction for CTL Model Checking
Authors: Junyan Qian, Lingzhong Zhao, Guoyong Cai, Tianlong Gu
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

We present a state abstraction that is defined with respect to a given CTL formula. Since it does not attempt to preserve all ACTL formula, like simulation does, we can expect to compute coarser abstraction. Specifically, the abstraction is used to reduce the size of each Kripke structure, so that their product will be smaller. When the abstraction is too coarse, we show how refinement can be applied to produce a more precise abstract model. We also extend the notion of formula-dependent abstraction to Kripke structure with fairness, and define the coarsest abstraction that preserves the given CTL formula interpreted with respect to the fair paths. The method is exact and fully automatic, and handles full CTL.
Asymptotic analysis for a localized nonlinear diffusion equation
Authors: Jinhuan Wang, Linghua Kong, Sining Zheng
Venue: Computers Mathematics with Applications (2008)

In this paper we study a localized nonlinear diffusion equation u"t=@Du^m+@l"1u^p+@l"2u^q(0,t) subject to null Dirichlet boundary condition with p,q>=0, max{p,q}>m>1, and @l"1,@l"2>0. We investigate interactions among the localized and local sources, nonlinear diffusion with the zero boundary value condition to establish blow-up rates and uniform blow-up profiles of solutions under different dominations. In addition, as results of the interactions of multiple nonlinearities, the blow-up sets of solutions, namely, total versus single point blow-up of solutions are also determined.
Region shrinking and image segmentation based on the compressing vector field
Authors: X. D. Zhuang, N. E. Mastorakis
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

In this paper, a general form of vector field transform for gray-scale images is proposed by an electro-static analogy. A novel compressing vector field is presented, based on which the region center points can be extracted. Then the primitive region extraction is implemented with a region shrinking process. An image segmentation method is presented by primitive region extraction and merging. The experimental results show that the compressing vector field reveals the image structure feature, and the proposed method can achieve effective image segmentation results.
Fabric Level and Application Level QoS Guarantees in Grid Computing
Authors: Li Chunlin, Li Layuan
Venue: Informatica (2007)

In the paper, a cross-layer optimization between application layer and fabric layer is proposed. The aim is to optimize the end-to-end quality of the dynamic grid application as well as efficiently utilizing the grid resources. The application layer QoS and fabric layer QoS are closely interrelated in Grids since the upper layer service is based on the lower level's capabilities. A fabric level and application level QoS scheduling algorithm is proposed. We formulate the integrated design of resource allocation and user QoS satisfaction control into a constrained optimization problem. The optimization framework provides a layered approach to the sum utility maximization problem. The application layer adaptively adjusts user's resource demand based on the current resource conditions, while the fabric layer adaptively allocates CPU, storage and bandwidth required by the upper layer.
Abbreviation Disambiguation: Experiments with Various Variants of the One Sense per Discourse Hypothesis
Authors: Yaakov Hacohen-Kerner, Ariel Kass, Ariel Peretz
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

Abbreviations are very common and are widely used in both written and spoken language. However, they are not always explicitly defined and in many cases they are ambiguous. In this research, we present a process that attempts to solve the problem of abbreviation ambiguity. Various features have been explored, including context-related methods and statistical methods. The application domain is Jewish Law documents written in Hebrew, which are known to be rich in ambiguous abbreviations. Various variants of the one sense per discourse hypothesis (by varying the scope of discourse) have been implemented. Several common machine learning methods have been tested to find a successful integration of these variants. The best results have been achieved by SVM, with 96.09% accuracy.
Keynote address
Authors: W. H. Mac Williams
Venue: Papers and discussions presented at the Dec. 10-12, 1951, joint AIEE-IRE computer conference: Review of electronic digital computers (1951)

My purpose here at this conference is to provide a background, first for meetings like this on subjects dealing with computers, and second, for this particular meeting. My qualifications for keynoting are, I think, as good as those of anyone here: as far as this particular meeting is concerned, I am not now directly engaged in working on computers of the type that we are going to discuss; and the organization that I represent, the Bell Telephone Laboratories, is not in the business of making such computers. So I speak as a relatively innocent bystander. 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
Powerful Combination: GIS and Web Services
Authors: Adam Stone
Venue: IEEE Distributed Systems Online (2004)

Combining Web services with geographic information systems could help update and enhance the formerly static GIS technology in real time.
Fatal Mutations in HIV Population as an Influential Factor for an Onset of AIDS
Authors: Kouji Harada, Yoshiteru Ishida
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

It is well known that mutations occur at high rate at the replication of HIV genome. Mutations on the gene encoding requisite proteins for infection to host cells deprive ability to infect to them, thus such mutations are fatal for HIV population. We have extended Nowak and May's HIV dynamical model into more realistic one by considering the fatal mutations of HIV and an evolution of a mutation rate. Through analyses of the model, we have derived a critical condition controlling an onset of AIDS. The most significant consequence from the derived condition is to have clarified the antigenic diversity threshold theory proposed by Nowak and May succeeds in a characterless and homogeneous HIV population; the theory does not in an inhomogeneous HIV population.
Performance Evaluation of the NVIDIA GeForce 8800 GTX GPU for Machine Learning
Authors: Ahmed Zein, Eric Mccreath, Alistair Rendell, Alex Smola
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

NVIDIA have released a new platform (CUDA) for general purpose computing on their graphical processing units (GPU). This paper evaluates use of this platform for statistical machine learning applications. The transfer rates to and from the GPU are measured, as is the performance of matrix vector operations on the GPU. An implementation of a sparse matrix vector product on the GPU is outlined and evaluated. Performance comparisons are made with the host processor.
Modeling Channel Access Delay and Jitter of IEEE 802.11 DCF
Authors: Yun Li, Chonggang Wang, Keping Long, Weiliang Zhao
Venue: Wireless Personal Communications: An International Journal (2008)

With the ever-increasing requirement of WLAN to support real-time services, it is becoming important to study the delay properties of WLAN protocols. This paper constructs a new model to analyze the channel access delay and delay jitter of IEEE 802.11 DCF in saturation traffic condition. Based on this analytical model, average channel access delay and delay jitter are derived for both basic access and RTS/CTS-based access scheme. The accuracy of the analytical model is validated by simulations and furthermore we discuss the impact of initial contention window, maximal backoff stage, and packet size on channel access delay and delay jitter of 802.11 DCF using the proposed model.
Feedback-controlled resource sharing for predictable eScience
Authors: Sang-Min Park, Marty Humphrey
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

The emerging class of adaptive, real-time, data-driven applications are a significant problem for today's HPC systems. In general, it is extremely difficult for queuing-system-controlled HPC resources to make and guarantee a tightly-bounded prediction regarding the time at which a newly-submitted application will execute. While a reservation-based approach partially addresses the problem, it can create severe resource under-utilization (unused reservations, necessary scheduled idle slots, underutilized reservations, etc.) that resource providers are eager to avoid. In contrast, this paper presents a fundamentally different approach to guarantee predictable execution. By creating a virtualized application layer called the performance container, and opportunistically multiplexing concurrent performance containers through the application of formal feedback control theory, we regulate the job's progress such that the job meets its deadline without requiring exclusive access to resources even in the presence of a wide class of unexpected disturbances. Our evaluation using two widely-used applications, WRF and BLAST, on an 8-core server show our approach is predictable and meets deadlines with 3.4 % of errors on average while achieving high overall utilization.
Identifying Legal and Illegal States in Synchronous Sequential Circuits Using Test Generation
Authors: Eduardas Bareiša, Kęstutis Motiejūnas, Rimantas Šeinauskas
Venue: Informatica (2003)

Identifying legal and illegal states significantly reduces computational complexity of ATPG. A unified framework for identification of the legal and illegal states is presented. Most known methods for identification of the legal and illegal states are interpretable within this framework. New theorems and the resulting procedures for identifying exact collection of legal or illegal states of a circuit are presented. Experimental results demonstrate that exact collection of legal states for some circuits is significantly smaller than collections obtained by backward state search algorithm and by algorithm based on combinational ATPG theorems. The use of the exact collection of legal states allows identifying more undetectable faults. The proposed procedure for identifying of the exact collection of legal states starts from any state of the circuit, builds initially an enlarged collection of legal states and converges rapidly to the exact solution.
On Designing an Asynchronous and Dynamic Platform for Solving Single Task Requests of Remote Applications
Authors: Marc Eduard Frîncu, Dana Petcu
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

Using remotely located software or hardware resources for solving various technical problems is presently the main subject of the current emerging technologies such as utility computing, cloud computing, Grid computing and so on. This paper discusses a possible architectural solution and describes a platform built bearing in mind the requirements for solving mathematical-described problems, but potentially useful also for other kinds of technical problems.
An Experiment in Automatic Classification of Pathological Reports
Authors: Janneke Zwaan, Erik Tjong Kim Sang, Maarten Rijke
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

Medical reports are predominantly written in natural language; as such they are not computer-accessible. A common way to make medical narrative accessible to automated systems is by assigning `computer-understandable' keywords from a controlled vocabulary. Experts usually perform this task by hand. In this paper, we investigate methods to support or automate this type of medical classification. We report on experiments using the PALGA data set, a collection of 14 million pathological reports, each of which has been classified by a domain expert. We describe methods for automatically categorizing the documents in this data set in an accurate way. In order to evaluate the proposed automatic classification approaches, we compare their output with that of two additional human annotators. While the automatic system performs well in comparison with humans, the inconsistencies within the annotated data constrain the maximum attainable performance.
Hardware BLAST Algorithms with Multi-seeds Detection and Parallel Extension
Authors: Fei Xia, Yong Dou, Jinbo Xu
Venue: Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications (2008)

As one of the most widely used bio-sequence searching tools, BLAST adopts index-based approach to detect the matches between two substrings by looking up a large table and processing one match per query. In this paper, we propose a systolic array approach to detect string matches without using looking up tables. The pipelining systolic array is implemented as a multi-seeds detection and parallel extension pipeline engine to accelerate the first two stages of NCBI BLAST algorithm. Different from the index-based approach, our implementation consumes little memory resources and eliminates redundant string extensions by merging multiple adjoin seeds into a valid seed. Our FPGA implementation achieves superior performance results in both of processing element number and clock frequency over related works in the area of FPGA BLAST accelerators. The experimental results also show the speedup can reach about 17 and 48 compared to the NCBI BLASTp and TBLASTn programs for 3072-residue queries on Intel P4 CPU, respectively. Furthermore, the idea of multi-seeds detection also can be adopted in other seed-based heuristic searching applications.
Comparison of H-Logical Norm with some t-Norms
Authors: Branka Nikolic, Petar Hotomski
Venue: Informatica (2003)

The paper presents the comparison of fuzzy conclusions derived from the use of t-norms with the fuzzy conclusions derived from the use of H-norm. The idea was to examine the application of H-logical norm to fuzzy reasoning, which is not monotonious while it is known that t-norms used in fuzzy reasoning have the characteristic of monotonicity. The comparison of fuzzy conclusions was performed by the use of coherence measure. The research was carried out on a relatively small number of examples (nine) and it was shown that the fuzzy conclusions derived from the use of H-norm were the closest to the fuzzy conclusions derived from T L-norm.
On the Modeling of Honest Players in Reputation Systems
Authors: Qing Zhang, Ting Yu
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

The effectiveness of reputation-based trust management fundamentally relies on the assumption that an entity’s future behavior may be predicted based on its past behavior. Though many reputation-based trust schemes have been proposed, they can often be easily exploited, as an attackermay adapt its behavior and make the above assumption invalid. In this paper, we build a statistic model for honest entities in decentralized systems, which serves as a profiling tool to identify suspicious entities. It can be combined with existing trust schemes to ensure that they are applied to entities whose transaction records are consistent with thestatistic model. This approach limits the manipulation capability of adversaries, and thus can greatly improve the quality of reputation-based trust assessment.
Hand Contour Tracking Using Condensation and Partitioned Sampling
Authors: Daiguo Zhou, Yangsheng Wang, Xiaolu Chen
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

In this paper, we present a visual articulated hand contour tracker which is capable of tracking in real-time the contour of an unadorned articulated hand with the palm approximately parallel to the camera's image plane. In our implementation, a B-spline deformable template is used to represent human hand contour, and a 14-dimensions non-linear state space which is divided into 7 parts is used to represent the dynamics of a hand contour. The tracking is performed in grey-scale skin-color image based on particle filter and partitioned sampling. Firstly, a Gaussian model is used to extract the skin pixels. Secondly, particles for each of the 7 parts of the non-linear state space are generated hierarchically based on second-order auto-regressive processes and partitioned sampling, and then each generated particle is weighted by an observation density. Finally, the best complete particle is chosen as the tracking result, and several complete particles are stored to be used in the next frame. The experiments show that our tracker performs well when tracking both rigid movements of the whole hand and non-rigid movements of each finger.
A Method for Integration of WordNet-Based Ontologies Using Distance Measures
Authors: Trong Hai Duong, Ngoc Thanh Nguyen, Geun Sik Jo
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

While there is a large body of previous work focused on WordNet-based for finding the semantic similarity of concepts and words, the application of these word oriented methods to ontology integration tasks has not been yet explored. In this paper, we propose a methodology of WordNet-based distance measures, and we apply the meaning of concepts of upper ontologies to an ontology integration process by providing semantic network called OnConceptSNet. It is a semantic network of concepts of ontologies in which relations between concepts derived from upper ontology WordNet. We also describe a methodology for conflict in ontology integration process.
Planning with Multiple-Components in Omps
Authors: Amedeo Cesta, Simone Fratini, Federico Pecora
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

This paper presents Omps, a new timeline-based software architecture for planning and scheduling whose features support software development for space mission planning applications. The architecture is based on the notions of domain components entities whose properties may vary in time and which model one or more physical subsystems which are relevant to a given planning context. Decisions can be taken on components, and constraints among decisions modify the components' behaviors in time. This paper presents the general features of Omps and an example of how the architecture support development of complex applications.
Classification of Web Documents Using a Graph-Based Model and Structural Patterns
Authors: Andrzej Dominik, Zbigniew Walczak, Jacek Wojciechowski
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

The problem of classifying web documents is studied in this paper. A graph-based instead of traditional vector-based model is used for document representation. A novel classification algorithm which uses two different types of structural patterns (subgraphs): contrast and common is proposed. This approach is strongly associated with the classical emerging patterns techniques known from decision tables. The presented method is evaluated on three different benchmark web documents collections for measuring classification accuracy. Results show that it can outperform other existing algorithms (based on vector, graph, and hybrid document representation) in terms of accuracy and document model complexity. Another advantage is that the introduced classifier has a simple, understandable structure and can be easily extended by the expert knowledge.
ePassport: Securing International Contacts with Contactless Chips
Authors: Gildas Avoine, Kassem Kalach, Jean-Jacques Quisquater
Venue: Financial Cryptography and Data Security: 12th International Conference, FC 2008, Cozumel, Mexico, January 28-31, 2008. Revised Selected Papers (2008)

Electronic passports (ePassports) have known a wide and fast deployment all around the world since the International Civil Aviation Organization published their specifications in 2004. Based on an integrated circuit, ePassports are significantly more secure than their predecessors. Forging an ePassport is definitely thwarted by the use of cryptographic means. In spite of their undeniable benefit, ePassports have raised questions about personal data protection, since attacks on the basic access control mechanism came into sight. Keys used for that purpose derive from the nothing but predictable machine readable zone data, and so suffer from weak entropy. We provide an in-depth evaluation of the basic access key entropy, and prove that Belgian passport, recipient of Interpol "World's most secure passport" award in 2003, provides the worst basic access key entropy one has ever seen. We also state that two-thirds of Belgian ePassports in circulation do not implement any data protection mechanism. We demonstrate our claims by means of practical attacks. We then provide recommendations to amend the ePassport security, and directions for further work.