ppxscal/embedding_network huggingface dataset:
Ecological optimization using harmony search
Authors: Zong Woo Geem, Justin C. Williams
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

The music-inspired meta-heuristic algorithm, harmony search, was applied to a natural reserve selection problem for preserving species and their habitats. The problem was formulated as an optimization problem (maximal covering species problem; MCSP) to maximize covered species with minimal efforts. Then, it was solved by an improved harmony search (HS) algorithm which includes problem-specific operations. When applied to real-world problem in the state of Oregon, USA, the harmony search algorithm found better solutions than those of another meta-heuristic algorithm, simulated annealing.
An Effective Approach to Enhance Centroid Classifier for Text Categorization
Authors: Songbo Tan, Xueqi Cheng
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

Centroid Classifier has been shown to be a simple and yet effective method for text categorization. However, it is often plagued with model misfit (or inductive bias) incurred by its assumption. To address this issue, a novel Model Adjustment algorithm was proposed. The basic idea is to make use of some criteria to adjust Centroid Classifier model. In this work, the criteria include training-set errors as well as training-set margins. The empirical assessment indicates that proposed method performs slightly better than SVM classifier in prediction accuracy, as well as beats it in running time.
A New Method for Creating Electrophysiological Maps for DBS Surgery and Their Application to Surgical Guidance
Authors: Srivatsan Pallavaram, Pierre-Francois D'Haese, Chris Kao, Hong Yu, Michael Remple, Joseph Neimat, Peter Konrad, Benoit Dawant
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

Electrophysiological maps based on a Gaussian kernel have been proposed as a means to visualize response to stimulation in deep brain stimulation (DBS) surgeries. However, the Gaussian model does not represent the underlying physiological phenomenon produced by stimulation. We propose a new method to create physiological maps, which relies on spherical shell kernels. We compare our new maps to those created with Gaussian kernels and show that, on simulated data, this new approach produces more realistic maps. Experiments we have performed with real patient data show that our new maps correlate well with the underlying anatomy. Finally, we present preliminary results on an ongoing study assessing the value of these maps as pre-operative planning and intra-operative guidance tools.
Guest Editors' Introduction
Authors: Laurence T. Yang, Marcin Paprzycki, Xiaohui Shen, Xingfu Wu
Venue: IEEE Distributed Systems Online (2004)

Data-intensive computing has become a key characteristic of modern large-scale scientific and engineering applications. For example, applications in the US Department of Energy's Accelerated Strategic Computing Initiative typically generate data in the range of hundreds of gigabytes to hundreds of terabytes. By 2005, detectors at the Large Hadron Collider at CERN, the European Laboratory for Particle Physics, will be producing several petabytes of data each year. The problem ASCI and similar applications face is that, with existing technologies, data sets the applications generate are much too large for effective storage, manipulation, archiving, navigation, visualization, or understanding.
Using Generalization Error Bounds to Train the Set Covering Machine
Authors: Zakria Hussain, John Shawe-Taylor
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider a sub-optimal greedy heuristic algorithm termed the bound set covering machine (BSCM). Next, we propose the branch and bound set covering machine (BBSCM) and prove that it finds a classifier producing the smallest generalization error bound. We further justify empirically the BBSCM algorithm with a heuristic relaxation, called BBSCM(¿), which guarantees a solution whose bound is within a factor ¿ of the optimal. Experiments comparing against the support vector machine (SVM) and SCM algorithms demonstrate that the approaches proposed can lead to some or all of the following: 1) faster running times, 2) sparser classifiers and 3) competitive generalization error, all while avoiding the need for parameter estimation.
Toward Touching a Landscape in a Picture: Investigation of Groping Strategy about Tactile Images and Image Simplification Method
Authors: Takayuki Shiose, Yasuhiro Kagiyama, Kiyohide Ito, Kazuhiko Mamada, Hiroshi Kawakami, Osamu Katai
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

In this paper, we propose a method for "touching a landscape in a photograph." In concrete terms, it is an image processing to simplify images and making images tactile by a stereo copying machine. How much we simplify images depends on subject's groping strategy. Experiments are carried about three images which they are different in their complexity of texture. The results show that frequency of large hand movements correlate with complexity of image texture.
An Off-Screen Model for Tactile Graphical User Interfaces
Authors: Michael Kraus, Thorsten Völkel, Gerhard Weber
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Screen readers enable visually impaired people to access information provided by computer systems. They gather data from operation system and applications, govern the data in an internal data structure (off-screen model), and provide the information in an appropriate format to output devices. However, current approaches for the construction of off-screen models are not appropriate for tactile graphical displays. Within this paper we therefore describe the composition of an alternative off-screen model appropriate for storing and administrating information necessary for tactile graphical displays.
Block-Based Approach to Solving Linear Systems
Authors: Sunil R. Tiyyagura, Uwe Küster
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

