ppxscal/embedding_network huggingface dataset:
Derivation of Classes from Use Cases Automatically Generated by a Three-Level Sentence Processing Algorithm
Authors: Reynaldo Giganto, Tony Smith
Venue: Proceedings of the Third International Conference on Systems (2008)

Identification of classes from a requirements specification is one of the most important and difficult tasks during analysis and design of new object-oriented systems. Recent developments in CASE tool research have begun incorporating quite sophisticated natural language processing techniques to help generate class diagrams; however, considerable problems remain in the form of overlooked and/or excess classes. The difficulty stems largely from inherent ambiguity in written language; and a general lack of conciseness and completeness in requirements specifications. We argue that a more effective approach is to obtain classes from use cases, rather than directly from the specification. Our justification is that use cases describe specific functionalities of the system, and therefore the candidate objects involved in effecting those functionalities. To that end, we propose an algorithm to i) extract use case sentences from requirements, ii) validate functional specifications in each sentence of the use cases so that classes can be identified, and iii) reuse previously validated, domain-dependent use cases to supply missing functional specifications that may contain participating classes. Thereafter, classes are automatically obtained from these generated use cases. Problems arising from ambiguity in the written requirements are mitigated by imposing a small number of restrictions on the language that can be used for writing requirements, and the sentence structure of use cases is formalized.
Presence in the IP multimedia subsystem
Authors: Ling Lin, Antonio Liotta
Venue: Mobile Information Systems (2007)

With an ever increasing penetration of Internet Protocol (IP) technologies, the wireless industry is evolving the mobile core network towards all-IP network. The IP Multimedia Subsystem (IMS) is a standardised Next Generation Network (NGN) architectural framework defined by the 3rd Generation Partnership Project (3GPP) to bridge the gap between circuit-switched and packet-switched networks and consolidate both sides into on single all-IP network for all services. In this paper, we provide an insight into the limitation of the presence service, one of the fundamental building blocks of the IMS. Our prototype-based study is unique of its kind and helps identifying the factors which limit the scalability of the current version of the presence service (3GPP TS 23.141 version 7.2.0 Release 7 [1]), which will in turn dramatically limit the performance of advanced IMS services. We argue that the client-server paradigm behind the current IMS architecture does not suite the requirements of the IMS system, which defies the very purpose of its introduction. We finally elaborate on possible avenues for addressing this problem.
A Lower Bound For Probabilistic Algorithms For Finite State Machines
Authors: A. G. Greenberg
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

Freivalds recently reported a construction of a 2-way probabilistic finite automaton M that recognizes the set {a/sup m/b /sup m/ : m /spl ges/ 1} with arbitrarily small probability of error. This result implies that probabilistic machines of this type are more powerful than their deterministic, nondeterministic, and alternating counterparts. Freivalds' construction has a negative feature: the automation M runs in /spl Omega/ (2/sup n/2/n) expected time in the worst case on inputs of length n. We show that it is impossible to do significantly better. Specifically, no 2-way probabilistic finite automaton that runs in n/sup O (1)/ expected time recognizes {a/sup m/b/sup m/ : m /spl ges/ 1} with probability of error bounded away from 1/2. In passing we derive results on the densities of regular sets, the fine structure of Freivalds' construction, and the behavior of random walks controlled by Markov chains.
A refined Jacobi-Davidson method for the quadratic eigenvalue problem
Authors: Zhongxiao Jia, Yuquan Sun
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

This paper presents a refined projection method for quadratic eigenvalue problems and proposes a new extraction method and a correction equation for the quadratic Jacobi-Davidson method. Then it gives rise to a new refined quadratic Jacobi-Davidson method. Preliminary numerical examples illustrate the superiority of the new method.
Comparison of mobile phone user interface design preferences: perspectives from nationality and disability culture
Authors: Ira Jhangiani, Tonya Smith-Jackson
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

This research study explores cross-cultural differences and similarities of user preferences of mobile phone features. Product interactive focus groups were conducted in India and in the United States; groups included users without any apparent disabilities and users with a visual disability of legal blindness. The analysis of the focus group sessions and post-task usability questionnaires provided an insight to the preferences of mobile phone interface components and gave a deeper understanding of the mobile culture in the two countries. These results are summarized to provide guidelines for designing cross-cultural user interfaces which are nationality specific and disability specific. A pyramid model for a holistic process of designing cell phones for users with disabilities is proposed which integrated the findings of this study and Jordan's [1] pleasurability framework
Coverage and latency aware actor placement mechanisms in WSANs
Authors: Kemal Akkaya, Mohamed Younis
Venue: International Journal of Sensor Networks (2008)

