ppxscal/embedding_network huggingface dataset:
Some observations on staff estimation metrics for object: oriented software engineering
Authors: Deepti Mishra, Alok Mishra
Venue: ACM SIGSOFT Software Engineering Notes (2008)

Object-Oriented software projects are becoming more popular than structured (functional) technology based projects in the present scenario. Object Technology (OT) offers support to deliver products to market more quickly and to provide high quality products with lower maintenance costs. As expertise in managing Object-Oriented (OO) project grows, such a body of OO metric knowledge will become increasingly usable across the Industry. There is need for good OO metrics for both process and product management. Estimation is an important field of software engineering. In this work we have proposed model for staffing estimation by using available metrics in OO and taking affecting factors into consideration.
Electron Microscope Visualization of Multiphase Fluids Contained in Closed Carbon Nanotubes
Authors: A. G. Yazicioglu, C. M. Megaridis, A. Nicholls, Y. Gogotsi
Venue: Journal of Visualization (2005)

Aqueous multiphase fluids trapped in closed multiwall carbon nanotubes are visualized with high resolution using transmission electron microscopy (TEM). The hydrothermally synthesized nanotubes have inner diameter of 70 nm and wall thickness 20 nm, on average. The nanotubes are hydrophilic due to oxygen groups attached on their wall surfaces. Segregated liquid inclusions contained in the nanotubes under high pressure can be mobilized by heating. A resistive heating stage is utilized to heat a thin membrane inside a nanotube, causing the membrane to evaporate slowly and eventually pinch off. Focused electron beam heating is employed as a second means of thermal stimulation, which results in localized heating. With the latter method, gas/liquid interface motion is observed inside the thin channel of a carbon nanotube. Experiments like the ones presented herein may help understand the dynamics of fluids contained in nanoscale channels.
Security, Privacy and Legal Issues in Pervasive eHealth Monitoring Systems
Authors: Frank Kargl, Elaine Lawrence, Martin Fischer, Yen Yang Lim
Venue: Proceedings of the 2008 7th International Conference on Mobile Business (2008)

In this paper we analyze the security and privacy requirements of eHealth monitoring systems which use wireless sensor networks. Based on our experience developing our eHealth system, ReMoteCare, we have devised a model of such systems which we use to discuss threats and attacks, address security requirements and give guidelines for security mechanisms. The contentious issues of privacy of medical data are canvassed – especially as there are legal ramifications if personal health information is compromised.
Analytical approach for testing linking-with-light circuits and systems
Authors: H. J. Kadim
Venue: Proceedings of the 7th WSEAS International Conference on Instrumentation, Measurement, Circuits and Systems (2008)

To avoid the electrical complications associated with on-chip metallic interconnects, light as a means of communication between embedded Intellectual Property (IP) cores may be a preferred alternative. The realisation of integrated circuits - that use photons for communication between IPs - requires test techniques that allow behaviour abnormality in both the electronic and the optical parts of a circuit to be detected. This paper presents analytical expressions to examine the effect of parameter fluctuations on the optical interconnect and hence providing information that will assist in identifying abnormal deviations in circuit's behaviour.
Detecting Regular Visit Patterns
Authors: Bojan Djordjevic, Joachim Gudmundsson, Anh Pham, Thomas Wolle
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

We are given a trajectory $\mathcal{T}$ and an area $\mathcal{A}$. $\mathcal{T}$ might intersect $\mathcal{A}$ several times, and our aim is to detect whether $\mathcal{T}$ visits $\mathcal{A}$ with some regularity, e.g. what is the longest time span that a GPS-GSM equipped elephant visited a specific lake on a daily (weekly or yearly) basis, where the elephant has to visit the lake most of the days (weeks or years), but not necessarily on every day (week or year).During the modelling of such applications, we encounter an elementary problem on bitstrings, that we call LDS (LongestDenseSubstring). The bits of the bitstring correspond to a sequence of regular time points, in which a bit is set to 1 iff the trajectory $\mathcal{T}$ intersects the area $\mathcal{A}$ at the corresponding time point. For the LDS problem, we are given a string s as input and want to output a longest substring of s, such that the ratio of 1's in the substring is at least a certain threshold.In our model, LDS is a core problem for many applications that aim at detecting regularity of $\mathcal{T}$ intersecting $\mathcal{A}$. We propose an optimal algorithm to solve LDS, and also for related problems that are closer to applications, we provide efficient algorithms for detecting regularity.
A Two-Phased Visual Query Interface for Relational Databases
Authors: Sami El-Mahgary, Eljas Soisalon-Soininen
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Developing an easy-to-use, visual query tool for non-expert users to perform their own ad-hoc queries from relational databases is an active research area. The challenge lies in designing a visual query application that is both versatile and user-friendly; often expressive power comes at the expense of non-intuitive user interfaces. This work is based on a novel two-phased approach, so that users first specify the subset of data that is of interest (using a so-called principal concept), whereby the query generates an intermediary dataset. In the second phase, users query this dataset to further eliminate unwanted rows through Boolean constraints and to perform any additional operations, i.e. grouping or columns renaming. The user interface has been kept simple and the presented ideas have been successfully implemented in a prototype known as OVI-2, for use with the university student database at Helsinki University of Technology.
Impedance control of a manipulator using a fuzzy model reference learning controller
Authors: M. Tarbouchi, M. R. Strawson, H. Benabdallah
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

