ppxscal/embedding_network huggingface dataset:
The Analysis of Intelligence Behavior in Search Engine
Authors: Haiming Li, Yajun Du, Yang Xu, Dan Meng
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

Intelligence of humankind mainly includes five parts: the ability of observe, the ability of memory, the ability of practice, the ability of thought, the ability of imagine etc, which are the total of the mentality. In this paper, the intelligence behavior processing the data of book index is discussed. The process searching data and information in Internet is similar as that in data book index. And so there are five intelligence behaviors in search engine: fell behavior, memory behavior, study behavior, thought behavior, and comprehend behavior. The work process of search engine will divide into four stages: classifying web page, confirming a scope of information searching, crawling web pages in internet, and filtrating the result web pages.
Automatic T-Mixture Model Selection via Rival Penalized EM
Authors: Chunyan Zhang, Jin Tang, Bin Luo
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

Modelling mixtures of multivariate t-distributions are usually used instead of Gaussian mixture models(GMM) as a robust approach, when one fits a set of continuous multivariate data which have wider tail than Gaussian's or atypical observations, but it is unable to perform model selection automatically through the traditional EM (Expectation Maximization) algorithm. To solve this problem, a new algorithm, which is called Rival Penalized Expectation-Maximization (RPEM) algorithm, is proposed to t-mixture model (TMM). It can automatically select an appropriate number of densities in t-density mixture model. Experimental results on unsupervised color image segmentation demonstrate the affectivity of the proposed algorithm.
P2PEACE: a P2P-based simulation Environment for Autonomic Content Exchange Networks
Authors: Fares Benayoune, Luigi Lancieri, Anasser Ag Rhissa
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

This paper presents a study on a global replication architecture intended to autonomic content exchange between communities of active nodes. The main objective is to exploit and reuse the synergy of groups to optimize data access in a distributed system. A self management based on thematic similarity between nodes is an efficient manner of optimizing data access (availability and selectivity). The evaluation and the test of such architecture before its large deployment are, however, extremely important. Therefore, a simulation tool called P2PEACE is developed. It is designed primarily to visualize interactions between the network nodes and provide some related statistics to measure the exchange performance. In fact, the existing simulation environments offer good tools of testing the performance of an isolated node (e.g. web cache) or algorithms used for cooperation between groups. However, these approaches do not give a clear vision of the content mobility between the system nodes. In this paper, a method to analyze collective nodes as a global system and understand how contents move around them is, therefore, proposed. Results showed that a semantic organization can greatly optimize the exchanges in such a situation.
Agent-Based Approach for Dynamic Scheduling in Content-Based Networks
Authors: Raafat Aburukba, Hamada Ghenniwa, Weiming Shen
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Network-based digital advertisement becomes a core in e-business applications. The major objective is to send the right content, to the right audience at the right time. Technically, this is called scheduling problem. However, delivering dynamic scheduling for contents remains a major challenge especially when a diverse number of resources (both for content and display) are geographically distributed. In this dynamic environment, scheduling usually involves complex and non-deterministic interactions between different participants. In this work, we propose a distributed multi-agent approach to model intelligent dynamic scheduling solution in advertisement. We believe that agent-based model is appropriate due to its characteristics to support both dynamic behaviour and distributed structure. The main contribution of this work includes: (1) modelling the scheduling problem in advertisement, (2) developing an agent-based scheduling solution for distributed, dynamic environment. The proposed approach is validated through a prototype implementation using the Coordinated Intelligent Rational Agent (CIR-Agent) model.
State Assignment for Detecting Erroneous Transitions in Finite State Machines
Authors: Markus Damm
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

A new concurrent error detection scheme for detecting faulty transitions in finite state machines is presented. Instead of assigning codewords to states, codewords are assigned to transitions by an appropriate state assignment. For the detection of one erroneous bit, it is possible in certain cases to find such an assignment without adding extra state bits. The resulting area overhead is determined for some benchmark examples. Finally, a system paradigm is sketched which uses error detection for soft error correction and reliability management.
Modelling brain emergent behaviours through coevolution of neural agents
Authors: Michail Maniadakis, Panos Trahanias
Venue: Neural Networks (2006)

