ppxscal/embedding_network huggingface dataset:
Likelihood stabilization for ill-conditioned vector GARCH models
Authors: Miguel Jerez, José Casals, Sonia Sotoca
Venue: Computational Statistics (2009)

The likelihood of vector GARCH models is ill-conditioned because of two facts. First, when the series display high correlations, as often happens with financial data, some eigenvalues of the conditional covariance matrix are close to zero. Second, the likelihood function is very flat in the neighborhood of the optimum due to the functional form of the GARCH process. These facts explain the instability of multivariate GARCH estimation procedures. Building on this analysis, we suggest a data transformation which moves the critical eigenvalues far from zero and, therefore, improves the stability of iterative optimization methods. The transformed values are re-scaled principal components, so their interpretation is straightforward. The application of this technique is illustrated by modeling the short-run conditional correlations of four nominal exchange rates.
Velocity estimation and corner detection using differences of logarithmically compressed signal envelope
Authors: Navid Mir-Motahhary, Faramarz Atbaei
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

Based on squared differences of the logarithmmically compressed signal envelope, a velocity estimation for moving receiver, constructed by minimum mean-square fitting of a parabola to the sample covariance function is described. The proposed velocity estimator is also capable of tracking various behaviours of mobile receiver. Simulation results show that the proposed method yields good estimation accuracy, with relatively small estimation error. The speed estimates are also used with proposed to a new corner detection method to detect the corner effect in urban cellular systems. Information of corner effect can improve handoff performance and reduce the call dropping rate.
Probabilistic Mobile Ambients
Authors: Marta Kwiatkowska, Gethin Norman, David Parker, Maria Grazia Vigliotti
Venue: Theoretical Computer Science (2009)

The calculus of Mobile Ambients has been introduced for expressing mobility and mobile computation. In this paper we present a probabilistic version of Mobile Ambients by augmenting the syntax of the original Ambient Calculus with a (guarded) probabilistic choice operator. To allow for the representation of both the probabilistic behaviour introduced through the new probabilistic choice operator and the nondeterminism present in the original Ambient Calculus we use probabilistic automata as the underpinning semantic model. The Ambient logic is a logic for Mobile Ambients that contains a novel treatment of both locations and hidden names. For specifying properties of Probabilistic Mobile Ambients, we extend this logic to specify probabilistic behaviour. In addition, to show the utility of our approach we present an example of a virus infecting a network.
NDR Ontology: Sharing and Reusing NFR and Design Rationale Knowledge
Authors: Claudia López, Luiz Marcio Cysneiros, Hernán Astudillo
Venue: Proceedings of the 2008 First International Workshop on Managing Requirements Knowledge (2008)

Understanding Non-Functional Requirements (NFR) and their solutions is a key architecture task, and reusing past solutions is an effective and efficient way to satisfy NFRs. NFR catalogues have been proposed to store and reuse NFR knowledge descriptions, yet identification of reusable knowledge inside catalogues remains quite hard and tedious. This article introduces the NDR Ontology to describe NFR and Design Rationale knowledge, thus making it reusable and shareable via human and machine-readability. The ontology is the basis for several semantics-based applications currently under development, including view-based NFR/rationale exploration, facet-based search, and comparison of alternative solutions. Also, some approach extensions are explored, including model merging and high-end visualization of NFR knowledge.
Supplier selection in a fuzzy group setting: A method using grey related analysis and Dempster-Shafer theory
Authors: Desheng (Dash) Wu
Venue: Expert Systems with Applications: An International Journal (2009)

Supplier selection in a fuzzy group setting is a very important strategic decision involving decisions balancing a number of conflicting criteria and opinions from different experts. This paper uses grey related analysis and Dempster-Shafer theory to deal with this fuzzy group decision making problem. First, in the individual aggregation, grey related analysis is employed as a means to reflect uncertainty in multi-attribute models through interval numbers. Second, in the group aggregation, the Dempster-Shafer (D-S) rule of combination is used to aggregate individual preferences into a collective preference, by which the candidate alternatives are ranked and the best alternative(s) are obtained. The proposed approach uses both quantitative and qualitative data for international supplier selection. It provides alternative tools to evaluate and improve supplier selection decisions in an uncertain global market.
Analytic network process decision-making to assess slicing machine in terms of precision and control wafer quality
Authors: Che-Wei Chang, Cheng-Ru Wu, Huang-Chu Chen
Venue: Robotics and Computer-Integrated Manufacturing (2009)

