ppxscal/embedding_network huggingface dataset:
A Generator for Multimodal Test Functions with Multiple Global Optima
Authors: Jani Rönkkönen, Xiaodong Li, Ville Kyrki, Jouni Lampinen
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

The topic of multimodal function optimization, where the aim is to locate more than one solution, has attracted a growing interest especially in the evolutionary computing research community. To experimentally evaluate the strengths and weaknesses of multimodal optimization algorithms, it is important to use test functions representing different characteristics and of various levels of difficulty. However, the available selection of multimodal test problems with multiple global optima is rather limited at the moment and no general framework exists. This paper describes our attempt in constructing a test function generator to allow the generation of easily tunable test functions. The aim is to provide a general and easily expandable environment for testing different methods of multimodal optimization. Several function families with different characteristics are included. The generator implements new parameterizable function families for generating desired landscapes and a selection of well known test functions from literature, which can be rotated and stretched. The module can be easily imported to any optimization algorithm implementation compatible with C programming language.
Algorithms and the Grid
Authors: Geoffrey C. Fox, Mehmet S. Aktas, Galip Aydin, Harshawardhan Gadgil, Shrideep Pallickara, Marlon E. Pierce, Ahmet Sayar
Venue: Computing and Visualization in Science (2009)

We review the impact of Grid Computing and Web Services on scientific computing, stressing the importance of the &#x201c;data-deluge&#x201d; that is driven by deployment of new instruments, sensors and satellites. This implies the need to integrate the naturally distributed data sources with large simulation engines offering parallel low latency communication and so to integrate parallel and Grid computing paradigms. We start with an overview of these and the evolving service architectures. We illustrate the identified areas of interest for Algorithms and the Grid with the specific example of SERVOGrid that supports earthquake science research. We comment on the appropriate messaging infrastructure for Grids and data assimilation and contrast it with MPI.
Energy distribution modeling of car body deformation using fuzzy control and LPV representations
Authors: István Á Harmati, András Rövid, László Szeidl, Péter Várlaki
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

The main aim of the paper is to introduce a novel method - based on fuzzy control and linear parameter varying (LPV) system representation transformable into HOSVD based Canonical form- for modeling deformation processes with respect to the distribution of the absorbed kinetic energy. Modeling such kind of processes requires many uncertain input parameters. Using the proposed concept we are able to handle them and keep the complexity of the models low by using higher order singular value decomposition (HOSVD) technique.
Language Feature Mining for Music Emotion Classification via Supervised Learning from Lyrics
Authors: Hui He, Jianming Jin, Yuhong Xiong, Bo Chen, Wu Sun, Ling Zhao
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

In recent years, efficient and intelligent music information retrieval became very important. One essential aspect of this field is music emotion classification by earning from lyrics. This problem is different from traditional text categorization in that more linguistic or semantic information is required for better emotion analysis. Therefore, we focus on how to extract useful and meaningful language features in this paper. We investigate three kinds of preprocessing methods and a series of language grams having different n-order under the well-known n-gram language model framework to extract more semantic features. Then, we employ three supervised learning methods (Naïve Bayes, maximum entropy classification, and support vector machines) to examine the classification performance. Experimental results show that feature extraction methods improve music emotion classification accuracies. Maximum entropy classification with unigram+bigram+trigram gets best accuracy and it is suitable for music emotion classification.
Adaptive fuzzy controller for non-affine systems with zero dynamics
Authors: Abdesselem Boulkroune, Mohamed Tadjine, Mohammed M'Saad, Mondher Farza
Venue: International Journal of Systems Science (2009)

In this article, the direct adaptive fuzzy control problem is investigated for a class of general non-linear systems with zero dynamics. The direct adaptive fuzzy controller is developed based on a unified observer which is used to estimate the time derivatives of the output. The corrective term of the proposed observer involves a well-defined design function which is shown to be satisfied by the commonly used high-gain-based observers, namely for the usual high-gain observers and the sliding-mode observers together with their implementable versions. By using a general error function, and without resorting to the famous strictly positive real condition or the filtering of the observation error, a general proportional-integral (PI) law for updating the fuzzy parameters is proposed. Ultimately boundedness of the error signals is shown through Lyapunov's direct method. Theoretical results are illustrated through two simulation examples.
A New Mobile Spatial Information Service Grid Computing Model Based on Mobile Agent
Authors: Gen Tian, Jin-fang Li
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