In Wireless Sensor and Actor Networks (WSANs), responsiveness to serious events is of utmost importance and thus, minimal latency should be experienced. In addition, since these actions can be taken at any spot within the monitored area, the actors should provide maximal coverage of the area. In this paper, we propose two actor placement mechanisms for WSANs, namely COLA and COCOLA that consider both the delay requirements of data collection and the coverage of the area. COLA evenly distributes the actors in the region for maximised coverage first. Actors then collaboratively form clusters. Each individual actor repositions itself at a new location that enables minimal latency in collecting data in its cluster. COCOLA is an extension to COLA which additionally enforces connectivity among the actors by assigning appropriate locations to each actor for improved coverage and reduced latency. The effectiveness of both approaches is evaluated through extensive simulation experiments.
Folksonomies and science communication: A mash-up of professional science databases and Web 2.0 services
Authors: Wolfgang G. Stock
Venue: Information Services and Use (2007)

Folksonomies complete the methods of indexing scientific documents. Now scientists in their function as readers may play an active role in science communication as well, since they can tag documents with terms taken from their professional or personal environment. Folksonomies allow the indexing of documents by everyone without following any rules. Besides the benefits of folksonomies there are severe problems, e.g. the tags' lack of precision. In order to overcome the shortcomings of this collaborative indexing method we introduce natural language processing of tags and a relevance ranking algorithm which is based on specific tag distributions, on aspects of collaboration and on the actions of the &ldquo;prosumers&rdquo;. This article is a plea for the combination of the &ldquo;old&rdquo; science databases and the benefits of the folksonomies.
Dispatching policy for manufacturing jobs and time-delay plots
Authors: N. Giannelos, N. Papakostas, D. Mourtzis, G. Chryssolouris
Venue: International Journal of Computer Integrated Manufacturing (2007)

In the present paper, the concepts of chaos and nonlinear dynamics are briefly introduced and the tools used in the characterization of a chaotic or nonlinear system are discussed for studying the performance of dispatching policies in manufacturing systems. The scheduling of a simple manufacturing system with the help of common assignment rules has been simulated first. The results are studied and analysed with the help of time-delay plots. Some conclusions are drawn and, based on them, a new method of scheduling is proposed. The method is tested against conventional rules and the results are evaluated and discussed, specifically by addressing practical and generalization issues.
Mobility, Business Process Management, Software Sourcing, and Maturity Model Trends: Propositions for the IS Organization of the Future
Authors: Judy E. Scott
Venue: Information Systems Management (2007)

In this article, I argue that increased mobility, a continued emphasis on business process management, expanded options for the sourcing of enterprise system software, and IS maturity models are trends that will require new capabilities and skills for tomorrow's IS organization.
Use of Heart Rate Variability Analysis for Quantitatively Assessing Operator's Mental Workload
Authors: Jian-Hua Zhang, Xing-Yu Wang, M. Mahfouf, D. A. Linkens
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

In this paper, the autoregressive modeling based spectral analysis method is described and its application to spectral analysis of heart rate variability (HRV) signal is evaluated. The assessment of heart rate (HR) spectra aimed at providing meaningful measure of mental workload is also discussed. This work may provide insight into the effect of mental workload on the HRV spectral characteristics.
Rogue-key attacks on the multi-designated verifiers signature scheme
Authors: Kyung-Ah Shim
Venue: Information Processing Letters (2008)

In 1996, Jakobsson, Sako, and Impagliazzo and, on the other hand, Chaum introduced the notion of designated verifier signatures to solve some of the intrinsic problems of undeniable signatures. The generalization of this concept was formally investigated by Laguillaumie and Vergnaud as multi-designated verifiers signatures. Recently, Laguillaumie and Vergnaud proposed the first multi-designated verifiers signature scheme which protects the anonymity of signers without encryption. In this paper, we show that their scheme is insecure against rogue-key attacks.
Graphical Models for Structured Classification, with an Application to Interpreting Images of Protein Subcellular Location Patterns
Authors: Shann-Ching Chen, Geoffrey J. Gordon, Robert F. Murphy
Venue: The Journal of Machine Learning Research (2008)