The aim of this paper is to present a position based impedance control scheme using a Fuzzy Model Reference Learning Controller (FMRLC). In the proposed control scheme, the static relationship between displacement and force is quantified through a desired stiffness. The desired dynamic behaviour of the system is quantified through the use of a reference model. Through ensuring that the closed loop behaviour of the system is the same as the behaviour of the reference model, the dynamic relationship between motion and force can be regulated. When properly developed, the FMRLC has the ability to improve performance during repetitive tasks by learning through continued interaction with its environment in order to maintain desired and predictable behaviour.
MyCites: An Intelligent Information System for Maintaining Citations
Authors: George Papadakis, Georgios Paliouras
Venue: Proceedings of the 5th Hellenic conference on Artificial Intelligence: Theories, Models and Applications (2008)

The evaluation of their research work and its effect has always been one of scholars' greatest concerns. The use of citations for that purpose, as proposed by Eugene Garfield, is nowadays widely accepted as the most reliable method. However, gathering a scholar's citations constitutes a particularly laborious task, even in the current Internet era, as one needs to correctly combine information from miscellaneous sources. There exists therefore a need for automating this process. Numerous academic search engines try to cover this need, but none of them addresses successfully all related problems. In this paper we present an approach that facilitates to a great extent citation analysis by taking advantage of new algorithms to deal with these problems.
Information Assurance Evaluation for Network Information Systems
Authors: Xin Lü, Zhi Ma
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

In both the public and private sectors, organizations have become significantly depend over on the proper functioning of information systems. As security spending continues to rise, organizations contend that metrics initiatives will become critical to managing and understanding the impact of information security programs. This paper reviews information assurance (IA) conceptions from viewpoint of system science and analyses the construction of IA systems. An IA evaluation model is addressed in this paper, which is depicted by IA capability index, IA countermeasure index and IA cost index. This evaluation model can be used for organizations to assess their IA strategies and analyzes their security state.
Thinking in Objects
Authors: Milena Slavcheva
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

This paper describes a component-driven population of a language resource consisting of semantically interpreted verb-centred structures in a cross-lingual setting. The overall infrastructure is provided by the Unified Eventity Representation (UER) --- a cognitive theoretical approach to verbal semantics and a graphical formalism, based on the Unified Modeling Language (UML). The verb predicates are modeled by eventity frames which contain the eventities' components: static modeling elements representing the characteristics of participants and the relations between them; dynamic modeling elements describing the behaviour of participants and their interactions.
An Approach to the Feature-Based Comparisons for the Rational Curves
Authors: Chanon Aphirukmatakun, Natasha Dejdumrong
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

In image processing, the curve comparisons can be achieved by extracting the curve information from the bitmapped images. The revealed curves are represented in the forms of the sets of pixel information. Thus, the determination of curve matching is to compare pixel by pixel, which is time consuming. On the contrary, for vector graphics images, there have been no methods written in the literatures referred about directly comparing the parametric curves either in the rational or non-rational (polynomial) forms. In this paper, the relationships between two curves can be classified into 4 main categories: Curve Congruence, Curve Proportion, Curve Similarity and Curve Difference. The comparison algorithms for two given parametric curves either non-rational or rational curves are then established. These algorithms can be simply determined by verifying some important geometric features, e.g., the blending functions, the locations of their control points and their weights. In this connection, since a rational curve can be transformed into a non-rational one, the curve comparison algorithms for polynomial curves can also be applied for the cases of the rational curves.
Guest Editors' Introduction: Urban Computing
Authors: Tim Kindberg, Matthew Chalmers, Eric Paulos
Venue: IEEE Pervasive Computing (2007)