We discuss and develop a manufacturing quality yield model to forecast the 12in silicon wafer slicing based on an analytic network process (ANP) framework. The ANP is a general theory of relative measurement used to derive composite-priority-ratio scales from individual-ratio scales that represent the relative influence of factors that interact with respect to the control criteria. Through its supermatrix, which is composed of matrices of column priorities, the ANP framework captures the outcome of dependence and feedback within and between clusters of factors. Additionally, the proposed algorithm can select the evaluation outcomes to identify the optimal machine of precision. Finally, results of the EWMA control chart and Process Capability Indices demonstrate the feasibility of the proposed ANP-based algorithm in effectively selecting the evaluation outcomes and in evaluating the precision of the optimal performing machines. We illustrate how the ANP model implemented for helping the engineer can find out the manufacturing process yield quickly and effectively.
The Development of a Personalisation Concept forOnline Newspapers: Exploring Implicit Sources of User Preferences
Authors: Nadine Tylla
Venue:  (2008)

Web personalisation can help providers to betterrespond to their customers' particular preferencesand therefore, to increase customer binding and toestablish profitable long-term businessrelationships. Customers can be assisted in theirsearch for relevant products or information which inturn might save them time and effort. The booksuggests a personalisation concept for an onlinenewspaper starting with the illustration of importantaspects of web personalisation which have to beconsidered in order to successfully perform in thisfield. The author Nadine Tylla reflects on how userdata can be collected, explicitly and implicitly, inorder to derive user preferences as a basis forpersonalised news content. An essential advantage ofgathering implicit user feedback is that customersare not disturbed whilst browsing. In this context, auser test which analyses the correlation between theuser behaviour on an article web page and thecorresponding user interest in this article isintroduced. Concluding, the results of this test aswell as the cognitions of the first part of this bookare taken into account to develop a personalisationconcept for an online newspaper.
Automatic Verification for Secrecy of Cryptographic Protocols in First-Order Logic
Authors: Jihong Han, Zhiyong Zhou, Yadi Wang
Venue: International Journal of Distributed Sensor Networks (2009)

In this article, we present a new formal approach for specification and automatic verification of cryptographic protocols. First, we use the first-order theory to formalize cryptographic protocols and intruders. Assuming that messages transmitted by each principal can be received by the intruder, and messages received by each principal can be known by the intruder, we test the security of cryptographic protocols at the standpoint of the intruder. The protocol representation includes three parts: initial knowledge of the intruder, message exchange of the protocol itself, and computation abilities of the intruder. After defining the term and its typeset, we give a first-order frame to formalizing the protocol based on roles, using axioms to depict the communicating actions of each role. The predicate corresponding to the role's message receiving can be affiliated to the axiom by logical connective ∧, and the predicate corresponding to the role's message transmitting can be the conclusion of the implication relation. The universal quantification ∀ is used to eliminate the limitation for protocol runs, and existential quantification ∃ is used to denote generating of the key or the nonce, and through renaming and consistency check, ensure the refreshness and boundlessness of the new value. In order to implement the automatic verification, we propose a normal approach to transform the axioms into Horn clauses. Following the Dolev-Yao Model, the computation abilities of the intruder are modeled in Horn clauses too. We adopt the deductive reasoning method to verify the secrecy property of cryptographic protocols. The secrecy property is considered as a goal, and based on a deductive algorithm we can check whether the goal can be inferred from the known rules. The known rules form a rule base B containing the Horn clauses of protocol description and the intruder's abilities and initial knowledge. If the goal can be inferred from the base, the sequence of rules applied will lead to the description of an attack scenario. This approach is fully automatic and terminable. The main contributions of the paper are: a general framework of formalizing cryptographic protocol and abilities of the intruder, a practical solving algorithm based on automatic reasoning, and a simple method to find the attack scenarios.
Metropolis Algorithms for Representative Subgraph Sampling
Authors: Christian Hübler, Hans-Peter Kriegel, Karsten Borgwardt, Zoubin Ghahramani
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

While data mining in chemoinformatics studied graph data with dozens of nodes, systems biology and the Internet are now generating graph data with thousands and millions of nodes. Hence data mining faces the algorithmic challenge of coping with this significant increase in graph size: Classic algorithms for data analysis are often too expensive and too slow on large graphs. While one strategy to overcome this problem is to design novel efficient algorithms, the other is to 'reduce' the size of the large graph by sampling. This is the scope of this paper: We will present novel Metropolis algorithms for sampling a 'representative' small subgraph from the original large graph, with 'representative' describing the requirement that the sample shall preserve crucial graph properties of the original graph. In our experiments, we improve over the pioneering work of Leskovec and Faloutsos (KDD 2006), by producing representative subgraph samples that are both smaller and of higher quality than those produced by other methods from the literature.
Parametric sensitivity: A case study comparison
Authors: H. Sulieman, I. Kucuk, P. J. McLellan
Venue: Computational Statistics Data Analysis (2009)