Recently, many research efforts focus on modelling partial brain areas with the long-term goal to support cognitive abilities of artificial organisms. Existing models usually suffer from heterogeneity, which constitutes their integration very difficult. The present work introduces a computational framework to address brain modelling tasks, emphasizing on the integrative performance of substructures. Moreover, implemented models are embedded in a robotic platform to support its behavioural capabilities. We follow an agent-based approach in the design of substructures to support the autonomy of partial brain structures. Agents are formulated to allow the emergence of a desired behaviour after a certain amount of interaction with the environment. An appropriate collaborative coevolutionary algorithm, able to emphasize both the speciality of brain areas and their cooperative performance, is employed to support design specification of agent structures. The effectiveness of the proposed approach is illustrated through the implementation of computational models for motor cortex and hippocampus, which are successfully tested on a simulated mobile robot.
TrAgent: A Multi-Agent System for Stock Exchange
Authors: Raju Tatikunta, Shahram Rahimi, Pranav Shrestha, Johan Bjursel
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

TrAgent is a software-agent based model for a stock exchange such as the New York Stock Exchange and the procedure of trading securities on the trading floor. The model comprises the complete process from the initiation of a trading order until its execution. The software agent paradigm is the framework for implementing the proposed model. The properties of intelligent software agents meet the characteristics of the actors on the trading floor and provide capabilities for efficient distributed computing. Because of the space restriction, the main focus of this paper is on stock broker agent, one of the most important agents in TrAgent. Intelligence is provided to the stock broker agent in order to make reasoning and decisions on the profitability of a firm. This intelligence is provided using Fuzzy Expert System. The paper further discusses the design and development issues concerning different components of the model.
Using Stationary-Dynamic Camera Assemblies for Wide-area Video Surveillance and Selective Attention
Authors: Ankur Jain, Dan Kopell, Kyle Kakligian, Yuan-Fang Wang
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

In this paper, we present a prototype video surveillance system that uses stationary-dynamic (or master-slave) camera assemblies to achieve wide-area surveillance and selective focus-of-attention. We address two critical issues in deploying such camera assemblies in real-world applications: off-line camera calibration and on-line selective focus-ofattention. Our contributions over existing techniques are twofold: (1) in terms of camera calibration, our technique calibrates all degrees-of-freedom (DOFs) of both stationary and dynamic cameras, using a closed-form solution that is both efficient and accurate, and (2) in terms of selective focus-of-attention, our technique correctly handles dynamic changes in the scene and varying object depths. This is a significant improvement over existing techniques that use an expensive and non-adaptable table-look-up process.
Factors affecting the expectation of casualties in the virtual range toxicity model
Authors: José Sepúlveda, Luis Rabelo, Jaebok Park, Fred Gruber, Oscar Martínez
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The Virtual Range (VR) is an environment that integrates in a seamless fashion several models to improve complex systems visualization. A complex system is a non-linear system of systems whose interactions bring together interesting emergent properties that are very difficult to visualize and/or study by using the traditional approach of decomposition. The VR Toxicity Model as described here represents the different systems that interact in the determination of the expectation of casualties (Ec) resulting from the toxic effects of the gas dispersion that occurs after a disaster affecting a Space Shuttle within 120 seconds of liftoff. We present a detailed description of the VR and the factors affecting Ec. The system will help local authorities to estimate the population at risk in order to plan for areas to evacuate and/or for the resources required to provide aid and comfort and mitigate damages in case of a disaster.
High-Performance Rendering on Clusters of Workstations
Authors: Sourav Dalal, Frank Devai, Md. Mizanur Rahman
Venue: Proceedings of the conference on Geometric Modeling and Imaging: New Trends (2006)

The computer-graphics aspects of the visualization of large data sets, in particular, digital models of real or planned solid objects in a heterogeneous distributed environment are investigated. It is demonstrated that binaryswap compositing does not scale well on networks of workstations. A multi-server system, based on scanline algorithms and using Java technology, is proposed. The proposed system is efficient as servers only need to solve a problem of growth rate of n log n, it is fault tolerant as both lost messages and server failures are tolerated, and it has negligible hardware costs as it runs on existing networks of workstations. The system is also scalable, as data sets are sent to all servers in the same packets, regardless of the number of servers, and the amount of data sent back by servers only depends on the resolution of the final image.
Some topics on deterministic scheduling problems
Authors: Joseph Y-T. Leung
Venue:  (2005)

