ppxscal/embedding_network huggingface dataset:
An approach to the solution of nonlinear unconstrained optimization problems
Authors: Yu. P. Laptin
Venue: Cybernetics and Systems Analysis (2009)

An approach to reducing a constrained convex programming problem to an unconstrained optimization problem is considered. An initial internal feasible point is supposed to be specified. An equivalent unconstrained optimization problem is formulated in such a way that the calculated values of gradients (subgradients) of original functions do not violate the initial constraints. Properties of introduced functions are investigated. Convexity conditions are formulated for the unconstrained optimization problem. The results may by useful for the development of algorithms for solving constrained optimization problems.
A Standardised Data Model for Process and Flow Management: ISO 15531-43 --A Step Towards CE in Manufacturing --
Authors: A. F. Cutting-Decelle, R. I. Young, J. P. Bourey, J. J. Michel, L. C. Pouchard
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

Ready access to information is a critical requirement in concurrent engineering and access to manufacturing information is particularly important to businesses involved in the product production. While a range of research has considered manufacturing information models for process planning, little has been done to formalize an information model to support process flow information. This is necessary for all areas of manufacture where flow is important including process planning, production planning, scheduling and supply chain management. This paper introduces a new standard which is being introduced to support flow management and discusses the key features which it offers.
A comparative assessment of ant colony optimization algorithms for the minimum weight vertex cover problem
Authors: Raka Jovanovic, Milan Tuba
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

In this paper we analyze the application of the Ant Colony Optimization to the Minimum Weight Vertex Covering Problem. We use the software system that we developed and implemented different standard ACO algorithms to this problem: Ant Colony System, the use of Elitism, Rank based approach and the MinMax system. We have made a comparative assessment of the effectiveness of these algorithms to the Minimum Weight Vertex Covering Problem in different problem cases and shown that Elitist Ant System and MinMax Ant System give better solutions for larger test cases while run-times for all algorithms were similar.
Debating net neutrality
Authors: Alan Joch
Venue: Communications of the ACM (2009)

Advocates seek to protect users from potential business practices, but defenders of the status quo say that concerns are overblown.
A seven degrees of freedom (7 DOF) human body: vehicle structure model for impact applications
Authors: Stefan Tabacu, Nicolae Pandrea, Nicolae Doru Stanescu
Venue: Proceedings of the 10th WSEAS international conference on Automation & information (2009)

This paper presents an analytical model of the human body for impact applications. A seven degrees of freedom model is developed and validated starting from a simple restrained model the human body response during the frontal impact is analysed.
Discovering Temporal Knowledge from a Crisscross of Timed Observations
Authors: Nabil Benayadi, Marc Le Goc
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

This paper is concerned with the discovering of temporal knowledge from a sequence of timed observations provided by a system monitoring of dynamic process. The discovering process is based on the Stochastic Approach framework where a series of timed observations is represented with a Markov chain. From this representation, a set of timed sequential binary relations between discrete event classes is discovered with an abductive reasoning and represented as abstract chronicle models. To reduce the search space as close as possible to the potential relations between the process variables, we propose to characterize a set of series of timed observations with a unique measure of the homogeneity of the crisscross of class occurrences and to use this measure to prune abstract chronicle models.
Dynamic model for hydraulic dissipators
Authors: Adrian S. Axinti, Gavril Axinti
Venue: Proceedings of the 10th WSEAS international conference on Automation & information (2009)

The authors propose a mathematical model of a hydraulic link with energy dissipation, the device working reversibly to the alternative traction and compression movement. The dynamic behavior of the energy hydraulic dissipater depends on the instantaneous frequency (speed) of the excitation generated by the earthquake, mechanical shock or vibration. The control of dissipaters is obtained by appealing at a system composed of devices for regulating pressure (energy regulators), located outside the dissipater.
Visual querying and analysis of large software repositories
Authors: Lucian Voinea, Alexandru Telea
Venue: Empirical Software Engineering (2009)

We present a software framework for mining software repositories. Our extensible framework enables the integration of data extraction from repositories with data analysis and interactive visualization. We demonstrate the applicability of the framework by presenting several case studies performed on industry-size software repositories. In each study we use the framework to give answers to one or several software engineering questions addressing a specific project. Next, we validate the answers by comparing them with existing project documentation, by interviewing domain experts and by detailed analyses of the source code. The results show that our framework can be used both for supporting case studies on mining software repository techniques and for building end-user tools for software maintenance support.
A Flexible Natural Gradient Approach to Blind Separation of Complex Signals
Authors: Michele Scarpiniti, Daniele Vigliano, Raffaele Parisi, Aurelio Uncini
Venue: Proceeding of the 2009 conference on New Directions in Neural Networks: 18th Italian Workshop on Neural Networks: WIRN 2008 (2009)

