ppxscal/embedding_network huggingface dataset:
Using RFID technology in produce traceability
Authors: Ruey-Shun Chen, C-C Chen, K. C. Yeh, Y-C Chen, C-W Kuo
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

In recent years, food safety events occur because of epizooty. Many countries build food traceability systems to solve these problems. However, the current food traceability system must be executed by paper work and need a lot of manpower. It also cannot trace and track back the origin and destination of food. Due to the fact that RFID technology can trace object, therefore, it can solve these problems. The research method integrates RFID technologies on the food produce traceability system. Using RFID technology will be easy to trace each object, not only for the goods lots. RFID technology can also record all events automatically and acquire the information about the food production by handhold devices. The research result of this paper is providing an integrated tactility system for the entire food supply chain by RFID technology. The benefit of this research can trace the food production, and let consumers get the complete food production information to choose and buy the safety food.
Observability of a model of (q, r)-D continuous-discrete systems
Authors: Valeriu Prepelita
Venue: Proceedings of the 4th WSEAS/IASME international conference on Dynamical systems and control (2008)

A class of multidimensional control systems is studied from the point of view of the property of observability. The states, the inputs and the outputs of the considered multidimensional systems are vector functions depending on q continuous time variables and on r discrete ones, q, r ≥ 1. A variation-of-parameters type formula is established for an appropriate multidimensional partial differential-difference equation. This formula is used to obtain the expressions of the state and of the input-output map of the system. The concept of observability is analysed for this class of systems. The observability criteria from 1D linear systems are generalized to this framework. A suitable observability Gramian is defined, whose full rank characterizes the completely observable time-variable linear systems. A formula is given for determining the initial state by knowing the input and the corresponding output in the case of completely observable systems. Ten necessary and sufficient conditions of complete observability are derived for time-invariant systems and some geometric characterizations of the subspace of unobservable states are obtained.
Risk identification by physicians and developers - differences investigated in a controlled experiment
Authors: Christin Lindholm, Martin Host
Venue: Proceedings of the 2009 ICSE Workshop on Software Engineering in Health Care (2009)

Risk management is an important process and risk identification is an important part of this process, especially in development of medical software. This paper presents an experiment where physicians, developers and software developers for medical devices are asked to identify risk in a given scenario describing the procurement of a patient monitoring system. It is concluded that multiple roles and thereby different experiences, will affect the risk identification process. Involving multiple roles, for example users and developers in the risk identification process, will result in a more complete set of identified risks than if only one role is included in the process.
Internet banking services and fees: the case of Greece
Authors: Georgia Giordani, Christos Floros, Guy Judge
Venue: International Journal of Electronic Finance (2009)

In this paper, we examine the internet banking services that Greek commercial banks are offering. We also present the associated costs and fees that customers face when using these services. The findings show that there are disparities in the fees that Greek commercial banks impose on their customers for performing banking transactions over the internet. When we compare Automated Teller Machine (ATM) fees with branch fees, we find that ATM charges are lower than branch fees. Finally, we conclude that internet banking fees are lower than both ATM fees and branch fees.
Towards a novel content organisation in agriculture using semantic technologies: a study with topic maps as a tool
Authors: Shelly Patwar, Pritpal Kaur, Asil Gerard Sylvester, Venkataraman Balaji
Venue: International Journal of Metadata, Semantics and Ontologies (2009)

Agricultural information management needs to be responsive to the needs of varied stakeholders, and content repurposing to suit multiple audiences is a key requirement. A framework that combines the semantic web techniques of Topic Maps (TM) and a global agricultural thesaurus, the FAO AGROVOC, has been developed on a pilot basis for five crops. The framework when overlaid on a web-based collection of information objects reveals interesting possibilities, especially in presenting the repository content in noticeably different ways to a subject-matter specialist or to an extension worker. Results are discussed and opportunities for further development are briefly described.
DEVS/SOA: A Cross-Platform Framework for Net-centric Modeling and Simulation in DEVS Unified Process
Authors: Saurabh Mittal, José L. Risco-Martín, Bernard P. Zeigler
Venue: Simulation (2009)