This paper addresses the efficiency issues in solving large sparse linear systems parallely on scalar and vector architectures. Linear systems arise in numerous applications that need to solve PDEs on complex domains. The major time consuming part of large scale implicit Finite Element (FE) or Finite Volume (FV) simulation is solving the assembled global system of equations. First, the performance of widely used public domain solvers which target performance on scalar machines is analyzed on a typical vector machine. Then, a newly developed parallel sparse iterative solver (Block-based Linear Iterative Solver --- BLIS) targeting performance on both scalar and vector systems is introduced and the time needed for solving linear systems is compared on different architectures. Finally, the reasons behind the scaling behaviour of parallel iterative solvers is analysed.
Unconstrained Evolution of Analogue Computational "QR" Circuit with Oscillating Length Representation
Authors: Yerbol Sapargaliyev, Tatiana G. Kalganova
Venue: Proceedings of the 8th international conference on Evolvable Systems: From Biology to Hardware (2008)

The unconstrained evolution has already been applied in the past towards the design of digital circuits, and extraordinary results have been obtained, including generation of circuits with smaller number of electronic components. In this paper unconstrained evolution, blended with oscillating length genotype sweeping strategy, is applied towards the design of "QR" analogue circuit on the example of circuit that performs the cube root function. The promising results are obtained. The new algorithm has produced the excellent result in terms of quality of the circuit evolved and evolutionary resources required. It differs from previous ones by its simplicity and represents one of the first attempts to apply Evolutionary Strategy towards the analogue circuit design. The obtained result is compared with previous designs.
A Study on Demonstrative Words Extraction in Instructor Utterance on Communication Support for Hearing Impaired Persons
Authors: Ayaka Ito, Ken Saito, Yoshinori Takeuchi, Noboru Ohnishi, Shigeyoshi Iizuka, Shinya Nakajima
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Remote transcription system is one of the communication support systems for hearing impaired students in a lecture. Because the remote transcription system requires several seconds from the utterance of the instructor to displaying the summarized text, hearing impaired students cannot associate the demonstrative word. In this paper, we analyze how demonstrative words appear in the utterance of instructor. About 75% of demonstrative words follow the pause and are uttered within 500ms after the pause. We propose a method for extracting demonstrative words based on acoustic features and conducted experiments. Experimental results show that the recall rate is more than 80% but the relevance rate is less than 20% in the cross validation test.
Towards the Simulation of Social Interactions through Embodied Conversational Agents
Authors: María Lucila Morales-Rodríguez, Bernard Pavard, Juan J. González B., José A. Martínez F.
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

In this paper, we present a pluridisciplinary approach in order to model the behavior of an embodied conversational agent that expresses emotional and social interactions. We present our methodology to reproduce credible social interactions. Particularly, we discuss the role of the context, the culture, and the emotions in the model of the management of speech acts. This model has been implemented in the context of virtual therapy to simulate the interaction between a therapist and a post-CVA patient.
Detection of Laughter-in-Interaction in Multichannel Close-Talk Microphone Recordings of Meetings
Authors: Kornel Laskowski, Tanja Schultz
Venue: Proceedings of the 5th international workshop on Machine Learning for Multimodal Interaction (2008)

Laughter is a key element of human-human interaction, occurring surprisingly frequently in multi-party conversation. In meetings, laughter accounts for almost 10% of vocalization effort by time, and is known to be relevant for topic segmentation and the automatic characterization of affect. We present a system for the detection of laughter, and its attribution to specific participants, which relies on simultaneously decoding the vocal activity of all participants given multi-channel recordings. The proposed framework allows us to disambiguate laughter and speech not only acoustically, but also by constraining the number of simultaneous speakers and the number of simultaneous laughers independently, since participants tend to take turns speaking but laugh together. We present experiments on 57 hours of meeting data, containing almost 11000 unique instances of laughter.
Everything Is PSPACE-Complete in Interaction Systems
Authors: Mila Majster-Cederbaum, Christoph Minnameier
Venue: Proceedings of the 5th international colloquium on Theoretical Aspects of Computing (2008)

We study complexity issues for interaction systems, a general model for component-based systems that allows for a very flexible interaction mechanism. We present complexity results for important properties of interaction systems such as local/global deadlock-freedom, progress and availability of components.
Cases, Predictions, and Accuracy Learning and Its Application to Effort Estimation
Authors: Jingzhou Li, Brenan Mackas, Michael M. Richter, Guenther Ruhe
Venue: Proceedings of the 9th European conference on Advances in Case-Based Reasoning (2008)

