ppxscal/embedding_network huggingface dataset:
A case study of an empirical approach to component requirements in developing a plagiarism detection tool
Authors: Noriko Hanakawa, Mike Barker
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

Extracting requirements for large-scale software development has become increasingly complicated because many users from different organizations should collaborate with each other. Although use cases and UML diagrams for analyzing requirements are powerful tools, users often have difficulty understanding them. Therefore, we tried to extract detailed requirements via an empirical approach when we developed a plagiarism detection tool for students' reports. Key points of this approach are recording empirical data in an experiment and using an incomplete prototype based on component requirements. By comparing empirical data with output of the incomplete prototype, the detailed requirements are incrementally determined without additional efforts by the users. As a result of this approach, accuracy of the detection tool's output has reached 71%. In addition, we propose a framework for applying an empirical approach to requirements to adapt this approach to various developments.
From pushing buttons to play and progress: value and interaction in fable
Authors: Pippin Barr, James Noble, Robert Biddle, Rilla Khaled
Venue: Proceedings of the 7th Australasian User interface conference - Volume 50 (2006)

A value can be understood as a belief that one mode of conduct is preferable to others. The user-interface of computer games mediates all player conduct in the game and is therefore key to understanding how values are expressed both by and to the player. How the interface affects player's expression and understanding of value in computer games is a relatively unknown quantity. We performed a qualitative case study of the game Fable to investigate connections between interface and value in gameplay. The concepts uncovered allow us to better address the computer game interface in both design and analysis.
HMM-based music retrieval using stereophonic feature information and framelength adaptation
Authors: B. Schuller, G. Rigoll, M. Lang
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Music retrieval methods are in the focus of recent interest due to the increasing size of music databases as e.g. in the Internet. Among different query methods content-based media retrieval analyzing intrinsic characteristics of the source seems to form the most intuitive access. The key-melody in a song can be regarded as the major characteristic in music and leads to a query by humming or singing. In this paper we turn our attention to both, the features and the algorithm of matching in audio music retrieval. Nowadays approaches propagate the use of dynamic time warping for the matching process. As reference mostly midi-data or humming itself is used. However, first attempts matching humming to polyphonic audio exist. In this contribution we introduce hidden Markov models as an alternative for humming queries matching humming itself, mobile phone ring tones and polyphonic audio. The second object of our research is the introduction of a new way of melody enhancement prior to a latter feature extraction by use of stereophonic information. Further an adaptation throughout the extraction process of the frame length to the tempo of a musical piece helps improving similarity matching performance. The paper addresses the design of a working recognition engine and results achieved with respect to the alluded methods. A test database consisting of polyphonic audio clips, ring tones, and sung user data is described in detail.
Event-based home photo retrieval
Authors: Joo-Hwee Lim, P. Mulhem, Qi Tian
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

With rapid advances in sensor, storage, processor, and communication technologies, consumers can now afford to create, store, process, and share large digital photo collections. With more and more digital photos accumulated, consumers need effective and efficient tools to organize and access photos in a semantically meaningful way without too much manual annotation effort. From user studies, we confirm that users prefer to organize and access photos along semantic axes such as event, people, time, and place. In this paper, we propose a computational learning framework to construct event models from sample photos with event labels given by a user and to compute relevance measures of unlabeled photos to the event models. We demonstrate event-based retrieval on 2400 genuine home photos using our proposed approach.
Acquisition of spatial knowledge in location aware mobile pedestrian navigation systems
Authors: Ilhan Aslan, Maximilian Schwalm, Jörg Baus, Antonio Krüger, Tim Schwartz
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

In this paper we regard the navigation aid provided by mobile navigation systems in a real environment and the effects of these mobile assistants to the development of spatial knowledge. Therefore, we report on a user study concerning the acquisition of spatial knowledge. This study sets up on a former study described by Krüger and colleagues and sheds light on problems concerning the acquisition of survey knowledge while being navigated by a mobile handheld PC.
Implementing e-Learning for the Media Industry: A Case Study of a Small-Sized Advertising Company in Taiwan
Authors: Tuan-Ni Lien, Shelley Shwu-Ching Young
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This paper intends to discuss the transformation of the digitalized design process which moves from an entirely manual to a digital workflow in the advertising media industry, and focus on how e-Learning can optimize this transition by using a flexible and inexpensive approach without a costly LMS. In this case study, the researchers explore how e-Learning has helped MACIS - the first print advertising company with fully electronic process systems in Taiwan, and induce 4 phases of implementing corporate e-Learning based on the preliminary data collection. In the future, more empirical data should be collected for the further studies.
Self coupled harmonics: stationary and cyclostationary approaches
Authors: Guotong Zhou, G. B. Giannakis
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