Discrete Event Specification (DEVS) environments are implemented over middleware systems such as HLA, RMI, CORBA and others. DEVS exhibits concepts of systems theory and modeling and supports capturing the system behavior from the physical and behavioral perspectives. Further, they are implemented using object-oriented languages like Java and C++. This research work uses the Java platform to implement DEVS over a Service Oriented Architecture (SOA) framework. Called the DEVS/SOA, the framework supports a development and testing environment known as DEVS Unified Process that is built on a model continuity-based lifecycle methodology. DEVS Unified Process allows DEVS-based Modeling and Simulation (M&S) over net-centric platforms using DEVS/SOA. This framework also provides the crucial feature of run-time composability of coupled systems using SOA. We describe the architecture and designs of the server and the client. The client application communicates with multiple servers hosting DEVS simulation services. These simulation services are developed using the proposed symmetrical services architecture wherein the server can act as both a service provider and a service consumer contrary to the unidirectional clientâserver paradigm. We also discuss how this services-based architecture provides solutions for cross-platform distributed M&S. We demonstrate the DEVS/SOA framework with a scenario of Joint Close Air Support specified in Business Process Modeling Notation (BPMN). We also provide a real-world application of network health monitoring using DEVS/SOA-layered architectural framework.
Secure and incidental distortion tolerant digital signature for image authentication
Authors: Yong-Dong Zhang, Sheng Tang, Jin-Tao Li
Venue: Journal of Computer Science and Technology (2007)

In this paper, a secure and incidental distortion tolerant signature method for image authentication is proposed. The generation of authentication signature is based on Hotelling's T-square Statistic (HTS) via Principal Component Analysis (PCA) of block DCT coefficients. HTS values of all blocks construct a unique and stable "block-edge image", i.e., Structural and Statistical Signature (SSS). The characteristic of SSS is that it is short, and can tolerate content-preserving manipulations while keeping sensitive to content-changing attacks, and locate tampering easily. During signature matching, the Fisher criterion is used to obtain optimal threshold for automatically and universally distinguishing incidental manipulations from malicious attacks. Moreover, the security of SSS is achieved by encryption of the DCT coefficients with chaotic sequences before PCA. Experiments show that the novel method is effective for authentication.
A Novel Fingerprint Matching Algorithm Using Ridge Curvature Feature
Authors: Peng Li, Xin Yang, Qi Su, Yangyang Zhang, Jie Tian
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

Fingerprint matching based on solely minutiae feature ignore the abundant ridge information in fingerprint images. We propose a novel fingerprint matching algorithm which integrates minutiae feature with ridge curvature map(RCM). The RCM is approximated by a polynomial model which is computed by Least Square(LS) method. In the matching stage, phase-only correlation matching method is employed to match two RCMs. Then sum fusion rule is selected to combine the minutiae matching score and the RCM matching score. Experiments conducted on FVC2002 and FVC2004 databases show that proposed algorithm can obtain more promising performance than solely minutiae-based algorithm and several other multi-feature fusion algorithms.
Data mining-based materialized view and index selection in data warehouses
Authors: Kamel Aouiche, Jérôme Darmont
Venue: Journal of Intelligent Information Systems (2009)

Materialized views and indexes are physical structures for accelerating data access that are casually used in data warehouses. However, these data structures generate some maintenance overhead. They also share the same storage space. Most existing studies about materialized view and index selection consider these structures separately. In this paper, we adopt the opposite stance and couple materialized view and index selection to take view---index interactions into account and achieve efficient storage space sharing. Candidate materialized views and indexes are selected through a data mining process. We also exploit cost models that evaluate the respective benefit of indexing and view materialization, and help select a relevant configuration of indexes and materialized views among the candidates. Experimental results show that our strategy performs better than an independent selection of materialized views and indexes.
Identifying high perceived value practices of CMMI level 2: An empirical study
Authors: Mahmood Niazi, Muhammad Ali Babar
Venue: Information and Software Technology (2009)

Objective: In this paper, we present findings from an empirical study that was aimed at identifying the relative ''perceived value'' of CMMI level 2 specific practices based on the perceptions and experiences of practitioners of small and medium size companies. The objective of this study is to identify the extent to which a particular CMMI practice is used in order to develop a finer-grained framework, which encompasses the notion of perceived value within specific practices. Method: We used face-to-face questionnaire based survey sessions as the main approach to collecting data from 46 software development practitioners from Malaysia and Vietnam. We asked practitioners to choose and rank CMMI level 2 practices against the five types of assessments (high, medium, low, zero or do not know). From this, we have proposed the notion of 'perceived value' associated with each practice. Results: We have identified three 'requirements management' practices as having a 'high perceived value'. The results also reveal the similarities and differences in the perceptions of Malaysian and Vietnamese practitioners with regard to the relative values of different practices of CMMI level 2 process areas. Conclusions: Small and medium size companies should not be seen as being ''at fault'' for not adopting CMMI - instead the Software Process Improvement (SPI) implementation approaches and its transition mechanisms should be improved. We argue that research into ''tailoring'' existing process capability maturity models may address some of the issues of small and medium size companies.
Intellectual Property Protection for Multimedia Information Technology
Authors: Hideyasu Sasaki, Hideyasu Sasaki
Venue: Premier Reference Source (2007)