In structured classification problems, there is a direct conflict between expressive models and efficient inference: while graphical models such as Markov random fields or factor graphs can represent arbitrary dependences among instance labels, the cost of inference via belief propagation in these models grows rapidly as the graph structure becomes more complicated. One important source of complexity in belief propagation is the need to marginalize large factors to compute messages. This operation takes time exponential in the number of variables in the factor, and can limit the expressiveness of the models we can use. In this paper, we study a new class of potential functions, which we call decomposable k-way potentials, and provide efficient algorithms for computing messages from these potentials during belief propagation. We believe these new potentials provide a good balance between expressive power and efficient inference in practical structured classification problems. We discuss three instances of decomposable potentials: the associative Markov network potential, the nested junction tree, and a new type of potential which we call the voting potential. We use these potentials to classify images of protein subcellular location patterns in groups of cells. Classifying subcellular location patterns can help us answer many important questions in computational biology, including questions about how various treatments affect the synthesis and behavior of proteins and networks of proteins within a cell. Our new representation and algorithm lead to substantial improvements in both inference speed and classification accuracy.
A fuzzy description of the Henon chaotic map
Authors: Domenico M. Porto
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

In this paper it is described how chaotic dynamics could be generated by means of fuzzy systems. The approach is based on a linguistic description of chaotic phenomena, that can be easily related to a fuzzy system design. It allows building chaotic generators, (useful in several industrial application in which randomness is needed) by means of few fuzzy sets and using a small number of fuzzy rules. Fuzzy descriptions of the well-known two dimensional discrete chaotic map is therefore introduced, denoting a good degree of approximation together with an easy design of the system obtained in a very intuitive way.
Advanced algorithms for analysis and optimization of electronic circuits
Authors: Josef Dobeš
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

The analysis and optimization of electronic circuits are some of the main applications for the art of computer programming. It is mainly caused by problematic convergence of a certain class of the circuits and by extreme differences among the values of the circuit parameters. In the paper, a very flexible algorithm for analyzing the electronic circuits is described with a novel reliable method for suppressing the divergence. Moreover, an efficient algorithm for optimizing the electronic circuits is also characterized with a new method for ensuring the numerical stability using a reliable normalization of the system matrix. The new features of the analysis and optimization algorithms are tested using practical tasks of electronics.
Model Checking Techniques for the Performance Analysis of Delay Tolerant Networks with On-off Behavior
Authors: Michele Garetto, Marco Gribaudo
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

Sparse network of fixed or mobile wireless devices, where most of the time there does not exist a complete path from a source to a destination are often referred to as Delay Tolerant Networks. The store-carry-and-forward principle, according to which messages can be stored at mobile nodes moving around the network area before being forwarded to the destination, allows the transmission of messages in such systems. In this paper, we use an analytical framework to study Delay Tolerant Networks, based on asCSL model checking techniques. In particular we focus on the case in which fixed sensors exhibiton-off behavior to overcome battery capacity limitations.
Principal components analysis for borate mapping
Authors: H. Kargi
Venue: International Journal of Remote Sensing (2007)

Principal components analysis (PCA) of remotely sensed satellite image data is a widely used method in mineral exploration. Generally, the method is used for iron oxide and hydroxyl mapping. In this study, however, the PCA method is adopted for borate exploration. This paper demonstrates how PCA of Landsat TM data can be used to map borate minerals. The method has been applied to the sub-scene of Bigadic and tested on the borate field in Kirka, Turkey. Anomalous pixels for borate minerals in PC6 images have coincided with known borate deposits. Whether borate minerals are mapped into a PC image depends on the appearance of opposite signs in eigenvector loadings for TM4 and TM7 in one or more PCs. Borate coverage in an image is important to emphasize the appearance of opposite signs in eigenvector loadings for TM4 and TM7 in more than one PC.
Applicability of Web Service Technologies to Reach Real Time Capabilities
Authors: Steffen Prüter, Guido Moritz, Elmar Zeeb, Ralf Salomon, Frank Golatowski, Dirk Timmermann
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

Currently the developing process for enterprise applications is improved by the Service Oriented Architecture (SOA) paradigms. With SOAs the creation of modular and clearly defined software architectures at a high grade of interoperability and reusability is possible. For resource constraint networked devices the Devices Profile for Web Services (DPWS) specification adapt the SOA paradigms to create a framework for interoperable and standardized communication between embedded devices. This paper explains how special parts of DPWS can be adapted to provide real-time capabilities. So this paper shows how developers of real-time software can use the advantages of Web services and which adaptations are necessary to create Web services with real-time capabilities.
Blogger, stick to your story: modeling topical noise in blogs with coherence measures
Authors: Jiyin He, Wouter Weerkamp, Martha Larson, Maarten de Rijke
Venue: Proceedings of the second workshop on Analytics for noisy unstructured text data (2008)