In this paper a natural gradient approach to blind source separation in complex environment is presented. It is shown that signals can be successfully reconstructed by a network based on the so called generalized splitting activation function (GSAF). This activation function, whose shape is modified during the learning process, is based on a couple of bi-dimensional spline functions, one for the real and one for the imaginary part of the input, thus avoiding the restriction due to the Louiville's theorem. In addition recent learning metrics are compared with the classical ones in order to improve the speed convergence. Several experimental results are shown to demonstrate the effectiveness of the proposed method.
Economic Power Dispatch with Environmental Constraints Using a Novel Hybrid Evolutionary Programming
Authors: Gonggui Chen, Yinhong Li, Xianzhong Duan
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

Environmental/economic dispatch (EED) is a bi-objective optimization problem with conflicting optimization objectives, the minimization of fuel cost and the minimization of emission. In this paper, a modified average price penalty factor (MAPPF) is introduced to convert the bi-objective EED problem into a single-objective optimization problem. A new hybrid evolutionary programming (HEP) methodology is proposed to solve the EED. In the methodology, a simple evolutionary programming (EP) is used as a basic level search, which can give a good direction to the optimal global region. Then, a local search procedure is adopted as a fine tuning to determine the optimal solution. The methodology is applied to a 15-unit system and the numerical results indicate its effectiveness and practicality.
Validating an Automated Evaluation Procedure for Ontology Triples in the Privacy Domain
Authors: Peter Spyns, Giles Hogben
Venue: Proceeding of the 2005 conference on Legal Knowledge and Information Systems: JURIX 2005: The Eighteenth Annual Conference (2005)

In this paper we validate a simple method to objectively assess the results of extracting material (c.q. triples) from text corpora to build ontologies. The EU Privacy Directive has been used as corpus. Two domain experts have manually validated the results. Several experimental settings have been tried. As the evaluation scores are rather modest (sensitivity or recall: 0.5, specificity: 0.539 and precision: 0.21), we see them as a baseline reference for future experiments. Nevertheless, the human experts appreciate the automated evaluation procedure as sufficiently effective and time-saving for usage in real-life ontology modelling situations.
A Value Creation Planning Method to Complex Engineering Products Development
Authors: Marcus Vinicius Pereira Pessôa, Geilson Loureiro, João Murta Alves
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

Innovative firms have product development as one of their core processes; optimizing this process, regardless the product will be mass-produced or custom made, must be a firm's priority. A common approach is to treat the product development as a project, where Project Management is essential to organize and lead the efforts. The Toyota development system is a benchmark in the automotive industry and has been widely accepted in other sectors with dramatic benefits. This work presents an approach to derive a project activity network pulled by the stakeholders' requested value. The first part of the paper introduces the value creation in product development. In sequence the issues to planning to lean development are discussed. Finally the four-step approach is presented and the first three steps are explained through the analysis of real project data.
Studying New Ways for Improving Adaptive History Length Branch Predictors
Authors: Ayose Falcón, Oliverio J. Santana, Pedro Medina, Enrique Fernández, Alex Ramírez, Mateo Valero
Venue: Proceedings of the 4th International Symposium on High Performance Computing (2009)

Pipeline stalls due to branches limit processor performance significantly. This paper provides an in depth evaluation of Dynamic History Length Fitting, a technique that changes the history length of a two-level branch predictor during the execution, trying to adapt to its different phases. We analyse the behaviour of DHLF compared with fixed history length gshare predictors, and contribute showing two factors that explain DHLF behaviour: Opportunity Cost and Warm-up Cost.Additionally, we evaluate the use of profiling for detecting future improvements. Using this information, we show that new heuristics that minimise both opportunity cost and warm-up cost could outperform significantly current variable history length techniques. Especially at program start-up, where the algorithm tries to learn the behaviour of the program to better predict future branches, the use of profiling reduces considerably the cost produced by continuous history length changes.
Trajectory and temporal planning of a wheeled mobile robot on an uneven surface
Authors: Imran Waheed, Reza Fotouhi
Venue: Robotica (2009)