A new mobile computing model of spatial information service is studied based on grid computing environment. Key technologies are presented in the model, including mobile agent (MA) mobile computing, grid computing, location based service (LBS), global positioning system (GPS), and wireless communication technologies, such as, general packet radio service (GPRS), transfer control protocol/internet protocol (TCP/IP), and user datagram protocol (UDP). In order to deal with the narrow bandwidth and instability of the wireless internet, distributed organization of tremendous spatial data, limited processing speed and low memory of mobile devices, a new mobile agent based computing model of mobile spatial information service grid (MSISG) is further proposed that has good load balance, high processing efficiency, less network communication and thus suitable for mobile computing environment. A field test is carried out through this model, and the results show that the proposed model is adaptable for mobile spatial information service.
Adobe Photoshop Lightroom 2 for Digital Photographers Only
Authors: Rob Sheppard
Venue:  (2008)

Rob Sheppard understands that technology should benefit the photographer, helping him or her to create more exciting images. That's exactly what Photoshop Lightroom does. Aided by exquisite color photos and screen shots, Rob shows readers how to improve their workflow and produce better photos with Lightroom. Readers learn to use this revolutionary tool in the only context that matters-how it can help them become more productive photographers.This new edition covers:Using Lightroom to streamline the process of importing, managing, developing, and presenting quantities of images Exploring nondestructive image processing and color-managed printing Working with tone curve, adjust white balance, fine-tune vibrance and saturation, and easily correct color Creating presets to use again and again based on adjustments used regularly Organizing and managing images in the Library and setting up a customized system Creating eye-popping prints, show-stopping slideshows, and Web galleries Making the most of Lightroom's integration with Photoshop Bringing out detail in highlights and shadows using Recovery and Fill Light controls
Committing conflicting transactions in an STM
Authors: Hany E. Ramadan, Indrajit Roy, Maurice Herlihy, Emmett Witchel
Venue: ACM SIGPLAN Notices (2009)

Dependence-aware transactional memory (DATM) is a recently proposed model for increasing concurrency of memory transactions without complicating their interface. DATM manages dependences between conflicting, uncommitted transactions so that they commit safely. The contributions of this paper are twofold. First, we provide a safety proof for the dependence-aware model. This proof also shows that the DATM model accepts all concurrent interleavings that are conflict-serializable. Second, we describe the first application of dependence tracking to software transactional memory (STM) design and implementation. We compare our implementation with a state of the art STM, TL2 [4]. We use benchmarks from the STAMP [21] suite, quantifying how dependence tracking converts certain types of transactional conflicts into successful commits. On high contention workloads, DATM is able to take advantage of dependences to speed up execution by up to 4.8x.
Commitment-based service coordination
Authors: Stefan J. Witwicki, Edmund H. Durfee
Venue: International Journal of Agent-Oriented Software Engineering (2009)

We present a methodology for composing large-grained services that exhibit temporal uncertainty and complex task dependencies. Our multi-agent approach incorporates temporal and stochastic planning paradigms and commitment-based negotiation to achieve the coordinated provision of services with stochastic outcomes. This is all captured within a service-choreography protocol, by which agents can request future service provisions and receive probabilistic temporal service promises in return, converging on coordinated decisions about how and when to work together. We hypothesise that our approach can scalably converge on good coordination solutions because it partially decouples the problems of negotiating service interactions and computing service policies. Our empirical evaluation provides initial confirmation of this hypothesis, demonstrating the scalability and effectiveness of our approach in producing coordinated, approximately optimal agent policies in a small fraction of the time that an optimal approach requires.
A New Analytical Model for Slotted IEEE 802.15.4 Medium Access Control Protocol in Sensor Networks
Authors: Jianliang Gao, Jia Hu, Geyong Min
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

The IEEE 802.15.4 standard is uniquely designed to meet the requirements of the low data-rate, low power-consumption applications in the Low Rate Wireless Personal Areas Network (LR-WPAN) with a focus on enabling wireless sensor network applications. Recently, analytical modelling of IEEE 802.15.4 contention-based Medium Access Control (MAC) protocol has received significant research efforts. However, the development of existing models has been mainly based on the use of the bi-dimensional Markov chain. Different from the previous work, this paper presents a new model which adopts the analysis of the average backoff period length rather than the bi-dimensional Markov chain to derive the sensing probability. Using the proposed model, we investigate the impact of the backoff exponent, frame size and number of stations on the performance metrics including sensing failure probability and saturation throughput.
Complexity threshold in RNA-world: computational modeling of criticality in galton-watson process
Authors: Krzysztof A. Cyran
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

