ppxscal/embedding_network huggingface dataset:
Development of Invertebrate Brain Platform: Management of Research Resources for Invertebrate Neuroscience and Neuroethology
Authors: Hidetoshi Ikeno, Ryohei Kanzaki, Hitoshi Aonuma, Masakazu Takahata, Makoto Mizunami, Kouji Yasuyama, Nobuyuki Matsui, Fumio Yokohari, Shiro Usui
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

Various kinds of analysis and mathematical models based on neuroscience are developing in the neural network study. In the research, experimental data and knowledge so far obtained are essential resources to deepen their consideration of neuronal systems and functions. In order to utilize the accumulation of expertise and research effectively, it is important to integrate various resources, such as bibliography and experimental data. The managing and sharing of research resources are absolutely imperative for future development in both experimental and analytical studies. Various scientific fields need a new method to obtain precise information, because the amount of experimental data and publications has increased rapidly due to innovations in measurement, computers and network technologies. Under this situation, an effective resource-managing based on CMS (Content Management System) is introduced here for the laboratory use. We are providing functional modules to manage research resources for neuroinfomatics. As a practical use of these modules, a database system for managing image data of invertebrate neurons measured by Confocal Laser Scanning Microscope (CLSM) is developed. Furthermore, these modules are implemented for management of contents in the Invertebrate Brain Platform.
Monitoring of ambient systems: a challenge: [a position paper for the Somitas workshop at Ambi-Sys 2008]
Authors: Pascal Cherrier, Waldeck Ribeiro Torres
Venue: Proceedings of the 2008 Ambi-Sys workshop on Software Organisation and MonIToring of Ambient Systems (2008)

This short position paper is about ambient systems in the sense of what is known in a research domain usually called ambient intelligence: communicating and mostly wireless electronic and advanced computerized components, sometimes called ambient devices1. We propose to consider the gap between today's monitoring systems for networked computing systems and what is needed for ambient systems. One of the challenges, for instance, is to create performing techniques: the monitoring system needs to periodically get information from the monitored one and the performance of the global system dramatically decreases when the frequency of the catching processus increases. Another challenge is related to time synchronization, as this problem is still not fully solved for current monitoring systems. The behavior of ambient systems is likely to be context-aware and much more dynamical than current systems: several problems occur and need new answers. From a light survey of works related to network monitoring we try to give here some material for a workshop discussion.
On Granular Rough Computing: Factoring Classifiers Through Granulated Decision Systems
Authors: Lech Polkowski, Piotr Artiemjew
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

The paradigm of Granular Computing has quite recently emerged as an area of research on its own; in particular, it is pursued within rough set theory initiated by Zdzisław Pawlak. Granules of knowledge consist of entities with a similar in a sense information content. An idea of a granular counterpart to a decision/information system has been put forth, along with its consequence in the form of the hypothesis that various operators, aimed at dealing with information, should factorize sufficiently faithfully through granular structures [7], [8]. Most important such operators are algorithms for inducing classifiers. We show results of testing few well-known algorithms for classifier induction on well---used data sets from Irvine Repository in order to verify the hypothesis. The results confirm the hypothesis in case of selected representative algorithms and open a new prospective area of research.
Built-In Self-Test Structures
Authors: Edward McCluskey
Venue: IEEE Design Test (1985)

A system that includes self-test features must have facilities for generating test patterns and analyzing the resultant circuitresponse. This article surveys the structures that are used to implement these self-test functions. The various techniquesused to convert the system bistables into test scan paths are discussed. The addition of bistables associated with the I/Obonding pads so that the pads can be accessed via a scan path (external or boundary scan path) is described. Most designsuse linear-feedback shift registers for both test pattern generation and response analysis. The various linear-feedback shiftregister designs for pseudorandom or pseudoexhaustive input test pattern generation and for output response signature analysisare presented.
An Agent-Oriented Dynamic Adaptive Threshold Transmission for XML Data on Networks
Authors: Xu Huang, Dharmendra Sharma
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