Computing a realistic velocity profile for a mobile robot is a challenging task due to the large number of kinematic and dynamic constraints involved. In order for a mobile robot to complete its task it must be able to plan and follow a trajectory. It may also be necessary to follow a given velocity profile, depending on the environment. Temporal planning, or following a given velocity profile, can be used to minimize time of motion and to avoid moving obstacles. For example, assuming the mobile robot is a smart wheelchair, it must follow a prescribed path while following a strict speed limit. This paper presents a temporal planning algorithm that is implemented on a wheeled mobile robot to be used in an indoor setting, such as a hospital ward. The path planning stage is accomplished by using cubic spline functions. A trajectory is created by assigning an arbitrary time of 1 s to each segment of the path. This trajectory is made feasible by applying a number of constraints and using a linear scaling technique. When a velocity profile is given, a non-linear time scaling technique is used to fit the mobile robot's linear velocity to the given velocity profile. A method for avoiding moving obstacles is also implemented. Simulation and experimental results showed good agreement with each other. The main contribution of this paper is in developing a temporal planning algorithm, which is capable of moving on an uneven surface (graded non-flat), and its implementation on the mobile robot at the robotics lab in the University of Saskatchewan. This algorithm is computationally very efficient as it requires low computation cost and does not involve major iterations.
Letters: New delay-dependent stability results for discrete-time recurrent neural networks with time-varying delay
Authors: Xun-Lin Zhu, Youyi Wang, Guang-Hong Yang
Venue: Neurocomputing (2009)

This paper studies the problem of stability analysis for discrete-time recurrent neural networks (DRNNs) with time-varying delays. By using the discrete Jensen inequality and the sector bound conditions, a new less conservative delay-dependent stability criterion is established in terms of linear matrix inequalities (LMIs) under a weak assumption on the activation functions. By using a delay decomposition method, a further improved stability criterion is also derived. It is shown that the newly obtained results are less conservative than the existing ones. Meanwhile, the computational complexity of the newly obtained stability conditions is reduced since less variables are involved. A numerical example is given to illustrate the effectiveness and the benefits of the proposed method.
Algebraic model for the flip-flops behaviour with final states
Authors: Anca Vasilescu
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

Hardware systems consists of interconnected components. Formal methods provide a solution for systematically and exhaustively analysing the interconnected computer components behaviour in order to prove the correctness and to avoid the bugs before the real circuit assembly. A formal-based analysis has to focus on the communication and synchronization between the involved components. We consider here the flip-flops as representative memory cells and sequential hardware components. Our proposed formal models ensure that certain events occur in the correct order based on the manner of modelling the state changes. Hence, the main target of this paper is to emphasize the correct sequence of logic values stored in the memory cells at certain moments. From this point of view, the most important issues of this approach refer to the notion of final state and consequently to the interest of modelling the memory cells behaviour with final states. In order to achieve this target, we have chosen an algebraic calculus, SCCS and a specific platform for automatic verification, CWB.
A conditional p-hub location problem with attraction functions
Authors: H. A. Eiselt, Vladimir Marianov
Venue: Computers and Operations Research (2009)

We formulate the competitive hub location problem in which customers have gravity-like utility functions. In the resulting probabilistic model, customers choose an airline depending on a combination of functions of flying time and fare. The (conditional) follower's hub location problem is solved by means of a heuristic concentration method. Computational experience is obtained using the Australian data frequently used in the literature. The results demonstrate that the proposed method is viable even for problems of realistic size, and the results appear quite robust with respect to the leader's hub locations.
A new ranking procedure by incomplete pairwise comparisons using preference subsets
Authors: Lev V. Utkin
Venue: Intelligent Data Analysis (2009)

A method for ranking of alternatives or objects and its extensions by incomplete pairwise comparisons using random set theory are proposed in the paper. The main feature of the method is that it allows us to deal with comparisons of arbitrary groups of alternatives. The method is extended on the case of independent groups of experts. The imprecise Dirichlet model is also used to make cautious decisions in several cases. Various numerical examples illustrate the proposed method and its extensions.
The softphy abstraction: from packets to symbols in wireless network design
Authors: Hari Balakrishnan
Venue:  (2008)