Self coupled harmonics offer a practical means for testing for the presence of nonlinearities. A computationally attractive method to detect frequency and phase coupling is derived based on a slice of the Fourier series moment polyspectrum, and is capable of handling constant amplitude harmonics as well as harmonics observed in additive and nonzero mean multiplicative noise. The zero-mean case is addressed using cyclic statistics, and contrary to existing approaches, both methods rely on a single record of data and do not assume the additive noise to be Gaussian.
A middleware for fast and flexible sensor network deployment
Authors: Karl Aberer, Manfred Hauswirth, Ali Salehi
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

A key problem in current sensor network technology is the heterogeneity of the available software and hardware platforms which makes deployment and application development a tedious and time consuming task. To minimize the unnecessary and repetitive implementation of identical functionalities for different platforms, we present our Global Sensor Networks (GSN) middleware which supports the flexible integration and discovery of sensor networks and sensor data, enables fast deployment and addition of new platforms, provides distributed querying, filtering, and combination of sensor data, and supports the dynamic adaption of the system configuration during operation. GSN's central concept is the virtual sensor abstraction which enables the user to declaratively specify XML-based deployment descriptors in combination with the possibility to integrate sensor network data through plain SQL queries over local and remote sensor data sources. In this demonstration, we specifically focus on the deployment aspects and allow users to dynamically reconfigure the running system, to add new sensor networks on the fly, and to monitor the effects of the changes via a graphical interface. The GSN implementation is available from http://globalsn.sourceforge.net/.
Pronominal Reference in Sentences about Persons or Things: An Electrophysiological Approach
Authors: Anke Hammer, Bernadette M. Jansma, Monique Lamers, Thomas F. Münte
Venue: Journal of Cognitive Neuroscience (2005)

German pronouns (erMALE/masculine, sieFEMALE/feminine) that refer to a person are determined by the biological gender (MALE/FEMALE) and/or syntactic gender (masculine/feminine) of the person. Pronouns (ermasculine, siefeminine) that refer to a thing are determined by the syntactic gender of this thing (Garten [garden]masculine, Tasche [hand-bag]feminine). The study aimed to investigate whether semantic integration, syntactic integration, or both are involved in establishing co-reference between pronoun and subject/antecedent in sentences. Here we focused on two event-related potential components: the SPS/P600, related to syntactic violation and reanalysis, and the N400 component, related to semantic integration problems. In one condition, a person was introduced as antecedent and later referred to by a pronoun, which either agreed in biological/syntactic gender or not (biological/syntactic gender violation). In a second condition, a thing was introduced as antecedent and the corresponding pronoun either agreed in syntactic gender or not (syntactic gender violation). Results at critical pronouns showed a P600 effect for incongruent compared with congruent pronouns in both conditions with a centro-parietal maximum. This effect was larger for the person compared to the thing condition. We interpreted this finding as reflecting a syntactic integration process that can be influenced by conceptual/semantic and syntactic information of the antecedent type. Furthermore, at the word following the pronoun, we observed an N400 for the thing but not for the person condition. We suggest, supported by the results of a control experiment, that this effect ref lects continuous integration processes for things, whereas for persons the integration seems to be finished at pronoun position.
Web-Based Risk Avoidance Group Decision Support System in Software Project Bidding
Authors: Gang Xie, Jin-long Zhang, Kin Keung Lai
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Web-based risk avoidance group decision support system (RAGDSS) provides a platform for expert group to make risk decisions for software project bidding. In this paper, we study the principle, process, framework and functions of RAGDSS. Finally, we introduce a prototype of RAGDSS based on variable precision rough set (VPRS) model.
Co-Protégé: Collaborative Ontology Building with Divergences
Authors: Alicia Diaz, Guillermo Baldo, Gerome Canals
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