Since previously published intellectual property law and business research discusses institutional analyses without interdisciplinary insights by technical experts, and technical references tend to concern engineering solutions without considering the social impact of institutional protection of multimedia digital information, there is a growing demand for a resource that bridges the gap between multimedia intellectual property protection law and technology. Intellectual Property Protection for Multimedia Information Technology provides scholars, management professionals, researchers, and lawyers in the field of multimedia information technology and its institutional practice with thorough coverage of the full range of issues surrounding multimedia intellectual property protection and its proper solutions from institutional, technical, and legal perspectives.
FLORA: a framework for decomposing software architecture to introduce local recovery
Authors: Hasan Sözer, Bedir Tekinerdoğan, Mehmet Akşit
Venue: Software&mdash;Practice Experience (2009)

The decomposition of software architecture into modular units is usually driven by the required quality concerns. In this paper we focus on the impact of local recovery concern on the decomposition of the software system. For achieving local recovery, the system needs to be decomposed into separate units that can be recovered in isolation. However, it appears that this required decomposition for recovery is usually not aligned with the decomposition based on functional concerns. Moreover, introducing local recovery to a software system, while preserving the existing decomposition, is not trivial and requires substantial development and maintenance effort. To reduce this effort we propose a framework that supports the decomposition and implementation of software architecture for local recovery. The framework provides reusable abstractions for defining recoverable units and the necessary coordination and communication protocols for recovery. We discuss our experiences in the application and evaluation of the framework for introducing local recovery to the open-source media player called MPlayer. Copyright &copy; 2009 John Wiley & Sons, Ltd.
Modeling Persuasiveness: change of uncertainty through agents' interactions
Authors: Katarzyna Budzyńska, Magdalena Kacprzak, Paweł Rembelski
Venue: Proceeding of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008 (2008)

The purpose of this paper is to provide a formal model of a persuasion process in which a persuader tries to influence audience's beliefs. We focus on various interactions amongst agents rather than only exchange of arguments by verbal means. Moreover, in our approach the impact of the parties of the dispute on the final result of the persuasion is emphasized. Next, we present how to formalize this model using the modal system $\mathcal{AG}_{n}$ inspired by Logic of Graded Modalities and Algorithmic and Dynamic Logics. We also show how to investigate local and global properties of multi-agent systems which can be expressed in the language of the proposed logic.
A Data-Oriented Coordination Language for Distributed Transportation Applications
Authors: Mahdi Zargayouna, Flavien Balbo, Gérard Scémama
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

Data-oriented coordination languages rely on a shared space in which agents add, read and retrieve data. They are intuitively well suited for distributed transportation applications, where different actors evolve in a highly dynamic and very constrained environment. However, existing coordination languages can hardly be used for transportation applications, because they cannot express agents complex interaction needs. Indeed, in transportation applications, the interaction needs of the agents are driven by their current context and by ambient conditions, expressed in the form of constraints on the values taken by variables. In this paper, we propose Lacios, a new data-oriented coordination language for designing and implementing distributed transportation applications, and we illustrate our proposal with two examples: a traveler information system and a demand-responsive transport system. Lacios allows agents to express complex interaction needs, including agents states, system objects values, operators and functions, and is grounded on a model where the multi-agent system design is centered on the environment.
Outline of Citation Auctions
Authors: Josep Lluis de la Rosa i Esteva
Venue: Proceeding of the 2006 conference on Artificial Intelligence Research and Development (2006)

This paper describes the basis and a forecast of results of citation auctions as a new approach for the refereeing methods most commonly used in the scientific community, based on peer to peer evaluations. Its main idea is to use auctions for publishing papers, where bids consist of the number of citations that a scientist considers the papers will receive. The benefits of the proposed approach will be, first, a reduction of refereeing costs because the process of citations auction does not need of priory understanding of the papers content without loosing quality in contributions, and second, scientists will be much more committed to the quality of papers, focusing much more in networking and detailed explanations of their papers to maximize the number of citations. As a conclusion, this novel approach emphasizes the scientific collaborative work, proactiveness, while reducing the expensive costs of current methods of refereeing and omitting other possible faults like claques and modes. Finally, an analysis of the number of citations collected in papers published in years 1999--2004, developed by google scholar, and a simple simulation of auctions will outline the behavior of the citation auctions approach.
A local multiple alignment method for detection of non-coding RNA sequences
Authors: Yasuo Tabei, Kiyoshi Asai
Venue: Bioinformatics (2009)