Theory of RNA-World describes the early stage of the evolution of Life and assumes the existence of RNA-species in which RNA constitutes genetic material and enzymes. The RNA enzymes, called rybozymes, are required for metabolism and for self-replication with low error-rate. In particular one hypothetical rybozyme called RNA replicase is crucial in the early phase of RNA-World, since it can reduce the mutation rate and thus allow for development of longer genomes. Yet the length of RNA replicase itself is limited, because in the phase of evolution proceeding the "invention" of this rybozyme the replication could not take the advantage of the low mutation rate. Therefore, RNA replicase would have never been able to evolve if its function appeared only in long RNA chains. In the paper there is considered the problem by application of Demetrius/Kimmel model of criticality in branching processes. The novelty of the paper is the introduction into the mentioned model the parameters which can be experimentally measured in a test tube. Therefore the estimations of the complexity threshold of the early RNA-based RNA replicase can be determined using data from biochemical experiments.
Adobe RoboHelp 6 HTML, Essentials of
Authors: Kevin A. Siegel
Venue:  (2007)

RoboHelp is the industry standard for Help authoring. It's the preferred program if you are a Help author, technical writer, or programmer tasked with creating Help systems for desktop or Web-based applications. This easy-to-use tutorial that will have you creating your own Help systems (complete with topics, books, links, tables, forms, glossaries, frames, skins, templates, DHTML, cascading style sheets and more) within three days. Lessons Include: Create a WebHelp Project | Import an HTML File | Import a Word Document | Rename Topic Titles | Create Project Folders | Auto-create a TOC | Apply a Style Sheet to a Topic | Apply Styles to Selected Paragraphs | Create a New Style Sheet | Create a Font Set | Use Inline Styles | Spell Check | Use Multi-File Find and Replace | Generate 508 and W3C Compliant WebHelp That's Not All... There's Also Lessons On: Insert and Edit Hyperlinks | Import a PDF Document | Add Popups | Create Custom-Sized Popups | Use Link View | Resolve Broken Links | Add Graphics to a Help Project | Change Image Margins | Rename an Image | Add a Background Image | Add Hotspots to a Graphic | Add Sound to a Topic | Import and Format Topics | Import an Adobe Captivate Demo | Use RoboScreenCapture to Pull a Screen Shot | Create Conditional Build Tags | Define a Build Tag Expression | Create a User Defined Variable | Insert and Edit a User Defined Variable | Insert a Table | Format a Table | Add a Horizontal Line | Insert a Symbol | Add a Bulleted List | Format a Heading with a Fade in DHTML Effect | Apply Fly in DHTML Effects | Work with Positioned Text Boxes | Create a Trigger Tired Yet? Hold on, there's more: Create Indexes | Create a See Also Keyword | Add a Link Control to a Topic | Add Glossary Terms | Generate a Report | Generate Printed Documentation | Generate a PDF | Create Forms| Create Frames | Create Skins and Templates | Publish a Project | Create Context Sensitive Help and more...
Investigating design choices between Bitmap index and B-tree index for a large data warehouse system
Authors: Morteza Zaker, Somnuk Phon-Amnuaisuk, Su-Cheng Haw
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

Building indexes on database is common, but it has an important impact on the query performance, especially in large databases such as a Data Warehouse where the queries are usually very complex and ad hoc. If a proper index structure is chosen, the query response time can be accelerated. Until now, there is no definite guideline for Data Warehouse analysts to choose the appropriate index. According to conventional wisdom, Bitmap index is a preferred indexing technique for cases where the indexed attributes have few distinct values (i.e., low cardinality). The query response time is expected to degrade as the cardinality of indexed columns increase due to a larger index size. On the other hand, B-tree index is good if the column values are of high cardinality due to its indexing and retrieving mechanisms. In this paper, we show that this may not be true under certain circumstances. Experimental results support the fact that even though the level of column cardinality determines the index file size, but the query processing time is not determined by the level of column cardinality. Moreover, our results indicate that the Bitmap index is faster than B-tree index on a large dataset with multi-billion records.
Focus group interview for designing a growing robot
Authors: Ryoung Kim, Sona S. Kwak, Youn-kyung Lim, Myung-suk Kim
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

This study describes preliminary research for designing a growing robot. To explore the interaction between a human and an object that changes physically through its growth, focus group interviews were conducted with participants who kept pets, plants, and a plant-like product. An appropriate target model for designing a growing robot, the value of raising living things, and the features of interaction that induce affinity were examined.
Topology Tomography in Wireless Sensor Networks Based on Data Aggregation
Authors: Yu Yang, Yongjun Xu, Xiaowei Li
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Wireless sensor networks need energy-efficient mechanisms to measure topology for various aspects of network management, such as resource scheduling, performance evaluation and optimization. In this paper, we take into account the unique data aggregation communication paradigm of sensor networks: the sink node can infer the topology by exploiting whether data from various sensor nodes are received, without incurring any additional burden on the network. Then we present a practical algorithm for topology measurement based on network tomography technology that exploits the monotonicity of end-to-end loss with increasing path length. Finally, we validate the algorithm through simulations and it exhibits good performance and scalability.
Third-order Energy Stable WENO scheme
Authors: Nail K. Yamaleev, Mark H. Carpenter
Venue: Journal of Computational Physics (2009)