This article presents a comparative analysis of three derivative-based parametric sensitivity approaches in multi-response regression estimation: marginal sensitivity, profile-based approach developed by [Sulieman, H., McLellan, P.J., Bacon, D.W., 2004, A Profile-based approach to parametric sensitivity in multiresponse regression models, Computational Statistics & Data Analysis, 45, 721-740] and the commonly used approach of the Fourier Amplitude Sensitivity Test (FAST). We apply the classical formulation of FAST in which Fourier sine coefficients are utilized as sensitivity measures. Contrary to marginal sensitivity, profile-based and FAST approaches provide sensitivity measures that account for model nonlinearity and are pertinent to linear and nonlinear regression models. However, the primary difference between FAST and profile-based sensitivity is that traditional FAST fails to account for parameter dependencies in the model system while these dependencies are considered in the analysis procedure of profile-based sensitivity through the re-estimation of the remaining model parameters conditional on the values of the parameter of interest. An example is discussed to illustrate the comparisons by applying the three sensitivity methods to a model described by set of non-linear differential equations. Some computational aspects are also explored.
Deriving Software Services from Business Processes of Representative Customer Organizations
Authors: Sebastian Adam, Norman Riegel, Joerg Doerr
Venue: Proceedings of the 2008 International Workshop on Service-Oriented Computing Consequences for Engineering Requirements (2008)

When providing software in terms of web services, software developing organizations are faced with the challenge of identifying services that maximize the profit by fitting the requirements of as many customers as possible. They do not only have to know which features are required but also what the right functional range of a service is in order to optimize the service demand. In this paper, we present a method on how to systematically package service functionality based on the business processes of some representative customers. We describe how valuable functions can be systematically derived from business processes, and how they can be grouped into services.
Decision support system for the modular type of product and for its R&D investment
Authors: Yoshiki Nakamura
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Companies have to develop core competitive technologies in a very short time. Therefore, product development and research and development must proceed with the concept of management. This study proposes a method and decision support system for selection of R&D projects utilized to the modular type of PD. First, it should be clarified the relationship among R&D investment, its project, modular technology and the product. Second, it is helped the decision making about how many modules of technology introduced the product considered to the cost restriction. Finally, it will be made the support system for its decision making from the outputs of figures. In this way, it becomes possible to effectively develop products while analyzing the conditions of the industry as well as the market and competing companies. It is also able to allow the proposal of future critical management strategy or tactical strategy.
Efficient maintenance techniques for views over active documents
Authors: Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Many Web applications are based on dynamic interactions between Web components exchanging flows of information. Such a situation arises for instance in mashup systems or when monitoring distributed autonomous systems. Our work is in this challenging context that has generated recently a lot of attention; see Web 2.0. We introduce the axlog formal model for capturing such interactions and show how this model can be supported efficiently. The central component is the axlog widget defined by one tree-pattern query or more, over an active document (in the Active XML style) that includes some input streams of updates. A widget generates a stream of updates for each query, the updates that are needed to maintain the view corresponding to the query. We exploit an array of known technologies: datalog optimization techniques such as Differential or MagicSet, constraint query languages, and efficient XML filtering (YFilter). The novel optimization technique we propose is based on fundamental new notions: a relevance (different than that of MagicSet), satisfiability and provenance for active documents. We briefly discuss an implementation of an axlog engine, an application that we used to test the approach, and results of experiments.
User requirements
Authors: Richard G. Mills
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

Changed priorities and shifts in the Nation's economic and social environment have uncovered in the private sector a chronic and crippling shortcoming in the linkage between the developers and the consumers of technology. If major dislocations and unaffordable inefficiences in our economic system are to be avoided, this gap must be closed. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Relational compositions in Fuzzy Class Theory
Authors: Libor Běhounek, Martina Daňková
Venue: Fuzzy Sets and Systems (2009)