At ever-increasing rates, we are using wireless systems to communicate with others and retrieve content of interest to us. Current wireless technologies such as WiFi or Zigbee use forward error correction to drive bit error rates down when there are few interfering transmissions. However, as more of us use wireless networks to retrieve increasingly rich content, interference increases in unpredictable ways. This results in errored bits, degraded throughput, and eventually, an unusable network. We observe that this is the result of higher layers working at the packet granularity, whereas they would benefit from a shift in perspective from whole packets to individual symbols. From real-world experiments on a 31-node testbed of Zigbee and software-defined radios, we find that often, not all of the bits in corrupted packets share fate. Thus, today's wireless protocols retransmit packets where only a small number of the constituent bits in a packet are in error, wasting network resources. In this dissertation, we will describe a physical layer that passes information about its confidence in each decoded symbol up to higher layers. These SoftPHY hints have many applications, one of which, more efficient link-layer retransmissions, we will describe in detail. PP-ARQ is a link-layer reliable retransmission protocol that allows a receiver to compactly encode a request for retransmission of only the bits in a packet that are likely in error. Our experimental results show that PP-ARQ increases aggregate network throughput by a factor of approximately 2&times; under various conditions. Finally, we will place our contributions in the context of related work and discuss other uses of SoftPHY throughout the wireless networking stack. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Analysis of Collaborative Problem Solving Based on Thinking Styles
Authors: Takafumi Ichihara, Kazuhisa Miwa, Norio Ishii
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)

In this study, we analyzed the process of collaborative problem solving from the viewpoint of thinking styles. Thinking styles are defined as a preferred way of thinking, and here three styles, Legislative, Executive, and Judicial styles[1] were adopted. In this study, we constructed groups whose members display different thinking styles, and they solved a creative task collaboratively. The results are summarized as follows. (1) It was difficult to effect distributed collaboration based on thinking styles. If anything, dominative collaboration by Legislative thinking as the leader was observed. (2) Only with the Legislative style could we anticipate the degree of Proposing. Thus, Legislative thinker participated actively in Proposing, whereas Executive and Judicial thinkers did not do so in Doing and Evaluating, respectively.
Principles for the Development of Upper Ontologies in Higher-level Information Fusion Applications
Authors: Eric Little, Lowell Vizenor
Venue: Proceeding of the 2006 conference on Formal Ontology in Information Systems: Proceedings of the Fourth International Conference (FOIS 2006) (2006)

The use of ontologies within many information science communities is growing at an ever-increasing rate. This is especially true of higher-level multisource information fusion applications, where there is a genuine need for an improved understanding of the complex relational items (e.g. intentions, capabilities, opportunities and vulnerabilities) typically associated with situation and threat assessment (STA). Still, most current ontology development tools lack the resources to support the sorts of ontological distinctions necessary to provide a sufficiently scalable and reusable ontology product for STA purposes. In this paper we analyze the types of complex relations typically involved in STA ontology and discuss how these distinctions can serve as a theoretical framework for the enhancement of existing ontology development tools, especially as these relate to STA ontology.
Code based analysis for object-oriented systems
Authors: Swapan Bhattacharya, Ananya Kanjilal
Venue: Journal of Computer Science and Technology (2006)

The basic features of object-oriented software makes it difficult to apply traditional testing methods in object-oriented systems. Control Flow Graph (CFG) is a well-known model used for identification of independent paths in procedural software. This paper highlights the problem of constructing CFG in object-oriented systems and proposes a new model named Extended Control Flow Graph (ECFG) for code based analysis of Object-Oriented (OO) software. ECFG is a layered CFG where nodes refer to methods rather than statements. A new metrics --Extended Cyclomatic Complexity (E-CC) is developed which is analogous to McCabe's Cyclomatic Complexity (CC) and refers to the number of independent execution paths within the OO software. The different ways in which CFG's of individual methods are connected in an ECFG are presented and formulas for E-CC for these different cases are proposed. Finally we have considered an example in Java and based on its ECFG, applied these cases to arrive at the E-CC of the total system as well as proposed a methodology for calculating the basis set, i.e., the set of independent paths for the OO system that will help in creation of test cases for code testing.
Schedule risk management for business M-applications development projects
Authors: Paul Pocatilu, Marius Vetrici
Venue: WSEAS Transactions on Computers (2009)

The grand majority of software development projects are known to be late and over the budget. Several surveys performed during the last 15 years expose a relatively poor performance in delivering successful software projects. Most of the projects hit schedule and budget overruns of 25% to 100% and sometimes even more. Even though m-applications development is a new software development field, still this type of projects is not secured against the common flaws of software development projects. Therefore, the main goal of this paper is to reduce the gap between the estimated duration of the m-application development project and the actual elapsed time. We find that legacy and proven best practices project management techniques can be successfully employed for schedule risk management. Furthermore, we present three proven software project management techniques that were successfully adapted to the development of m-applications. The first one is the estimation of m-application project duration using top-down and bottom-up approaches. The second one is the use of a set of performance metrics for project quality assessment. And the last one is the Extended Metrix model, a stochastic project duration estimation model with schedule risk analysis elements.