Topical noise in blogs arises when bloggers digress from the central topical thrust of their blogs. We introduce a method to explicitly incorporate a model of topical noise into a language modeling approach to the task of blog distillation. Topical noise is integrated into the model using a coherence score, which reflects the tightness of the topical structure of a blog. Tests performed on the TRECBlog06 corpus show that a naive integration of the coherence score as blog prior fails to achieve performance improvements. Instead, we develop a set of more sophisticated models in which the coherence score is weighted by a function of the blog retrieval score. The proposed models help improve effectiveness of our language modeling approach to the blog distillation task.
Learning dynamics and robustness of vector quantization and neural gas
Authors: Aree Witoelar, Michael Biehl, Anarta Ghosh, Barbara Hammer
Venue: Neurocomputing (2008)

Various alternatives have been developed to improve the winner-takes-all (WTA) mechanism in vector quantization, including the neural gas (NG). However, the behavior of these algorithms including their learning dynamics, robustness with respect to initialization, asymptotic results, etc. has only partially been studied in a rigorous mathematical analysis. The theory of on-line learning allows for an exact mathematical description of the training dynamics in model situations. We demonstrate using a system of three competing prototypes trained from a mixture of Gaussian clusters that the NG can improve convergence speed and achieves robustness to initial conditions. However, depending on the structure of the data, the NG does not always obtain the best asymptotic quantization error.
A short-term fair MAC protocol for WLANs
Authors: Coskun Cetinkaya, Mehmet B. Yildirim
Venue: Ad Hoc Networks (2008)

Designing a medium access control (MAC) protocol that simultaneously provides high throughput and allows individual users to share limited spectrum resources fairly, especially in the short-term time horizon, is a challenging problem for wireless LANs. In this paper, we propose an efficient cooperative MAC protocol with very simple state information that considers only collisions, like the standard IEEE 802.11 MAC protocol. However, contrary to the IEEE 802.11 MAC, the cooperative MAC gives collided users priority to access the channel by assigning them shorter backoff counters and interframe-spaces than users who did not participate in the collision event. In other words, collided users are the only ones allowed to transmit in the following contention period. For the cooperative MAC protocol, we utilize an analytical throughput model to obtain the optimal parameter settings. Simulation results show that the cooperative MAC provides significant improvement in short-term fairness and access delay, while still providing high network throughput.
Annotation-Modules
Authors: Michael Hackenberg, Rune Matthiesen
Venue: Bioinformatics (2008)

Motivation: The ontological analysis of the gene lists obtained from DNA microarray experiments constitutes an important step in understanding the underlying biology of the analyzed system. Over the last years, many other high-throughput techniques emerged, covering now basically all ‘omics’ fields. However, for some of these techniques the generally used functional ontologies might not be sufficient to describe the biological system represented by the derived gene lists. For a more complete and correct interpretation of these experiments, it is important to extend substantially the number of annotations, adapting the ontological analysis to the new emerging techniques. Results: We developed Annotation-Modules, which offers an improvement over the current tools in two critical aspects. First, the underlying annotation database implements features from many different fields like gene regulation and expression, sequence properties, evolution and conservation, genomic localization and functional categories—resulting in about 60 different annotation features. Second, it examines not only single annotations but also all the combinations, which is important to gain insight into the interplay of different mechanisms in the analyzed biological system. Availability: http://web.bioinformatics.cicbiogune.es/AM/AnnotationModules.php Contact: mlhackenberg@gmail.com
Solvability in asynchronous environments
Authors: B. Chor, L. Moscovici
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

The authors present necessary and sufficient combinatorial conditions that determine membership in SM/sub t/ (respectively, MP/sub t/), the class of distributed decision tasks that are solvable in the shared memory (resp. message passing) model by a t-resilient randomized protocol, which never errs and works in the presence of a strong adversary. The sufficiency of the conditions is proved by designing protocols that are applicable to all tasks in the appropriate class. The computational complexity of the membership characterization is studied.
Generalized fractional minimax programming with B-(p,r)-invexity
Authors: Tadeusz Antczak
Venue: Computers Mathematics with Applications (2008)

Optimality conditions are proved for a class of generalized fractional minimax programming problems involving B-(p,r)-invexity functions. Subsequently, these optimality conditions are utilized as a basis for constructing various duality models for this type of fractional programming problems and proving appropriate duality theorems.