ppxscal/embedding_network huggingface dataset:
Collective Evolutionary Indexing of Multimedia Objects
Authors: C. H. Leung, W. S. Chan, J. Liu
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

The evolution of multimedia technology and the Internet boost the multimedia sharing and searching activities among social networks. The requirements of semantic multimedia retrieval goes far beyond those provided by the text-based search engines technology. Here, we present an collaborative approach that enables the semantic search of the multimedia objects by the collective discovery and meaningful indexing of their semantic concepts. Through the successive use of our model, semantic concepts can be discovered and incorporated by analyzing the users' search queries, relevance feedback and selection patterns. Eventually, through the growth and evolution of the index hierarchy, the semantic index can be dynamically constructed, validated, and naturally built-up towards the expectation of the social network.
Formal Behavioral Modeling and Compliance Analysis for Service-Oriented Systems
Authors: Natallia Kokash, Farhad Arbab
Venue: Formal Methods for Components and Objects: 7th International Symposium, FMCO 2008, Sophia Antipolis, France, October 21-23, 2008, Revised Lectures (2009)

In this paper, we present a framework for formal modeling and verification of service-based business processes with focus on their compliance to external regulations such as Segregation of Duties (SoD) or privacy protection policies. In our framework, control/data flow is modeled using the exogenous coordination language Reo. Reo process models are designed from scratch or (semi-)automatically obtained from BPMN, UML or WS-BPEL specifications. Constraint automata (CA), a semantic model for Reo, provide state-based representations of process workflows and enable their verification by means of model checking technology. Various extensions of CA make it possible to analyze time-, resource- and Quality-of-Service (QoS) process models.
Supervised clustering via principal component analysis in a retrieval application
Authors: Esteban Garcia-Cuesta, Ines M. Galvan, Antonio J. de Castro
Venue: Proceedings of the Third International Workshop on Knowledge Discovery from Sensor Data (2009)

In regression problems where the number of predictors exceeds the number of observations and the correlation between the predictors is high, a dimensionality reduction or a variable selection approach is demanded. In this paper we deal with a real application where we want to retrieve the physical characteristics of a combustion process from the measurements obtained with a spectroscopic sensor. This application shows up a multicollinearity problem but furthermore it is considered an ill-posed problem. Guided by this application scenario, we propose a clustering approach to find out homogeneous subsets of data which are embedded in arbitrary oriented linear manifold. This model is developed under certain assumptions guided by a priori problem knowledge. The resulting division preserves both, the priori assumptions and the homogeneity in the models. Thereby we break the whole problem in n subproblems improving its individual prediction accuracy versus a global solution. We show the obtained improvements in a real application scenario related with estimating the temperature from spectroscopic data in a remote sensing framework.
On-Demand Chaotic Neural Network for Broadcast Scheduling Problem
Authors: Kushan Ahmadian, Marina Gavrilova
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

An on-demand chaotic noise injection strategy for Broadcast Scheduling Problem (BSP) based on an adjacency matrix is described in this paper. Packet radio networks have many applications especially for military purposes while finding an optimized scheduling to transmit data is proven to be a NP-hard domain problem. The objective of the proposed method is to find an optimal time division multiple access (TDMA) frame based on maximizing channel utilization. The proposed method benefits from an on-demand noise injection policy which, unlike previous Noise Chaotic Neural Networks (NCNN) that suffers from blind injection policy, injects noise based on the status of neuron and its neighborhoods. The experimental result shows that in most cases the on-demand noise injection finds the best solution with minimal average time delays and maximum channel utilization in comparison to previous methods.
Knowledge Visualization - An Approach of Knowledge Transfer and Restructuring in Education
Authors: Zhong Da, Zhang Jianping
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Knowledge visualization is an emerging field of research which developed on the basis of scientific computing visualization, data visualization and information visualization. This paper introduces the definition of knowledge visualization and each format of knowledge visualization. Then this paper brings forward the possibility that knowledge visualization can help solve the problems that knowledge is transferred from teachers to students and be rebuilt by students with knowledge visualization in education. Based on Gupta and Govindarajan (2000), five elements can be for a successful transfer, this paper design some strategieswhich can apply in the process of education to help teachers transfer information to students and students rebuild their own knowledge from the information that their teachers transfer to them, by means of knowledge visualization.
Frequency Allocation Scheme to Maximize Cell Capacity in a Cellular System with Cooperative Relay
Authors: Wooju Lee, Kyongkuk Cho, Dongweon Yoon, Sang Kyu Park, Yeonsoo Jang
Venue: Proceedings of the 9th International Conference on Smart Spaces and Next Generation Wired/Wireless Networking and Second Conference on Smart Spaces (2009)