We present a method for mass proofs of theorems of certain forms in a formal theory of fuzzy relations and classes. The method is based on formal identification of fuzzy classes and inner truth values with certain fuzzy relations, which allows transferring basic properties of sup-T and inf-R compositions to a family of more than 30 composition-related operations, including sup-T and inf-R images, pre-images, Cartesian products, domains, ranges, resizes, inclusion, height, plinth, etc. Besides yielding a large number of theorems on fuzzy relations as simple corollaries of a few basic principles, the method provides a systematization of the family of relational notions and generates a simple equational calculus for proving elementary identities between them, thus trivializing a large part of the theory of fuzzy relations.
An implicit high-order hybridizable discontinuous Galerkin method for linear convection-diffusion equations
Authors: N. C. Nguyen, J. Peraire, B. Cockburn
Venue: Journal of Computational Physics (2009)

We present a hybridizable discontinuous Galerkin method for the numerical solution of steady and time-dependent linear convection-diffusion equations. We devise the method as follows. First, we express the approximate scalar variable and corresponding flux within each element in terms of an approximate trace of the scalar variable along the element boundary. We then define a unique value for the approximate trace by enforcing the continuity of the normal component of the flux across the element boundary; a global equation system solely in terms of the approximate trace is thus obtained. The high number of globally coupled degrees of freedom in the discontinuous Galerkin approximation is therefore significantly reduced. If the problem is time-dependent, we discretize the time derivative by means of backward difference formulae. This results in efficient schemes capable of producing high-order accurate solutions in space and time. Indeed, when the time-marching method is (p+1)th order accurate and when polynomials of degree p>=0 are used to represent the scalar variable, the flux and the approximate trace, we observe that the approximations for the scalar variable, the flux and the trace of the scalar variable converge with the optimal order of p+1 in the L^2-norm. Finally, we introduce a simple element-by-element postprocessing scheme to obtain new approximations of the flux and the scalar variable. The new approximate flux, which has a continuous inter-element normal component, is shown to converge with order p+1 in the L^2-norm. The new approximate scalar variable is shown to converge with order p+2 in the L^2-norm. For the time-dependent case, the postprocessing does not need to be applied at each time-step but only at the times for which an enhanced solution is required. Moreover, the postprocessing procedure is less expensive than the solution procedure, since it is performed at the element level. Extensive numerical results are presented to demonstrate the convergence properties of the method.
Phishing defense against IDN address spoofing attacks
Authors: Viktor Krammer
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

Address spoofing is a common trick used in phishing scams to confuse unsuspecting users about a Web site's real origin. With the introduction of Unicode characters into domain names, also known as Internationalized Domain Names (IDN), the risk has significantly increased even for the most cautious users. The author explores the various types of address spoofing attacks focusing on IDN, and presents a novel client-side Web browser plug-in Quero which implements several techniques---including highlighting---to protect the user against visually undistinguishable address manipulations.
The stable and precise motion control for multiple mobile robots
Authors: Dayal Ramakrushna Parhi, Saroj Kumar Pradhan, Anup Kumar Panda, Rabindra Kumar Behera
Venue: Applied Soft Computing (2009)

Intelligent path planning of multiple mobile robots has been addressed in this paper. Cooperative behaviour can be achieved using several mobile robots, which require online inter-communication among themselves. In the present investigation rule-based and rule-based-neuro-fuzzy techniques are analyzed for multiple mobile robots navigation in an unknown or partially known environment. The final aims of the robots are to reach some pre-defined goals. Based upon a reference motion, direction; distances between the robots and obstacles; distances between the robots and targets; different types of rules are taken heuristically and refined later to find the steering angle. The control system combines a repelling influence related to the distance between robots and nearby obstacles and with an attracting influence between the robots and targets. Then a hybrid rule-based-neuro-fuzzy technique is analyzed to find the steering angle of the robots. Results show that the proposed rule-based-neuro-fuzzy technique can improve navigation performance in complex and unknown environments compared to this simple rule-based technique.
An ensemble of support vector machines for predicting virulent proteins
Authors: Loris Nanni, Alessandra Lumini
Venue: Expert Systems with Applications: An International Journal (2009)

It is important to develop a reliable system for predicting bacterial virulent proteins for finding novel drug/vaccine and for understanding virulence mechanisms in pathogens. In this work we have proposed a bacterial virulent protein prediction method based on an ensemble of classifiers where the features are extracted directly from the amino acid sequence of a given protein. It is well known in the literature that the features extracted from the evolutionary information of a given protein are better than the features extracted from the amino acid sequence. Our method tries to fill the gap between the amino acid sequence based approaches and the evolutionary information based approaches. An extensive evaluation according to a blind testing protocol, where the parameters of the system are calculated using the training set and the system is validated in three different independent datasets, has demonstrated the validity of the proposed method.