Estimation by analogy EBA (effort estimation by analogy) is one of the proven methods for effort prediction in software engineering; in AI this would be called Case-Based Reasoning. In this paper we consider effort predictions using the EBA () method AQUA and pay attention to two aspects: (i) The influence of the set of analogs on the quality of prediction. The set of analogs is determined by a learning process incorporating the number of nearest neighbors and the threshold of the similarity measure used, (ii) Analyzing and understanding the conditions under which the prediction can be expected to be the most or the least accurate.We study two types of learning: One for finding the "best" set of analogs, and one for finding out factors for reliability. While both questions are relevant for different areas and disciplines, the focus of the paper is on estimation of effort in software engineering. For EBA method AQUA, the cases can be features or past projects characterized by attributes of various type. Classical estimation approaches just investigate the overall estimated quality of a system. However, in that case information is missing if and why estimation was performing the way it did. Bad estimates are often due to external influences. Therefore it is valuable for to find out under which conditions the estimates are more or less reliable.
Threshold Proxy Signature Scheme with Strong Real-Time Efficiency
Authors: Xiaoming Wang, Huoyan Chen
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

The threshold proxy signature scheme with strong real-time efficiency is proposed based on a trapdoor hash function and the sharing secret technology. In the scheme, the procedure of generating threshold proxy signature is performed in two phases. The off-line phase generates a threshold proxy pre-signature before the message to be signed is even known. The pre-signature is independent of the particular message to be signed and is stored for future in the on-line phase. While on-line phase generates quickly a threshold proxy signature using the pre-signature once the message to be signed is presented. The on-line phase is typically very fast and strong real-time efficiency since it only needs a few modular additions and multiplications and one round of communication among proxy signers. Furthermore, the scheme not only has strong real-time efficiency, but also withstands the conspiracy attack existed in the previous schemes and requires no trusted third party. The scheme is particularly useful for requiring the strong real-time efficiency and fully distributed networks such as electric wallet or smart cards etc.
Exploring the Connection of Choreography and Orchestration with Exception Handling and Finalization/Compensation
Authors: Yang Hongli, Zhao Xiangpeng, Cai Chao, Qiu Zongyan
Venue: Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2007)

Web service choreography describes protocols for multiparty collaboration, whereas orchestration focuses on single peers. One key requirement of choreography is to support transactions, which makes exceptional handling and finalization very important features in modelling choreography. A projection is a procedure which takes a choreography and generates a set of processes in the orchestration level. Given a choreography, how to project exceptional handling and finalization constructs is still an open problem. This paper aims to study exception handling and transactionality in choreographies from a projection view. We propose formal languages for both choreography and orchestration with trace semantics, and a projection based on the relationship between choreography and scope rooted in WS-CDL and WS-BPEL respectively.
Optimal sequencing of test conditions in 2k factorial experimental design for run-size minimization
Authors: H.-S. Jacob Tsao, Hongrui Liu
Venue: Computers and Industrial Engineering (2008)

The exponential growth of the number of test conditions (i.e., the ''run size'') of a 2^k factorial design makes the design prohibitively expensive for a large k. When only m of the 2^k effects/interactions are non-zero, only m test conditions are required for their estimation. However, both fractional factorial design and Taguchi method require 2^n test conditions, for some n=
A Structured Template for an Effcient Dependable System Design Using Model Driven Architecture and Spin Tool
Authors: Vishnu Kumar Kaliappan, Prabhu Shankar Kaliappan, Nguyen Xuan Quy, Duckwon, Dugki Min, Eunmi Choi
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Dependability is one of the critical system level issues in protocol design and it is not efficiently solved today. The main factor in this issue is the lack of design/modeling specifications with proper semantics. Most of the design specifications capture either hardware or software entities. In order to solve this problem we propose an architecture template for designing dependable systems. Our approach uses the Model Driven Architecture as the base and it is redesigned by addressing the properties of dependability. More preciously, the verification and validation tools are incorporated in the design phase, which enables the development to be stable at any cost of time. In order to test the efficiency of the template, the example data transfer protocol (protocol used for data transfer over an unreliable media) is analyzed and implemented with the template. The spin plug-in tool is used in the proposed template to verify the design level test results. Our test results impress the designer to verify the expected results with the system design and to identify the errors which are unnoticed during the design phase.
Learning Environment for Digital Natives --- Web 2.0 Meets Globalization
Authors: Crusher Wong, Lilian Vrijmoed, Eva Wong
Venue: Proceedings of the 1st international conference on Hybrid Learning and Education (2008)