When deploying the fixed relay stations (RSs) in a cellular system, additional co-channel interferences occur necessarily. To avoid the co-channel interferences, an effective frequency allocation (FA) scheme is essentially required. Cooperative relay can achieve the diversity gain as well as coverage extension of the cellular system. FA schemes with non-cooperative relay have been widely studied, but little research has been done for those with cooperative relay. Since cooperative relay is that RS and base station (BS) simultaneously transmit the same signal using the same time and frequency resources, FA scheme with cooperative relay has different FA patterns compared with that for non-cooperative relay. In this paper, we propose an improved FA scheme with cooperative relay in the system. The proposed scheme can maximize the cell capacity through minimizing co-channel interferences and achieving the cooperative source diversity gain. Through a computer simulation, we demonstrate the proposed FA scheme with cooperative relay can increase average cell, user, and edge user throughputs compared with those for conventional systems under the IEEE 802.16j environment.
Spatial Diversity for Short Range Communication in Home Care Systems Using One Antenna Element
Authors: Markku J. Rossi
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

It is becoming increasingly important for countries like Japan, Finland and Italy to enable as wide as possible home care for their elderly citizens because of the rapidly changing age structure of the population and high hospital costs. Wireless sensors hidden into furnishings ( as a Reference a Finnish on going project ) can provide necessary information for high quality planning of home care visits. The relative positions of the radios are now fixed because of their relations to the furnishings. When conductive or metallic walls, floors or objects are found in the apartment, an antenna can hit a radio fade caused by shadowing or summing up of waves. The Link Quality Indicator of a ZigBee® receiver can vary up to 50 units within short distances because of a floor, compromising the radio range. This paper describes principles of a radio construction which is able to move the antenna element inside the enclosure of the radio unit along an X-shaped path along the major mechanical plane of the radio unit. Two electrical motors dynamically optimise the location of the internal antenna element to fit the current radio propagation environment. The paper also describes the feasibility and cost factors associated with the new structure. The achieved effect is a useful countermeasure against shadowing and multipath in the 2.44 GHz band but provides only a partial solution to the problem in the 868 MHz band, due to space limitations in a typical radio unit.
A Visualization Approach for Group Behaviors, Beliefs and Intentions to Support Critical Decisions
Authors: Colleen L. Phillips, Norman D. Geddes, Justin T. Simms
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

During persistent surveillance of a given population in a conflict situation, data management can quickly become unwieldy due to the inundation of low-level information from many, disparate sources. Computational population models can easily fuse and aggregate information input, but there is still the challenge of providing effective data visualization which minimizes information overload and introduces misinterpretation by simplified visualization based on aggregations. Visualizations of the actionable knowledge to the analyst based on the population effects as evidenced by their stratagemical behaviors are needed. Five model classes that study the beliefs of groups and how their beliefs change as a result of events were evaluated for their potential for visualization based on an analyst's cognitive model of the conflict situation.A visualization approach was developed that can be used for all of the classes of models based on frames of reference for time and physical location within the environment.
Optimal Area Triangulation
Authors: Tzvetalin S. Vassilev
Venue:  (2009)

Triangulations of point sets play an important role in Computational Geometry and have been studied extensively in the last decades. The results on optimizing angles and edge lengths are classical in the field. Here we present a study on optimizing the area in two ways: minimizing the maximum area of a triangle, and maximizing the minimum area of a triangle. In the case of a point set in convex position we present nearly quadratic algorithms for both problems. The geometric properties of these two optimal triangulations are derived and extensively discussed. We strongly believe that both problems admit no worse than quadratic solution. Such will be based on a refinement of the geometric properties. Furthermore, the properties and the methods described here can serve as a starting point to obtaining efficient optimal triangulation algorithms for other quality measures such as maximizing inradius or aspect ratio of a triangle. In the case of a point set in general position, we present a polynomial time approximation algorithm. The algorithm is based on the matching properties of triangulations and further geometric considerations.
On the challenge and design of transport protocols for MMORPGs
Authors: Chen-Chi Wu, Kuan-Ta Chen, Chih-Ming Chen, Polly Huang, Chin-Laung Lei
Venue: Multimedia Tools and Applications (2009)