Only recently have researchers focused on the integration of computing, sensing, and actuation technologies in everyday urban settings and lifestyles. Pervasive computing has largely been applied either in relatively homogeneous unpopulated areas--for example, sensor networks in forests--or in small-scale well-defined built environments, such as smart houses. Urban settings pose many research and deployment challenges: ownership issues are complex as are the dynamics and density of system participation. Despite the complexities, urban computing is, in a limited sense, already a mass phenomenon. Roughly half the world's population lives in urban environments, and connectivity is extensive through short- and long-range communication networks. This special issue looks at urban uses of familiar mobile technologies but focuses mainly on how to produce fully integrated designs specifically for urban settings and how to overcome the deployment challenges.
Generalized modus ponens using Fodor's implication
Authors: Ion Iancu
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

Using generalized modus ponens reasoning, we examine the values of the inferred conclusion using the Fodor's implication in order to interpret a fuzzy if-then rule with a single input single output and the t-norm t(x,y) = max(1+λ)(x+y-1)-λxy,0), λ ≥ -1, for composition operation. This t-norm is important to use because for λ = -1 and λ = 0 it gives the very used t-norms t1(x,y) = xy and t2(x,y) = max(0,x+y-1), respectively.
Extending orchids for intrusion detection in 802.11 wireless networks
Authors: Romdhane Ben Younes, Guy Tremblay, Guy Bégin
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

In recent years, wireless equipment and services have become close to ubiquitous. Unfortunately, these services are more often than not ill configured security-wise, with minimal protection against potentially damaging attacks. To alleviate this problem, intrusion detection techniques may be used to help identify suspicious behaviour and counter intrusion attempts. In this paper, we describe an extension to the Orchids intrusion detection tool, aimed at detecting intrusions in wireless networks. First, an event analysis module specialized for 802.1 wireless network events has been developed and integrated into Orchids. Next, a number of known attacks (e.g., deauthentication flooding, rogue access points and ChopChop) were modelized and described using declarative signatures. Then, within a simplified but realistic environment, the attacks were reenacted and successfully detected. To our knowledge, our team is the first to detect the ChopChop attack.
A Methodology for Architectural Design of Multimedia Multiprocessor SoCs
Authors: Tiehan Lv, Jiang Xu, Wayne Wolf, I. Burak Ozer, Jorg Henkel, Srimat T. Chakradhar
Venue: IEEE Design Test (2005)

Editors' note: Multiprocessor SoCs are increasingly important for multimedia systems. This article presents a methodology for the architectural design of multimedia multiprocessor SoCs and illustrates its advantages using a generic implementation of a real-time gesture recognition application. The proposed methodology covers all the important architectural aspects, from processor allocation to memory and network design.—Radu Marculescu, Carnegie Mellon University; and Petru Eles, Linköping University
Robust Nonparametric Probability Density Estimation by Soft Clustering
Authors: Ezequiel López-Rubio, Juan Miguel Ortiz-De-Lazcano-Lobato, Domingo López-Rodríguez, María Carmen Vargas-Gonzalez
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

A method to estimate the probability density function of multivariate distributions is presented. The classical Parzen window approach builds a spherical Gaussian density around every input sample. This choice of the kernel density yields poor robustness for real input datasets. We use multivariate Student-t distributions in order to improve the adaptation capability of the model. Our method has a first stage where hard neighbourhoods are determined for every sample. Then soft clusters are considered to merge the information coming from several hard neighbourhoods. Hence, a specific mixture component is learned for each soft cluster. This leads to outperform other proposals where the local kernel is not as robust and/or there are no smoothing strategies, like the manifold Parzen windows.
Communication: Minimum cost homomorphisms to semicomplete multipartite digraphs
Authors: Gregory Gutin, Arash Rafiey, Anders Yeo
Venue: Discrete Applied Mathematics (2008)

For digraphs D and H, a mapping f:V(D)->V(H) is a homomorphism ofDtoH if uv@?A(D) implies f(u)f(v)@?A(H). For a fixed directed or undirected graph H and an input graph D, the problem of verifying whether there exists a homomorphism of D to H has been studied in a large number of papers. We study an optimization version of this decision problem. Our optimization problem is motivated by a real-world problem in defence logistics and was introduced recently by the authors and M. Tso. Suppose we are given a pair of digraphs D,H and a cost c"i(u) for each u@?V(D) and i@?V(H). The cost of a homomorphism f of D to H is @?"u"@?"V"("D")c"f"("u")(u). Let H be a fixed digraph. The minimum cost homomorphism problem for H, MinHOMP(H), is stated as follows: For input digraph D and costs c"i(u) for each u@?V(D) and i@?V(H), verify whether there is a homomorphism of D to H and, if it does exist, find such a homomorphism of minimum cost. In our previous paper we obtained a dichotomy classification of the time complexity of MinHOMP(H)when H is a semicomplete digraph. In this paper we extend the classification to semicomplete k-partite digraphs, k>=3, and obtain such a classification for bipartite tournaments.
Evolutionary based heuristic for bin packing problem
Authors: Adam Stawowy
Venue: Computers and Industrial Engineering (2008)