A new third-order Energy Stable Weighted Essentially Non-Oscillatory (ESWENO) finite difference scheme for scalar and vector hyperbolic equations with piecewise continuous initial conditions is developed. The new scheme is proven to be linearly stable in the energy norm for both continuous and discontinuous solutions. In contrast to the existing high-resolution shock-capturing schemes, no assumption that the reconstruction should be total variation bounded (TVB) is explicitly required to prove stability of the new scheme. We also present new weight functions which drastically improve the accuracy of the third-order ESWENO scheme. Based on a truncation error analysis, we show that the ESWENO scheme is design-order accurate for smooth solutions with any number of vanishing derivatives, if its tuning parameters satisfy certain constraints. Numerical results show that the new ESWENO scheme is stable and significantly outperforms the conventional third-order WENO scheme of Jiang and Shu in terms of accuracy, while providing essentially non-oscillatory solutions near strong discontinuities.
Special Thanks to CiSE's Peer Reviewers
Venue: Computing in Science and Engineering (2009)

Computing in Science Engineering delivers high-quality peer-reviewed articles only through the efforts of our volunteers. Although individual reviews are performed confidentially, we would like to take the opportunity to publicly thank our 2008 reviewers for their gracious efforts.
A simple local 3-approximation algorithm for vertex cover
Authors: Valentin Polishchuk, Jukka Suomela
Venue: Information Processing Letters (2009)

We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxiliary information besides port numbering is required.
An evaluation of multiple communication interfaces for virtualized SMP clusters
Authors: Muhammad Atif, Peter Strazdins
Venue: Proceedings of the 3rd ACM Workshop on System-level Virtualization for High Performance Computing (2009)

Clusters with multiple CPU nodes are becoming increasingly popular due to their cost/performance ratio. Due to its many potential advantages, interest in using virtualization on these systems has also increased. Although several studies on the applicability of Xen for high performance computing have been made, most overlook the issue of multiple network interfaces. In this paper, we present an update to the state of art of Xen and give a comprehensive performance evaluation of the various network configurations that can be implemented using multiple gigabit ethernet (GigE) interfaces. We introduce new Xen network configurations, which enable the Xen guests to efficiently utilize the available network infrastructure compared to the default Xen network configurations. The evaluation of these configurations show 10--50% improvement in the NAS Parallel Benchmark suite compared to the default configurations. For these new configuration on multiple SMP nodes, the results also indicate that the need for fast intra-domain communication mechanisms is not compelling. We also detail the MPI implementations in the case of multiple GigE interfaces and their impact on a virtualized environment.
Advanced separation of concerns in agent-oriented design patterns
Authors: Carla Silva, Jaelson Castro, Joao Araujo, Ana Moreira, Patricia Tedesco, John Mylopoulos
Venue: International Journal of Agent-Oriented Software Engineering (2009)

Social patterns are agent-oriented design patterns that have been conceived to reflect the social and intentional features that are recurrent in cooperative and Multi-Agent Systems (MAS). The goal of this paper is to present a social pattern description technique called Agent Pattern Specification (APS), which takes into account the separation of pattern-related concerns in the MAS design level. We also use aspect-oriented programming to separate pattern-specific concerns in the MAS implementation level and evaluate it by using a suite of metrics for assessing well-known software engineering attributes such as the separation of concerns, coupling, cohesion and size. Our assessment suggests that the aspect-oriented solutions for mediation patterns improve the separation of pattern-related concerns.
SUBSMELL: Multimedia with a Simple Olfactory Display
Authors: Chomtip Pornpanomchai, Arinchaya Threekhunprapa, Krit Pongrasamiroj, Phichate Sukklay
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

The idea of adding the SubSmell logo to the movie for describing the scent of each event in the movie has been proposed to improve the current way of seeing movies, which can perceive only pictures and sound. Using the SubSmell, the audience can smell the movie. The audiences need a SubSmell application to read a SubSmell and an olfactory display in order to release scent.There are two main parts in SubSmell system, which are an olfactory display and a SubSmell application. An olfactory display consists of a control box and four smell boxes with four fans. Fans will be turned on and release scents when receiving the signal from a SubSmell application. A SubSmell application is designed to read a SubSmell in the movie and decide to send signals to an olfactory display. A SubSmell application consists of four major components: 1) Movie Controlling, 2) SubSmell Reading, 3) Scent Releasing and 4) Olfactory Display Monitoring. We use Microsoft Visual Basic 6.0 to develop the user interface and the SubSmell components.The experiment was done in order to assess the following qualities: 1) Usability: to prove that the system can read a SubSmell in the movie and release scent. 2) Efficiency: to show that the system can work with high accuracy.