In this paper we present an innovative approach to develop a domain ontology in collaborative fashion. This approach is synthesized in a groupware application which is called Co-Protégé, a set of plug-ins which extends Protégé. This approach is innovative because Co-Protégé enables the coexistence of divergent conceptualizations and the discussion thread in order to record the ontology evolution.
Study on Water Hammer Prevention in Pumping Water Supply Systems by Multi-valves
Authors: Manlin Zhu, Xiaohong Zhang, Yanhe Zhang, Tao Wang
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Air valves are widely used in water supply systems for their simple structure, low cost and easy installation. Many water hammer studies had proved that in order to effectively protecting water hammer, air valve should have both large air inflow area and small outflow area, i.e. the air inflow speed is fast while outflow slow. But research on how to implement that idea can hardly be found. Based on a real pumping water supply system, this paper presented a water hammer protection method using characteristic method of water hammer calculation, and the concept of air valve set proposed. The calculation results show that area ratio between air valve inlet and outlet has great influence on water hammer protection effect, and the ratio has an optimal value. Using both air valve set and butterfly valve two-phase closing procedure can effectively prevent water hammer in pumping water supply systems.
Data Replication and Update Management in Mobile Ad Hoc Networks (Invited Paper)
Authors: Takahiro Hara
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Data replication can drastically improve data accessibility in mobile ad hoc networks (MANETs). In this invited paper, we introduce our recent work that addresses data replication in MANETs, particularly focusing on update management. We explain a few research issues based on both optimistic and pessimistic consistency management policies. We also describe a few prospects for future directions.
Backward coupling in petri nets
Authors: Anne Bouillard, Bruno Gaujal
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

In this paper, we show how to design a perfect sampling algorithm for stochastic Free-Choice Petri nets by backward coupling. For Markovian event graphs, the simulation time can be greatly reduced by using extremal initial states, namely blocking marking, although such nets do not exhibit any natural monotonicity property. Another approach for perfect simulation of non-Markovian event graphs is based on a (max,plus) representation of the system and the theory of (max,plus) stochastic systems. Next, we show how to extend this approach to one-bounded free choice nets to the expense of keeping all states. Finally, experimental runs show that the (max,plus) approach needs a larger simulation time than the Markovian approach.
Using Conflict-Based On-line Learning to Accelerate the Backtrace Algorithm Implemented in HW
Authors: Martin Stava, Ondrej Novak
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

The backtrace algorithm lies at the core of many applications, including automatic test pattern generation (ATPG). This paper describes and evaluates an approach for accelerating the backtrace algorithm using conflict-based on-line learning. This approach gets high performance due to large amounts of fine-grain parallelism in the implication process. Architecture of circuits performing backward determination of all input vectors to a given output one is presented as well. The results of this new method are compared with HW implementation of the basic backtrace algorithm proposed recently. The experimental results have been obtained for the ISCAS'85 benchmarks - for those largest, the average growth of an area overhead is about 49 % and the average speed up is about 25 %.
Visualizing Concept Associations Using Concept Density Maps
Authors: Nees Jan van Eck, Flavius Frasincar, Jan van den Berg
Venue: Proceedings of the conference on Information Visualization (2006)

The concept mapping algorithm proposed in an earlier paper is one of the dimensionality reduction techniques that can be used for knowledge domain visualization. Using this algorithm to visualize large knowledge domains may not always provide a good overview of the domain due to visual cluttering of concepts. In this paper, we propose to apply kernel density estimation to the visualization of concept maps in order to be able to better explore large knowledge domains. Kernel density estimation proves to be useful for the identification of concept clusters at different levels of detail. In addition to the visual exploration of large knowledge domains, we are also able to visually verify the hypothesis that the concept mapping algorithm places related concepts close to each other. The flexibility and effectiveness of our approach is validated by applying the proposed technique to different visualization scenarios for the field of computational intelligence.
About permutation algebras, (pre)sheaves and named sets
Authors: Fabio Gadducci, Marino Miculan, Ugo Montanari
Venue: Higher-Order and Symbolic Computation (2006)

In this paper we survey some well-known approaches proposed as general models for calculi dealing with names (like for example process calculi with name-passing). We focus on (pre)sheaf categories, nominal sets, permutation algebras and named sets, studying the relationships among these models, thus allowing techniques and constructions to be transferred from one model to the other.
Practical Content-Adaptive Subsampling for Image and Video Compression
Authors: Alexander Wong, William Bishop
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

Subsampling is a commonly used technique for modern image and video compression. Existing image and video standards such as JPEG, MPEG, and H.264 provide support for uniform chroma subsampling. This paper presents an algorithm that uses adaptive luma subsampling based on a combination of three perceptually significant image characteristics (texture, edges, and brightness) to complement uniform chroma subsampling. The algorithm is computationally efficient, simple to implement, and easy to integrate into existing standards. Experimental results show that the introduction of adaptive luma subsampling improves image quality both quantitatively and qualitatively when compared with the sole use of uniform chroma subsampling.
A P2P Integration Architecture for Protein Resources
Authors: Kajal T. Claypool, Sanjay Madria
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