Web 2.0 services and communities constitute the daily lives of digital natives with online utilities such as Wikipedia and Facebook. Attempts to apply Web 2.0 at the University of Illinois at Urbana-Champaign demonstrated that the transformation to writing exercises could improve students' learning experiences. Inspired by their success, blogging technology was adopted to pilot a writing-across-the-curriculum project via the learning management system at City University of Hong Kong. Instead of promoting peer assessment, one-on-one tutoring interactions were induced by providing feedback to written assignments. Taking the advantage of the "flat world", tutors were hired from the United States, Canada, Australia, New Zealand and Spain to experiment with outsourcing and offshoring some of the English enhancement schemes. For the university wide project deployment in the fall of 2008, a globalized network of online language tutors needs to be built up with support from universities in countries with English as the native language.
An Operational Model and a Computer Support Environment for Batch Plants Based on Adaptive Scheduling
Authors: Hisaaki Yamaba, Makoto Hirosaki, Shigeyuki Tomita
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

Scheduling is one of the most important feature in production management. Production systems are operated on schedules in order to minimize costs of production and complete production of given demands by their due dates. However, production cannot be often carried out as scheduled because of troubles or accidents such as malfunction of reactors, tardiness of chemical reactions, and so on. Even in such situations, production activities have to be continued with modifying original schedules. As matters stand, such modifications of schedules are carried out depending on human experiences. In this work, an operational model of a production system was considered which is used to continue production under production environments with several uncertainties. First, a computer aided environment of which simulators and schedulers form the core is developed based on the Object-Oriented approach. Next, a series of experiments was carried out using this environment in order to evaluate performances of various parameters used in proposed methods.
Investigating Media Streaming in Multipath Multihop Wireless Network
Authors: Binod Vaidya, Sangduck Lee, Eung-Kon Kim, Jongan Park, Seungjo Han
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Mobile Ad hoc Networks (MANETs) are very attractive for many applications. However, media streaming over MANET is quite challenging task. In this paper, we depict a framework for audio streaming over multihop wireless network. And we propose multipath routing for MANET and investigated media streaming using different scalable speech coding techniques. With the simulation results, performance of such a framework is evaluated.
Using a Probabilistic Neural Network for a Large Multi-label Problem
Authors: Elias Oliveira, Patrick Marques Ciarelli, Alberto F. De Souza, Claudine Badue
Venue: Proceedings of the 2008 10th Brazilian Symposium on Neural Networks (2008)

The automation of the categorization of economic activities from business descriptions in free text format is a huge challenge for the Brazilian governmental administration in the present day. When this problem is tackled by humans,the subjectivity on their classiﬁcation brings another problem: different human classiﬁers can give different results when working on a set of the same business descriptions. This can cause a serious distortion on the information for the planning and taxation of the governmental administrations on the three levels: County,State and Federal. Furthermore, the number of possible categories considered is very large, more than 1000 in the Brazilian scenario. The large number of categories makes the problem even harder to be solved, as this is also a multi-labeled problem. In this work we compared the multi-label lazy learning technique, Ml-KNN, to our Probabilistic Neural Network approach. Our implementation overcome the Ml-KNN algorithm in four metrics typically used in the literature for multi-label categorization problems.
D-Sense: An Integrated Environment for Algorithm Design and Protocol Implementation in Wireless Sensor Networks
Authors: Kazushi Ikeda, Shunsuke Mori, Yuya Ota, Takaaki Umedu, Akihito Hiromori, Hirozumi Yamaguchi, Teruo Higashino
Venue: Proceedings of the 11th IFIP/IEEE international conference on Management of Multimedia and Mobile Networks and Services: Management of Converged Multimedia Networks and Services (2008)

Since Wireless Sensor Networks (WSNs) are regarded as large-scale distributed systems in nature, it is (i) difficult to implement their distributed low-level codes, (ii) hard to analyze their performance and (iii) almost impossible to operate a number of nodes manually. In this paper, we propose an integrated environment called D-sense to solve these problems in WSN development. By providing algorithm-level APIs, D-sense tries to hide distributed, low-level operations in the NesC programming language. The algorithm-level APIs and other NesC codes can automatically be converted into simulator codes to avoid code-writing for simulation purpose. In addition, D-sense provides useful functions like monitoring, logging and debugging of distributed programs. We have implemented several known protocols and evaluated the performance by simulation and real environmental experiments to demonstrate the functions of D-sense.