Since XML became an official recommendation of the World Wide Web Consortium (W3C) in 1998, it is increasingly being used to transmit data on networks but is a verbose format and needs an efficient encoding to send relatively large amounts of data efficiently. This requirement is particularly important for wireless data communications. It is a common technical challenge for researchers in XML-driven networks to have good performance. One may employ a middleware to enhance performance by minimizing the impact of transmission time [1, 3]. Normally, to reduce the amount of data sent the XML documents are converted to a binary format using a compression routine such as Gzip. However while this would reduce the payload, it results in an increase in the CPU time as the XML document must be compressed before being sent and uncompressed when it is received. In this paper we extended our previous research results [2, 11-13] to an agent-oriented enabling technology, namely Dynamic Adaptive Threshold Transmission (DATT) for XML data on networks. We also show the experimental results obtained from our technique and that from the Network Adaptable Middleware (NAM) established by Ghandeharizadeh et al [1]. Experimental results show that our method is superior to the NAM method [1], supported by the fact that the time taken is 220.6 times better.
Multi-class Support Vector Machines Based on Arranged Decision Graphs and Particle Swarm Optimization for Model Selection
Authors: Javier Acevedo, Saturnino Maldonado, Philip Siegmann, Sergio Lafuente, Pedro Gil
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

The use of support vector machines for multi-category problems is still an open field to research. Most of the published works use the one-against-rest strategy, but with a one-against-one approach results can be improved. To avoid testing with all the binary classifiers there are some methods like the Decision Directed Acyclic Graph based on a decision tree. In this work we propose an optimization method to improve the performance of the binary classifiers using Particle Swarm Optimization and an automatic method to build the graph that improves the average number of operations needed in the test phase. Results show a good behavior when both ideas are used.
A Recoverable Semi-fragile Watermarking Scheme Using Cosine Transform and Adaptive Median Filter
Authors: Shang-Lin Hsieh, Pei-Da Wu, I-Ju Tsai, Bin-Yuan Huang
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

The paper proposes a novel semi-fragile watermarking scheme capable of detecting and recovering tampered regions to protect the integrity of images. The proposed scheme generates the features from the host image itself and uses them as the watermark, which is then embedded into the frequency domain of the host image. Additionally, the scheme uses an adaptive median filter to distinguish between common image processing operations and malicious attacks so that it can react properly. Moreover, the scheme can locate tampered areas and recover these areas. According to the experimental results, the scheme is robust to common image processing operations, including JPEG compression, and is capable of detecting malicious attacks, such as counterfeiting.
An Empirical Bayesian Method for Detecting Out of Context Words
Authors: Sanaz Jabbari, Ben Allison, Louise Guthrie
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

In this paper, we propose an empirical Bayesian method for determining whether a word is used out of context. We suggest we can treat a word's context as a multinomially distributed random variable, and this leads us to a simple and direct Bayesian hypothesis test for the problem in question. We demonstrate this method to be superior to a method based upon common practice in the literature. We also demonstrate how an empirical Bayes method, whereby we use the behaviour of other words to specify a prior distribution on model parameters, improves performance by an appreciable amount where training data is sparse.
A Peer to Peer Grid Computing System Based on Mobile Agents
Authors: Joon-Min Gil, Sung-Jin Choi
Venue: Agents and Peer-to-Peer Computing: 5th International Workshop, AP2PC 2006, Hakodate, Japan, May 9, 2006, Revised and Invited Papers (2006)

In a peer to peer grid computing system, volunteers (i.e., resource provides) with heterogeneous properties can freely join and leave in the middle of their computation. Thus, the system should be adaptive to a dynamic changing environment. In particular, scheduling, result certification, and replication mechanisms must be dynamic and adaptive in such a system. In this paper, we propose a new peer to peer grid computing system based on mobile agents. The proposed system constructs volunteer groups according to volunteers' dynamic properties such as service time, availability, and credibility. For each volunteer groups, different scheduling, result certification, replication mechanisms are used. These mechanisms are implemented as mobile agents and are conducted in a decentralized way.
The algebraic structures of generalized rough set theory
Authors: Guilong Liu, William Zhu
Venue: Information Sciences: an International Journal (2008)

Rough set theory is an important technique for knowledge discovery in databases, and its algebraic structure is part of the foundation of rough set theory. In this paper, we present the structures of the lower and upper approximations based on arbitrary binary relations. Some existing results concerning the interpretation of belief functions in rough set backgrounds are also extended. Based on the concepts of definable sets in rough set theory, two important Boolean subalgebras in the generalized rough sets are investigated. An algorithm to compute atoms for these two Boolean algebras is presented.
The Geometry Optimization of Argon Atom Clusters Using Differential Evolution Algorithm
Authors: Yongxiang Zhao, Shengwu Xiong, Ning Xu
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Recently atomic cluster structures have been intensively studied because of their importance in physics, chemistry and material science. However, finding the lowest energy structure, which is the most stable configuration, is NP-hard. Differential Evolution (DE) algorithm is a new heuristic approach which mainly has three advantages: finding the true global minimum regardless of the initial parameter values, fast convergence, and using few control parameters. In this paper we describe a new search method that uses differential evolution (DE) algorithm to optimize the geometry of small argon atom clusters. Experimental results show that the exact global optimal configuration of argon clusters with atom number N≤ 16 can be found in a reasonable computing time, and approximate optimization can also be obtained for clusters with N=30. From their 3-D geometry structures, we can see that their optimal energy structures are highly symmetrical.
Instability, security and anomaly detection in border gateway protocol
Authors: S. Felix Wu
Venue:  (2007)