Although MMORPGs are becoming increasingly popular as well as a highly profitable Internet business, there is still a fundamental design question: Which transport protocol should be used--TCP, UDP, or some other protocol? In this paper, we first evaluate whether TCP is suitable for MMORPGs, and then propose some novel transport strategies for this genre of games. Our analysis of a trace collected from a TCP-based MMORPG called ShenZhou Online indicates that TCP is unwieldy and inappropriate for MMORPGs. We find that the degraded network performance problems are due to the following characteristics of MMORPG traffic: 1) tiny packets, 2) a low packet rate, 3) application-limited traffic generation, and 4) bi-directional traffic. Since not all game packets require reliable transmission or in-order delivery, transmitting all packets with a strict delivery guarantee causes high delays and delay jitters. Therefore, our proposed transport strategies assign game packets with appropriate levels of transmission guarantee depending on the requirements of the packets' contents. To compare the performance of our approach with that of existing transport protocols, we conduct network simulations with a real-life game trace from Angel's Love. The results demonstrate that our strategies significantly reduce the end-to-end delay and delay jitter of packet delivery. Finally, we show that our strategies effectively raise satisfaction levels of the game players.
Effectiveness of the Text Display in Bilingual Presentation of JSL/JT for Emergency Information
Authors: Shunichi Yonemura, Shin-Ichiro Eitoku, Kazuo Kamata
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

This paper describes an experiment on the message transmission effectiveness achieved by adding Japanese text (JT) to a Japanese sign language (JSL) video. The transmission efficiency of information and the understanding of information are quantitatively measured. The situation assumed is that information about a vehicle accident is to be displayed in a railroad carriage to deaf people. Three information methods are examined JT, JSL, and JT+JSL. We show that JT and JT+JSL yield high correct answer rates; JSL yields low rates. Furthermore, the subjects' impressions of the three methods show that they responded favorably to JT.
Fast Embedding Technique for Dirty Paper Trellis Watermarking
Authors: Marc Chaumont
Venue: Proceedings of the 8th International Workshop on Digital Watermarking (2009)

This paper deals with the improvement of the Dirty Paper Trellis Code (DPTC) watermarking algorithm. This watermarking algorithm is known to be one of the best among the high rate watermarking schemes. Nevertheless, recent researches reveal its security weakness. Previously, we proposed to reinforce its security by using a secret space before the embedding. This secret space requires to compute projections onto secrets carriers. When dealing with high rate watermarking, the CPU cost for those projections is dramatically high. After introducing the watermarking scheme, we then propose two Space Division Multiplexing (SDM) approaches which reduce the complexity. Evaluations are achieved with four different attacks and show that our proposal gives better robustness results with SDM approaches. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Media Impact: Games in the Classroom: Using Games as a Motivator for the Study of Computing: Part 2
Authors: Andrew M. Phelps, Christopher A. Egert, Jessica D. Bayliss
Venue: IEEE MultiMedia (2009)

Editor's NoteIt's no secret that undergraduate computer science enrollment, which has suffered through one of its periodic downturns, seems to have bottomed out but is now on an upswing. This cyclic behavior has been occurring for many years now, producing many exciting ideas concerning how to revamp introductory computer science courses to make them more exciting and relevant, and to show beginning students that computer science entails more than just programming. Georgia Tech, one of the active participants in this revamp, has developed the concept of threads (a means to connect chunks of related knowledge across different courses) and is devising techniques to enrich beginning courses using minirobots and multimedia. The present article, the second of two parts, written by Andrew Phelps and his group at the Rochester Institute of Technology, describes a parallel effort to use gaming as a way to improve learning and to demonstrate to students that computer science is indeed exciting and cool.&#x2014;William I. Grosky
Evaluation of Online Resources in Assisting Phishing Detection
Authors: Kaigui Bian, Jung-Min ''Jerry'' Park, Michael S. Hsiao, France Belanger, Janine Hiller
Venue: Proceedings of the 2009 Ninth Annual International Symposium on Applications and the Internet (2009)

Phishing is an attempt to fraudulently acquire users’ sensitive information, such as passwords or financial information, by masquerading as a trustworthy entity in online transactions. Recently, a number of researchers have proposed using external online resources like the Google Page Rank system to assist phishing detection. The advantage of such an approach is that the detection capability will gradually evolve and improve as the online resources become more sophisticated and manipulation-resistant. In this paper, we evaluate the effectiveness of three popular online resources in detecting phishing sites—viz, Google PageRank system, Yahoo! Inlink data, and Yahoo! directory service. Our results indicate that these online resources can be used to increase the accuracy of phishing site detection when used in conjunction with existing phishing countermeasures. The proposed approach involves examining the following three attributes of a target site (site being examined): (1) the credibility of the target site’s hosting domain, (2) the credibility of in-neighbor sites that link to the hosting domain, and (3) the correlation between the target site’s web category and its hosting domain’s web category. The aforementioned online resources by themselves are insufficient to address the phishing attack problem. We provide discussions on how each of those resources may be integrated with existing phishing detection techniques to provide a more effective solution.
An interview with Hans-Paul Schwefel: with an introduction by G&uuml;nter Rudolph
Authors: Hans-Paul Schwefel
Venue: ACM SIGEVOlution (2008)