The availability of a direct pathway from a primary sequence (denovo or DNA derived) to macromolecular structure to biological function using computer-based tools is the ultimate goal for a protein scientist. Today's state of the art protein resources and on-going research and experiments provide the raw data that can enable protein scientists to achieve at least some steps of this goal. Thus, protein scientists are looking towards taking their benchtop research from the specific to a much broader base of using the large resources of available electronic information. However, currently the burden falls on the scientist to manually interface with each data resource, integrate the required information, and then finally interpret the results. Their discoveries are impeded by the lack of tools that can not only bring integrated information from several known data resources, but also weave in information as it is discovered and brought online by other research groups. We propose a novel peer-to-peer based architecture that allows protein scientists to share resources in the form of data and tools within their community, facilitating ad hoc, decentralized sharing of data. In this paper, we present an overview of this integration architecture and briefly describe the tools that are essential to this framework.
Film-to-Video Conversion with Scene Cut Detection
Authors: Chung-chi Lin, Ming-hwa Sheu, Huann-keng Chiang, Chishyan Liaw, Ming-che Chen
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

A film-to-video conversion technique with scene cut detection is proposed and its performances are examined. Scene cut happens fairly often in film broadcasting and it tends to destabilize the quality of performance while motion compensated interpolation technique is utilized. In the proposed method, the scene cut detection is executed at the first stage of motion compensation of frame-to-video conversion to ensure that the interpolated information can be used correctly. And it utilizes the low computational complexity of frame-to-video conversion technique to promote higher quality video sequences. The simulation results show that the proposed method exhibits better performances than other methods.
Classifying Business Processes for Domain Engineering
Authors: Hafedh Mili, Mohand Frendi, Guitta Bou Jaoude, Louis Martin, Guy Tremblay
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

Enterprises build information systems to support their business processes. Some of those business processes are industry or enterprise-specific, but most are common to many industries and are used, modulo a few modifications, in different contexts. To the extent that we can, i) decompose complex business processes into composable generic sub-processes, ii) develop software components that implement such generic processes, and iii) map process specialization and composition operators to corresponding operators on software components, we will be able to develop information systems by modeling the business processes that they are meant to support, and using such models to guide the assembly of the corresponding software components. This is not a new idea, but earlier attempts suffered from the lack of tools, conceptual and otherwise, to perform this mapping. In this paper, we describe the principles underlying our approach and the status of the current implementation in the Eclipse environment.
Relationship between GF(2^m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms
Authors: Haining Fan, M. Anwar Hasan
Venue: IEEE Transactions on Computers (2006)

Applying the matrix-vector product idea of the Mastrovito multiplier to the GF(2^{m}) Montgomery multiplication algorithm, we present a new parallel multiplier for irreducible trinomials. This multiplier and the corresponding shifted polynomial basis (SPB) multiplier have the same circuit structure for the same set of parameters. Furthermore, by establishing isomorphisms between the Montgomery and the SPB constructions of GF(2^{m}), we show that the Montgomery algorithm can be used to perform the SPB multiplication without any changes and vice versa.
Generating User Interfaces from CDISC ODM for Mobile Devices
Authors: Guido M. de Melo, Jurgen Nagler-Ihlein, Michael Weber
Venue: Proceedings of the International Conference on Mobile Business (2006)

Clinical studies are often conducted as multi-centered studies involving participants at different locations. Thus it becomes obvious that using mobile platforms and remote data entry is beneficial for such studies. When working in a distributed fashion, data exchange standards are required. Bringing these standards to the end user also requires incorporating user interface issues. Considering various device types, from desktop computer to small handheld devices raises the question how user interfaces could be derived from the data exchange standards. In this paper we consider CDISC´s Operational Data Model as a data standard and discuss its relevance in the user interface generation process. Several candidate description languages are explored and embedded into a general transformation process emphasizing especially small and mobile device characteristics.
The Internet Experience: Getting Conceptual about Interface Design
Authors: Jim Miller
Venue: IEEE Internet Computing (2006)

Using iTunes and CD Spin Doctor as examples, the author examines conceptual models and how to use them when designing an application's interface.