BGP, the de facto inter-domain routing protocol, is the core component of Internet infrastructure. As the size, complexity, and connectivity of the Internet increase, the stability and security become major concerns about BGP. This paper made the following efforts to improve BGP stability and security. I developed signature-based and statistical-based approaches to detect abnormal BGP traffic. These techniques can help network operators and researchers to filter out the trivial events and focus mainly on the most important BGP events. I introduced a novel approach to locate Internet instability. This approach correlates BGP updates from multiple Internet BGP looking glass sites. I proposed a filter-based Route Flap Dampening (RFD) that optimizes current RFD by applying two heuristics. I discussed the BGP vulnerabilities and demonstrated a possible selective dropping attack that may blackhole traffic. I also designed a semi-realistic BGP routing testbed and performed two experiments related to BGP security and instability. These experiments demonstrated that BGP is vulnerable to prefix hijacking attack and RFD based deny of service attack.
DIR 41 Case Study
Authors: Christophe Metayer, Mathieu Clabaut
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

Some RATP units are responsible for evolution and maintenance of an automated interlocking specification document.In order to improve their paper and pencil process, RATP asked Systerel if Event-B could be useful to them. An eight month study was launched whose main goal was to help RATP improving their confidence in their interlocking specification, by applying an Event-B approach on rewriting their requirement document.
Federation Based Solution for Peer-to-Peer Network Management
Authors: Jilong Wang, Jing Zhang
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Recently, Peer-to-Peer (P2P) technology has become one of the hottest topics in the research area of Internet. With a variety of P2P applications, especially those applications sharing large-size file resources among a large scale of user community, P2P brought us an even more exciting Internet life. However, P2P also made lots of troubles to network managers because of consuming too much network bandwidth sometimes. Lacking of effective management solution, some ISPs plan to block all P2P services on their network boundaries. In this paper, we propose a federation-based solution for peer-to-peer network management. By setting up a P2P federation, ISPs and P2P service providers can work together for P2P network management. From P2P federation service, ISPs can get P2P nodes information of their own network to make some control to those that disturb normal network services. At the same time, service providers of P2P may get routing information of specific ISPs to optimize the routing of P2P network itself by joining in federation. Under such scenario, it will save much cost for ISPs to detect and control P2P traffic and give up the idea of killing P2P services. Save and help to the development of P2P are the most important target of this solution.
Investigating learning with web lectures
Authors: James D. Foley
Venue:  (2008)

Learning can be improved when instructors use classroom time to engage students with hands-on activities and other kinds of active learning. However, time and cost constraints, especially in the higher education domain, can make integrating active learning into course curricula a significant challenge. With this dissertation, we have designed, implemented, and rigorously evaluated an inexpensive, easy-to-implement educational intervention that facilitates increased student engagement and active learning. A key technological component of this intervention is web lectures: condensed, studio-recorded lectures made available via the web as multimedia presentations that combine video of the lecturer, audio, lecture slides, and a table of contents. When web lectures are used to replace the traditional in-class lecture, classroom time can be utilized in other more engaging, learning-beneficial ways. This work is not just about using web lectures, however; it is also about making them with the best combination of modalities (e.g., video, audio, slides, narrative text) and about technologies and pedagogics that bridge the gap between studying web lectures individually and subsequently applying and extending that lecture material in the classroom. We explored the effectiveness of this educational intervention using two complementary threads of investigation. First, we used a controlled, experimental study to evaluate individual's learning with web lectures as standalone learning objects. Here, we found that our web lectures are more effective and efficient than other similar educational multimedia presentations. Second, we used longitudinal, naturalistic studies to evaluate the deployed classroom intervention as a whole. With these studies, we found that a course taught using our web lecture intervention produces as good or better student grades and significantly improved perception of learning and satisfaction than a traditionally-taught course. Guidelines for making and using web lectures are provided.
A Multi-agent System for Cross-Organizational Workflows Management Based on Process-View
Authors: Ping Jiang, Xinyu Shao, Liang Gao, Zhenfeng Yang
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Workflow interoperability across enterprises boundaries presents a significant challenge recently. Process-view provides a promising way to cross-organizational workflows design. A multi-agent system combined with Petri net based process-view approach is proposed to facilitate cross-organizational workflows management. Within this multi-agent system, a Petri net algebra model and a character string mapping algorithm are proposed to automate the mapping from a Petri net workflow model to a process-view workflow model; the synchronization points are added to integrated process-view workflow models to coordinate the execution of cross-organizational workflow instances.
The Chin Pinch: A Case Study in Skill Learning on a Legged Robot
Authors: Peggy Fidelman, Peter Stone
Venue: RoboCup 2006: Robot Soccer World Cup X (2006)