The sounds of Sputnik from its orbit around the earth in 1957 were the origin of the young Hans-Paul Schwefel's desire to become a space traveller. In thoughtful preparation he soon began his studies in Aero- and Space Technology at the Technical University Berlin (TUB). But while he was junior assistant at the Hermann-F&ouml;ttinger Institute for Hydrodynamics at TUB another event changed his plans: In the 1960s difficult multimodal and noisy optimization problems from engineering sciences awaited their solution at the TUB. At that time mathematical models or numerical simulations of these particular problems were not available. As a consequence, the optimization had to be done experimentally with the real object at hardware level. The three students Peter Bienert, Ingo Rechenberg and Hans-Paul Schwefel (HPS) envisioned an automated cybernetic system that alters the object parameters mechanically or electrically, runs the experiment, measures the outcome of the experiment and uses this information in the context of some optimization strategy for the decision how to alter the object parameters of the real object for the experiment in the subsequent iteration. Obvious candidates for the optimization methods in the framework of this early 'hardware-in-the-loop' approach were all kinds of gradient-like descent methods for minimization tasks. But these methods failed. Inspired by lectures on biological evolution they tried a randomized method that may be regarded as the simplest algorithm driven by mutation and selection---a method nowadays known as the (1+1)-Evolution Strategy. This approach was successful and this event may be seen as the trigger that turned the career of HPS towards the emerging scientific field of evolutionary computation (EC).
Classification of Protein Interaction Sentences via Gaussian Processes
Authors: Tamara Polajnar, Simon Rogers, Mark Girolami
Venue: Proceedings of the 4th IAPR International Conference on Pattern Recognition in Bioinformatics (2009)

The increase in the availability of protein interaction studies in textual format coupled with the demand for easier access to the key results has lead to a need for text mining solutions. In the text processing pipeline, classification is a key step for extraction of small sections of relevant text. Consequently, for the task of locating protein-protein interaction sentences, we examine the use of a classifier which has rarely been applied to text, the Gaussian processes (GPs). GPs are a non-parametric probabilistic analogue to the more popular support vector machines (SVMs). We find that GPs outperform the SVM and naïve Bayes classifiers on binary sentence data, whilst showing equivalent performance on abstract and multiclass sentence corpora. In addition, the lack of the margin parameter, which requires costly tuning, along with the principled multiclass extensions enabled by the probabilistic framework make GPs an appealing alternative worth of further adoption.
Research of BBS Based on Text Mining Techniques
Authors: Weijie Wu, Weitong Huang, Shiqiang Yang, Luxiong Xu
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

BBS, which is constructed in internet for providing public information to people, is one type of electric information system and social network. It also has the functions of sending message, email service etc. In this paper, we focus on the relations among users, boards and posts, especially by analyzing and mining history data. We have downloaded great deals of data from one forum, named New SMTH, and then created efficient database and dataset for further research. We have accomplished the identical topic mining and association of boards based on the data handled. After a series analysis and mining, several associations among boards, which provided well foundation for the further research, are discovered.
Experience on knowledge-based software engineering: A logic-based requirements language and its industrial applications
Authors: Jeffrey J. P. Tsai, Alan Liu
Venue: Journal of Systems and Software (2009)

A formal requirements specification language plays an important role in software development. Not only can such language be used for stating requirements specification, but also can be used in many phases of software development life cycle. The FRORL project started from constructing a language with a solid logical foundation and further expanded to research in verification, validation, requirements analysis, debugging, and transformation. Research in this project aided in some industrial applications in which a code generation tool produced software for embedded systems. This article reports the experiences gained from this project and states the value of research in knowledge-based software engineering.
Triangular approximations of fuzzy numbers using &#x03b1;-weighted valuations
Authors: S. Abbasbandy, E. Ahmady, N. Ahmady
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

In this paper, a fuzzy triangular approximation using &#x03b1;-weighted valuations is introduced and the nearest approximation by the minimization technique is obtained, such that the computational complexity is less than that in Abbasbandy and Amirfakhrian 2006. Moreover, we investigate some reasonable properties of the &#x03b1;-weighted triangular approximation.
A domain-specific language for manipulation of binary data in Dylan
Authors: Hannes Mehnert, Andreas Bogk
Venue: Proceedings of the 2007 International Lisp Conference (2007)

We present a domain specific language for manipulation of binary data, or structured byte sequences, as they appear in everyday applications such as networking or graphics file manipulation. Our DSL is implemented as an extension of the Dylan language, making use of the macro facility. Dylan macros, unlike Common Lisp macros, are implemented as pattern matches and substitutions on the parse tree, and we will show the strengths and limits of this approach for the given problem.