In this paper, we investigate the use of evolutionary based heuristic to the one-dimensional bin packing problem (BPP). Unlike other evolutionary heuristics used with optimization problems, a non-specialized and non-hybridized algorithm is proposed and analyzed for solving BPP. The algorithm uses a modified permutation with separators encoding scheme, unique concept of separators' movements during mutation, and separators removal as a technique of problem size reduction. The set of experiments confirmed that the proposed approach is comparable to much more complicated algorithms.
Social Recommendations within the Multimedia Sharing Systems
Authors: Katarzyna Musiał, Przemysław Kazienko, Tomasz Kajdanowicz
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

The social recommender system that supports the creation of new relations between users in the multimedia sharing system is presented in the paper. To generate suggestions the new concept of the multirelational social network was introduced. It covers both direct as well as object-based relationships that reflect social and semantic links between users. The main goal of the new method is to create the personalized suggestions that are continuously adapted to users' needs depending on the personal weights assigned to each layer from the social network. The conducted experiments confirmed the usefulness of the proposed model.
Detection and Analysis of Cell Nuclear Phases
Authors: Donggang Yu, Tuan D. Pham, Xiaobo Zhou
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

Automated analysis of molecular images has increasingly become an important research in computational life science. In this paper some new and efficient algorithms for detecting and analyzing cell phases of high-content screening are presented. The conceptual frameworks are based on the morphological features of cell nuclei. Furthermore, the novel detecting and analyzing strategies of feed-forward and feed-back of cell phases are proposed based on grey feature, cell shape, geometrical features and difference information of corresponding neighbor frames. Experiment results tested the efficiency of the new method.
Classification of Complex Structured Objects on the Base of Similarity Degrees
Authors: Piotr Hońko
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

In the paper, we propose an algorithm for classification of complex structured objects. The objects, expressed in a first-order logic (FOL) language, are positive and negative examples of a target relation. In the process of searching for a classification pattern, a similarity measure and some notions of rough set theory are applied. We search for the pattern being a similarity degree of examples and satisfying two conditions: the number of positive examples similar at least to the degree to other positive examples is highest and the number of negative examples similar at least to the degree to positive examples is lowest. The obtained set of similar examples corresponds to the lower or to the upper approximation of a set of all positive examples. The found similarity degree is applied in classification of new examples. An example is classified as positive if it belongs to the approximation computed with respect to the degree, and it is classified as negative, otherwise.
BDI-agents for agile goal-oriented business processes
Authors: Birgit Burmeister, M. Arnold, Felicia Copaciu, Giovanni Rimassa
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: industrial track (2008)

Business processes are the core assets of enterprises. They turn the business potential into actual competitiveness on the market. To face the challenges posed by today's changing and uncertain business environment, traditional business process management (BPM) approaches are not sufficient anymore. This paper presents an approach to business process management, which leverages Agent Technology, especially BDI-Agent features to obtain agile business process behavior. This paper sketches the problem, describes the solution approach, and presents the experiences gained in a concrete case study in the domain of Engineering Change Management.
Fairness in multi-agent systems
Authors: Steven de Jong
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: doctoral mentoring program (2008)

In our increasingly interconnected world, research in the area of multi-agent systems is becoming more and more important [1, 2]. Multi-agent systems are generally accepted as valuable tools for designing and building distributed dynamical systems, by using several interacting agents, possibly including humans. In practice, multi-agent systems are often performing tasks in co-operation with, or instead of humans. Examples include software agents participating in online auctions or bargaining [3, 4], electronic institutions [5], developing schedules for air traffic [6] and decentralized resource distribution in large storage facilities [7, 8].
Realtime Organ Tracking for Endoscopic Augmented Reality Visualization Using Miniature Wireless Magnetic Tracker
Authors: Masahiko Nakamoto, Osamu Ukimura, Inderbir S. Gill, Arul Mahadevan, Tsuneharu Miki, Makoto Hashizume, Yoshinobu Sato
Venue: Proceedings of the 4th international workshop on Medical Imaging and Augmented Reality (2008)

Organ motion is one of the problems on augmented reality (AR) visualization for endoscopic surgical navigation system. However, the conventional optical and magnetic trackers are not suitable for tracking of internal organ motion. Recently, a wireless magnetic tracker, which is called the Calypso 4-D localization system has been developed. Since the sensor of the Calypso system is miniature and implantable, position of the internal organ can be measured directly. This paper describes AR system using the Calypso system and preliminary experiments to evaluate the AR system. We evaluated distortion error caused by the surgical instruments and misalignment error of superimposition. Results of the experiments shows potential feasibility and usefulness of AR visualization of moving organ using the Calypso system.