When developing skills on a physical robot, it is appealing to turn to modern machine learning methods in order to automate the process. However, when no accurate simulator exists for the type of motion in question, all learning must occur on the physical robot itself. In such a case, there is a high premium on quick, efficient learning (specifically, learning with low sample complexity). Recent results in learning locomotion have demonstrated the feasibility of learning fast walks directly on quadrupedal robots. This paper demonstrates that it is also possible to learn a higher-level skill requiring more fine motor coordination, again with all learning occurring directly on the robot. In particular, the paper presents a learned ball-grasping skill on a commercially available Sony Aibo robot, with no human intervention other than battery changes. The learned skill significantly outperforms our best hand-tuned solution. As the learned grasping skill relies on a learned walk, we characterize our learning implementation within the layered learning formalism. To our knowledge, the two learned layers represent the first use of layered learning on a physical robot.
Perspective-aware cartoon clips synthesis
Authors: Yueting Zhuang
Venue: Computer Animation and Virtual Worlds (2008)

In this paper we propose an approach, which allows the users to synthesize cartoon clips according to the perspective of the background image. In order to construct the cartoons smoothly, the character's edge distance and motion direction distance are demonstrated to be the factors affecting the human perception in similarity evaluation, and utilized in cartoon clips synthesis. When applying the generated cartoons to the background image, in which the perspective exists, the size of the character is coordinated according to the scaling factor calculated from the vanishing line. The experiment results demonstrate that our approach can synthesize the cartoon clips more smoothly compared with other single frame reusing strategies. The generated cartoons, which are applied to the background image, can be accepted by the human perception well. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Variable preference modeling with ideal-symmetric convex cones
Authors: Alexander Engau
Venue: Journal of Global Optimization (2008)

Based on the concept of general domination structures, this paper presents an approach to model variable preferences for multicriteria optimization and decision making problems. The preference assumptions for using a constant convex cone are given, and, in remedy of some immanent model limitations, a new set of assumptions is presented. The underlying preference model is derived as a variable domination structure that is defined by a collection of ideal-symmetric convex cones. Necessary and sufficient conditions for nondominance are established, and the problem of finding corresponding nondominated solutions is addressed and solved on examples.
Genetic algorithm based consequent parameters determination of fuzzy-C regression model (FCRM)
Authors: Sajjad Mohsin, Sadaf Sajjad
Venue: Proceedings of the 9th WSEAS International Conference on Evolutionary Computing (2008)

The broadband integrated service digital network (B-ISDN) using an asynchronous transfer mode (ATM) is the next generation of ISDN. The ATM can send data at any time and anywhere because there is access privilege control. However, a state of congestion may develop if a large amount of data is sent by the ATM. To establish an effective congestion control algorithm, a robust traffic model must be constructed. In this paper, we describe a method for constructing a traffic model using a fuzzy AR model that is based on a fuzzy c-regression model and a simple genetic algorithm. Computational experiments were carried out to show the validity of the proposed method. The experiments showed that the present method is much more robust for traffic modeling than the previous method.
Measuring uncertainty in graph cut solutions
Authors: Pushmeet Kohli, Philip H. S. Torr
Venue: Computer Vision and Image Understanding (2008)

In recent years graph cuts have become a popular tool for performing inference in Markov and conditional random fields. In this context the question arises as to whether it might be possible to compute a measure of uncertainty associated with the graph cut solutions. In this paper we answer this particular question by showing how the min-marginals associated with the label assignments of a random field can be efficiently computed using a new algorithm based on dynamic graph cuts. The min-marginal energies obtained by our proposed algorithm are exact, as opposed to the ones obtained from other inference algorithms like loopy belief propagation and generalized belief propagation. The paper also shows how min-marginals can be used for parameter learning in conditional random fields.