Sequencing and scheduling problems are motivated by allocation of limited resources over time. The goal is to find an optimal allocation where optimality is defined by some problem specific objectives. This dissertation considers the scheduling of a set of n tasks, with precedence constraints, on m &ge; 1 identical and parallel processors so as to minimize the makespan. Specifically, it considers the situation where tasks, along with their precedence constraints, are released at different times, and the scheduler has to make scheduling decisions without knowledge of future releases. Both preemptive and nonpreemptive schedules are considered. This dissertation shows that optimal online algorithms exist for some cases, while for others it is impossible to have one. The results give a sharp boundary delineating the possible and the impossible cases. Then an O(n log n)-time implementation is given for the algorithm which solves P | p j = 1, rj, outtree | &sum;Cj and P | pmtn, pj = 1, r j, outtree | &sum;Cj. A fundamental problem in scheduling theory is that of scheduling a set of n unit-execution-time (UET) tasks, with precedence constraints, on m &ge; 1 parallel and identical processors so as to minimize the mean flow time. For arbitrary precedence constraints, this dissertation gives a 2-approximation algorithm. For intrees, a 1.5-approximation algorithm is given. Six dual criteria problems are also considered in this dissertation. Two open problems are first solved. Both problems are single machine scheduling problems with the number of tardy jobs as the primary criterion and with the total completion time and the total tardiness as the secondary criterion, respectively. Both problems are shown to be NP-hard. Then it focuses on bi-criteria scheduling problems involving the number of tardy jobs, the maximum weighted tardiness and the maximum tardiness. NP-hardness proofs are given for the scheduling problems when the number of tardy jobs is the primary criterion and the maximum weighted tardiness is the secondary criterion, or vice versa. It then considers complexity relationships between the various problems, gives polynomial-time algorithms for some special cases, and proposes fast heuristics for the general case.
Multi-Variate Visualization of Cardiac Virtual Tissue
Authors: J W. Handley, K W. Brodlie, R H. Clayton
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

In standard analysis of cardiac models, typically one variable -usually the trans-membrane potential -is used in the generation of visualizations. However, all but the most basic models have many state variables at each node, information that is not used when visualizing the output of the model. In this paper, we present a novel approach to visualizing the entire state of a 2D cardiac virtual tissue.
A Negotiation Framework for Automatic Collision Avoidance between Vessels
Authors: Hu Qinyou, Hu Qiaoer, Shi Chaojian
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

Automatic vessel collision-avoidance systems have been studied in the fields of artificial intelligence and navigation for decades. And to facilitate collision-avoidance decision-making in any two-vessel-encounter situation, several expert and fuzzy expert systems have been developed. However, none of them can negotiate with each other as seafarers usually do when they intend to make a more economic overall collision-avoidance plan in the COLREG-HIGH-COST situations where collision avoidance following the International Regulations for Preventing Collisions at Sea(COLREG) costs too much. In this paper, a negotiation framework is put forward to enable vessels to negotiate to optimize collision avoidance in the COLREG-HIGH-COST situations at open sea. With the framework proposed in this paper, two vessels involved in a COLREG-HIGH-COST situation can negotiate with each other to get a more economic overall collision-avoidance plan than that suggested by the legacy collision- avoidance systems alone.
Positivity-Preserving Scattered Data Interpolating Surface using C^1 Piecewise Cubic Triangular Patches
Authors: Azizan Saaban, Abd. Rahni Mt. Piah, Ahmad Abd. Majid
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

The construction of a bivariate C^1 interpolant to scattered data is considered in which the interpolant is positive everywhere if the original data are positive. This study is motivated by earlier work in which sufficient conditions are derived on Bézier points in order to ensure that surfaces comprising cubic Bézier triangular patches are always positive and satisfy C^1 continuity conditions. Initial gradients at the data sites are estimated and then modified if necessary to ensure that these conditions are satisfied. The construction is local and easy to implement. Graphical examples are presented using two test functions.
Analysis of Dynamic Heuristics for Workflow Scheduling on Grid Systems
Authors: Maria M. Lopez, Elisa Heymann, Miquel A. Senar
Venue: Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (2006)

Scheduling is an important factor for the efficient execution of computational workflows on Grid environments. A large number of static scheduling heuristics has been presented in the literature. These algorithms allocate tasks before job execution starts and assume a precise knowledge of timing information, which may be difficult to obtain in general. To overcome this limitation of static strategies, dynamic scheduling strategies may be needed for a changing environment such as the Grid. While they incur runtime overheads, they may better adapt to timing changes during job execution. In this work, we analyse five well-known heuristics (min-min, max-min, sufferage, HEFT and random) when used as static and dynamic scheduling strategies in a grid environment in which computing resources exhibit congruent performance differences. The analysis shows that nonlist based heuristics are more sensitive than list-based heuristics to inaccuracies in timing information. Static list-based heuristics perform well in the presence of low or moderate inaccuracies. Dynamic versions of these heuristics may be needed only in environments where high inaccuracies are observed. Our analysis also shows that list-based heuristics significantly outperform non-list based heuristics in all cases and, therefore, constitute the most suitable strategies by which to schedule workflows either statically or dynamically.
Web-Based Distributed Simulation and Data Management Services for Medical Applications
Authors: Masashi Nakagawa, Kazunori Nozaki, Shinji Shimojo
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