Motivation: Non-coding RNAs (ncRNAs) show a unique evolutionary process in which the substitutions of distant bases are correlated in order to conserve the secondary structure of the ncRNA molecule. Therefore, the multiple alignment method for the detection of ncRNAs should take into account both the primary sequence and the secondary structure. Recently, there has been intense focus on multiple alignment investigations for the detection of ncRNAs; however, most of the proposed methods are designed for global multiple alignments. For this reason, these methods are not appropriate to identify locally conserved ncRNAs among genomic sequences. A more efficient local multiple alignment method for the detection of ncRNAs is required. Results: We propose a new local multiple alignment method for the detection of ncRNAs. This method uses a local multiple alignment construction procedure inspired by ProDA, which is a local multiple aligner program for protein sequences with repeated and shuffled elements. To align sequences based on secondary structure information, we propose a new alignment model which incorporates secondary structure features. We define the conditional probability of an alignment via a conditional random field and use a γ-centroid estimator to align sequences. The locally aligned subsequences are clustered into blocks of approximately globally alignable subsequences between pairwise alignments. Finally, these blocks are multiply aligned via MXSCARNA. In benchmark experiments, we demonstrate the high ability of the implemented software, SCARNA_LM, for local multiple alignment for the detection of ncRNAs. Availability: The C++ source code for SCARNA_LM and its experimental datasets are available at http://www.ncrna.org/software/scarna_lm/download. Contact: scarna@m.aist.go.jp Supplementary information:Supplementary data are available at Bioinformatics online.
A Simplified Neural Network for Linear Matrix Inequality Problems
Authors: Long Cheng, Zeng-Guang Hou, Min Tan
Venue: Neural Processing Letters (2009)

A simplified neural network model is proposed to solve a class of linear matrix inequality problems. The stability and solvability of the proposed neural network are analyzed and discussed theoretically. In comparison with the previous neural network models (Lin and Huang, Neural Process Lett 11:153---169, 2000; Lin et al., IEEE Trans Neural Netw 11:1078---1092, 2000), the simplified one is composed of two layers rather than three layers, and the neuron array in each layer is triangular rather than square. The proposed approach can therefore reduce the complexity of the neural network architecture. In addition, the simplified neural network can also be extended to solve multiple linear matrix inequalities with specific constraints, which enlarges the application domain of the proposed approach. Finally, examples are given to illustrate the effectiveness and efficiency of the simplified neural network.
Classwide Computer Supported Reciprocal Peer Tutoring for Fraction Learning
Authors: Yen-Hua Chen, Jen-Hang Wang, Jung-Feng Wu, Yang-Ming Ku, Tak-Wai Chan
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

Fraction learning is a challenging learning task for elementary students. In this study we try to design and construct a classwide computer supported Reciprocal Peer Tutoring (csRPT) system, which is a social collaborative learning system that assists students to be familiar with procedure knowledge and improve practice skill in fraction courses. The csRPT system is building on mobile classroom environment and provides synchronous interaction and feedback functions for students and teachers. csRPT is based on ClassWide Peer Tutoring (CWPT), which is a collaborative learning strategy. It provides social and cognitive learning tools to increase interaction among students and enhance social relationships.
Time series shapelets: a new primitive for data mining
Authors: Lexiang Ye, Eamonn Keogh
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Classification of time series has been attracting great interest over the past decade. Recent empirical evidence has strongly suggested that the simple nearest neighbor algorithm is very difficult to beat for most time series problems. While this may be considered good news, given the simplicity of implementing the nearest neighbor algorithm, there are some negative consequences of this. First, the nearest neighbor algorithm requires storing and searching the entire dataset, resulting in a time and space complexity that limits its applicability, especially on resource-limited sensors. Second, beyond mere classification accuracy, we often wish to gain some insight into the data. In this work we introduce a new time series primitive, time series shapelets, which addresses these limitations. Informally, shapelets are time series subsequences which are in some sense maximally representative of a class. As we shall show with extensive empirical evaluations in diverse domains, algorithms based on the time series shapelet primitives can be interpretable, more accurate and significantly faster than state-of-the-art classifiers.