We proposed a distributed service oriented system with web-based interface for medical information to.. promote the practical prediction of clinical prognosis. The proposed system provided hospitals secure access for medical information and processing simulations to examine effects of surgical treatments. Through a web interface, users could operate the system in order to execute the simulations, access data from/to distributed storage, and display the medical information. These functions were combined by Web Services technique, and ontology mapping based on ICD10 was applied to combine various types of medical information. A client-side volume display using GPU was developed to visualize the result volumetric data interactively, and the system adjusted data precision dynamically to maintain the rendering speed. Being based on standardized mechanism, our framework can be applied to similar complex problems with different types of and quantities of information, such as microscopy or geography.
Adoption Factors of Mobile Services
Authors: Banu Kargin, Nuri Basoglu
Venue: Proceedings of the International Conference on Mobile Business (2006)

This paper addresses simple but powerful framework for adoption factors of mobile services. The framework synthesizes, refines, and extends current approaches to understand adoption factors. The study started with a background research to identify factors determining the adoption of innovation and mobile services. Then, study is continued with a survey which had questions about two types of mobile services according to current adoption status of these services. For the first type of service, SMS had been selected as a widely used, already adopted service to seek for factors affecting consumer satisfaction. The second type of service was not currently widely adopted service in the market as opposed to already used SMS, which is called "Pocket Info & Enjoy" service in the paper. Pocket Info & Enjoy, which is information based service, had been described in the survey and asked questions to identify factors determining attitude to use this new service. Most of the findings were in line with literature, for an already adopted service, usefulness and attitude are direct factors influencing consumer satisfaction. On the other hand, usefulness and past experience are influencers and personalization and social factors are indirect determinants of consumer's attitude towards using new mobile services.
Arabic Character Recognition using Modified Fourier Spectrum (MFS)
Authors: Sabri A. Mahmoud, Ashraf S. Mahmoud
Venue: Proceedings of the conference on Geometric Modeling and Imaging: New Trends (2006)

Arabic character recognition algorithm using Modified Fourier Spectrum (MFS) is presented. The MFS descriptors are estimated by applying the Fast Fourier Transform (FFT) to the Arabic character primary part contour. Ten descriptors are estimated from the Fourier spectrum of the character primary part contour by subtracting the imaginary part from the real part (and not from the amplitude of the Fourier spectrum as is usually the case). These descriptors are then used in the training and testing of Arabic characters. The computation of the MFS descriptors requires less computation time than the computation of the Fourier descriptors. Experimental results have shown that the MFS features are suitable for Arabic character recognition. Average recognition rate of 95.9% was achieved for the model classes. The analysis of the errors indicates that this recognition rate can be improved by using the "hole" feature of a character and use cleaning corrupted data.
A heuristic to determine equipment setup changes based on estimated LOT arrivals in a semiconductor FAB
Authors: Raja Sunkara, Ramesh Rao
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Certain classes of tools used in the semiconductor industry require the tools to be setup differently in order to process different types of products. In cases of large setup times, it is important to minimize the number of setup changes in order to improve the overall equipment utilization. Minimizing the number of setup changes needs to be balanced with the restriction on the product queue times. Further, it is important that the cycle time of low volume products is not penalized in order to improve equipment utilization. This article presents a heuristic algorithm to determine the setup for each tool in a workstation based on the estimated arrival times of different products at the workstation. The approach described here takes into account the number of tools, their capability, and the expected workload for each setup over a predetermined horizon. The heuristic is independent of the product mix released into the line.
Development of a Computer-Aided Tool for Evaluation and Training in 3D Spatial Cognitive Function
Authors: Ching-Fen Jiang, De-Kai Chen, Yuan-Si Li, Jheng-Long Kuo
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

The proportion of senile people tends to increase in the global population. The cognitive impairment in the three dimensional (3D) space is usually associated with senile dementia. This paper presents a computer-aid tool developed to evaluate and train the cognitive ability in the 3D space by using the virtual reality technique. Once the norm is developed, this tool can assist the physiotherapist to evaluate the patients' 3D cognitive function in a more objective and efficient way. The viability of 3D cognitive training will be evaluated among the normal subjects prior to clinical trials.