917 resultados para Numerical Algorithms and Problems
Resumo:
Cell transition data is obtained from a cellular phone that switches its current serving cell tower. The data consists of a sequence of transition events, which are pairs of cell identifiers and transition times. The focus of this thesis is applying data mining methods to such data, developing new algorithms, and extracting knowledge that will be a solid foundation on which to build location-aware applications. In addition to a thorough exploration of the features of the data, the tools and methods developed in this thesis provide solutions to three distinct research problems. First, we develop clustering algorithms that produce a reliable mapping between cell transitions and physical locations observed by users of mobile devices. The main clustering algorithm operates in online fashion, and we consider also a number of offline clustering methods for comparison. Second, we define the concept of significant locations, known as bases, and give an online algorithm for determining them. Finally, we consider the task of predicting the movement of the user, based on historical data. We develop a prediction algorithm that considers paths of movement in their entirety, instead of just the most recent movement history. All of the presented methods are evaluated with a significant body of real cell transition data, collected from about one hundred different individuals. The algorithms developed in this thesis are designed to be implemented on a mobile device, and require no extra hardware sensors or network infrastructure. By not relying on external services and keeping the user information as much as possible on the user s own personal device, we avoid privacy issues and let the users control the disclosure of their location information.
Resumo:
The Distributed Network Protocol v3.0 (DNP3) is one of the most widely used protocols to control national infrastructure. The move from point-to-point serial connections to Ethernet-based network architectures, allowing for large and complex critical infrastructure networks. However, networks and con- figurations change, thus auditing tools are needed to aid in critical infrastructure network discovery. In this paper we present a series of intrusive techniques used for reconnaissance on DNP3 critical infrastructure. Our algorithms will discover DNP3 outstation slaves along with their DNP3 addresses, their corresponding master, and class object configurations. To validate our presented DNP3 reconnaissance algorithms and demonstrate it’s practicality, we present an implementation of a software tool using a DNP3 plug-in for Scapy. Our implementation validates the utility of our DNP3 reconnaissance technique. Our presented techniques will be useful for penetration testing, vulnerability assessments and DNP3 network discovery.
Resumo:
The study explores the role of the state in regional integration processes. The question is approached through theoretical discussion and two case-studies - SADC (Southern African Development Community) and the EU. The main research question of the study is, what are the possibilities and problems of the integration process in Southern Africa and how do they differ from the possibilities and problems of the integration process in Europe. The undelrying question of the study is why do states decide to participate in an integration process where they have to limit their sovereignty. Review of the theoretical discussion of the integration studies shows that the integration process is affected by several factors on different levels of the international system. But the state plays a central role in integration processes - integration processes are inititated and carried on by the participatig states. The European integration process shows that the interests of the state can change over time. At the beginning of the integration process, the objective was to strengthen participating states. Later EU member states have decided that it is in their interest to deepen the process even if it has meant limitation of their sovereignty. The determinant factor has been that the member states have considered it to be in their interst to deepen the process. In Southern Africa the integration process is only at the beginning. SADC aims to establish a free trade area by 2008. The biggest challenge is how to implement the integration process so that it benefits all member states in a region that is economically dominated by South Africa. In practice this can be achieved through establishment of corrective mechanisms, which ensure equitable distribution of benefits. This would require deeper integration and South Africa to adapt responsibility towards its regional partners. African integration processes in general have not been as successful as for example the EU. African states have been reluctant to limit their sovereignty in favour of regional organisations.This can be explained by the differences between European and African states. The EU member states have been democracies while African states have been characterised by concentration of power in the executive branch. Furthermore the political systems in Africa have been characterised by vertical clientelist reltionships. As a result it has not been in the interest of the political elite to limit the state sovereignty in favour of regional organisations. In recent years SADC has been relatively succesful in its integration process and reforms, but a lot remains to be done before the implementation of the free trade area can be succesful. The institutional structure and treaties of SADC differ from the structures of the EU. Member states are the main actors of the integration processes. Their differences are reflected in the process and produce different kinds of integration in different parts of the world.
Resumo:
Lateral displacement and global stability are the two main stability criteria for soil nail walls. Conventional design methods do not adequately address the deformation behaviour of soil nail walls, owing to the complexity involved in handling a large number of influencing factors. Consequently, limited methods of deformation estimates based on empirical relationships and in situ performance monitoring are available in the literature. It is therefore desirable that numerical techniques and statistical methods are used in order to gain a better insight into the deformation behaviour of soil nail walls. In the present study numerical experiments are conducted using a 2 4 factorial design method. Based on analysis of the maximum lateral deformation and factor-of-safety observations from the numerical experiments, regression models for maximum lateral deformation and factor-of-safety prediction are developed and checked for adequacy. Selection of suitable design factors for the 2 4 factorial design of numerical experiments enabled the use of the proposed regression models over a practical range of soil nail wall heights and in situ soil variability. It is evident from the model adequacy analyses and illustrative example that the proposed regression models provided a reasonably good estimate of the lateral deformation and global factor of safety of the soil nail walls.
Resumo:
This paper asks a new question: how we can use RFID technology in marketing products in supermarkets and how we can measure its performance or ROI (Return-on-Investment). We try to answer the question by proposing a simulation model whereby customers become aware of other customers' real-time shopping behavior and may hence be influenced by their purchases and the levels of purchases. The proposed model is orthogonal to sales model and can have the similar effects: increase in the overall shopping volume. Managers often struggle with the prediction of ROI on purchasing such a technology, this simulation sets to provide them the answers of questions like the percentage of increase in sales given real-time purchase information to other customers. The simulation is also flexible to incorporate any given model of customers' behavior tailored to particular supermarket, settings, events or promotions. The results, although preliminary, are promising to use RFID technology for marketing products in supermarkets and provide several dimensions to look for influencing customers via feedback, real-time marketing, target advertisement and on-demand promotions. Several other parameters have been discussed including the herd behavior, fake customers, privacy, and optimality of sales-price margin and the ROI of investing in RFID technology for marketing purposes. © 2010 Springer Science+Business Media B.V.
Resumo:
Understanding the overwhelming diversity of life calls for complex organisational schemes. The field of systematics may thus be seen as the cornerstone of evolutionary biology. In the last few decades, systematics has been rejuvenated through the introduction of molecular methods such as DNA barcoding and multi-gene phylogenetic approaches. These methods may shed new light on established taxonomic ideas and problems. For example, the classification of ants has aroused much debate due to reinterpretation of morphological characters or contradictions between molecular data and morphology. Only in the last few years a consensus was reached regarding the phylogeny of ant subfamilies. However, the situation remains deplorable for lower taxonomic ranks such as subfamilies, tribes and genera. This thesis describes the systematics and evolution of the Holarctic ant genus Myrmica and the tribe to which it belongs, Myrmicini. Using barcoding, molecular-phylogenetic data and divergence time estimations, it addresses questions regarding the taxonomy, morphology and biogeography of this group. Furthermore, the interrelationships between socially parasitic Myrmica species and their hosts (other species in the genus) were inferred. The phylogeny suggests that social parasitism evolved several times in Myrmica. Finally, this thesis investigated whether coevolution shaped the phylogeny of socially parasitic Maculinea butterflies that live inside Myrmica colonies. No evidence was found for coevolution.
Resumo:
We present some results on multicarrier analysis of magnetotransport data, Both synthetic as well as data from narrow gap Hg0.8Cd0.2Te samples are used to demonstrate applicability of various algorithms vs. nonlinear least square fitting, Quantitative Mobility Spectrum Analysis (QMSA) and Maximum Entropy Mobility Spectrum Analysis (MEMSA). Comments are made from our experience oil these algorithms, and, on the inversion procedure from experimental R/sigma-B to S-mu specifically with least square fitting as an example. Amongst the conclusions drawn are: (i) Experimentally measured resistivity (R-xx, R-xy) should also be used instead of just the inverted conductivity (sigma(xx), sigma(xy)) to fit data to semiclassical expressions for better fits especially at higher B. (ii) High magnetic field is necessary to extract low mobility carrier parameters. (iii) Provided the error in data is not large, better estimates to carrier parameters of remaining carrier species can be obtained at any stage by subtracting highest mobility carrier contribution to sigma from the experimental data and fitting with the remaining carriers. (iv)Even in presence of high electric field, an approximate multicarrier expression can be used to guess the carrier mobilities and their variations before solving the full Boltzmann equation.
Resumo:
This paper describes an algorithm for ``direct numerical integration'' of the initial value Differential-Algebraic Inequalities (DAI) in a time stepping fashion using a sequential quadratic programming (SQP) method solver for detecting and satisfying active path constraints at each time step. The activation of a path constraint generally increases the condition number of the active discretized differential algebraic equation's (DAE) Jacobian and this difficulty is addressed by a regularization property of the alpha method. The algorithm is locally stable when index 1 and index 2 active path constraints and bounds are active. Subject to available regularization it is seen to be stable for active index 3 active path constraints in the numerical examples. For the high index active path constraints, the algorithm uses a user-selectable parameter to perturb the smaller singular values of the Jacobian with a view to reducing the condition number so that the simulation can proceed. The algorithm can be used as a relatively cheaper estimation tool for trajectory and control planning and in the context of model predictive control solutions. It can also be used to generate initial guess values of optimization variables used as input to inequality path constrained dynamic optimization problems. The method is illustrated with examples from space vehicle trajectory and robot path planning.
Resumo:
Virtual Machine (VM) management is an obvious need in today's data centers for various management activities and is accomplished in two phases— finding an optimal VM placement plan and implementing that placement through live VM migrations. These phases result in two research problems— VM placement problem (VMPP) and VM migration scheduling problem (VMMSP). This research proposes and develops several evolutionary algorithms and heuristic algorithms to address the VMPP and VMMSP. Experimental results show the effectiveness and scalability of the proposed algorithms. Finally, a VM management framework has been proposed and developed to automate the VM management activity in cost-efficient way.
Resumo:
Anatomical brain networks change throughout life and with diseases. Genetic analysis of these networks may help identify processes giving rise to heritable brain disorders, but we do not yet know which network measures are promising for genetic analyses. Many factors affect the downstream results, such as the tractography algorithm used to define structural connectivity. We tested nine different tractography algorithms and four normalization methods to compute brain networks for 853 young healthy adults (twins and their siblings). We fitted genetic structural equation models to all nine network measures, after a normalization step to increase network consistency across tractography algorithms. Probabilistic tractography algorithms with global optimization (such as Probtrackx and Hough) yielded higher heritability statistics than 'greedy' algorithms (such as FACT) which process small neighborhoods at each step. Some global network measures (probtrackx-derived GLOB and ST) showed significant genetic effects, making them attractive targets for genome-wide association studies.
Resumo:
Extensible Markup Language ( XML) has emerged as a medium for interoperability over the Internet. As the number of documents published in the form of XML is increasing, there is a need for selective dissemination of XML documents based on user interests. In the proposed technique, a combination of Adaptive Genetic Algorithms and multi class Support Vector Machine ( SVM) is used to learn a user model. Based on the feedback from the users, the system automatically adapts to the user's preference and interests. The user model and a similarity metric are used for selective dissemination of a continuous stream of XML documents. Experimental evaluations performed over a wide range of XML documents, indicate that the proposed approach significantly improves the performance of the selective dissemination task, with respect to accuracy and efficiency.
Resumo:
Extensible Markup Language ( XML) has emerged as a medium for interoperability over the Internet. As the number of documents published in the form of XML is increasing, there is a need for selective dissemination of XML documents based on user interests. In the proposed technique, a combination of Adaptive Genetic Algorithms and multi class Support Vector Machine ( SVM) is used to learn a user model. Based on the feedback from the users, the system automatically adapts to the user's preference and interests. The user model and a similarity metric are used for selective dissemination of a continuous stream of XML documents. Experimental evaluations performed over a wide range of XML documents, indicate that the proposed approach significantly improves the performance of the selective dissemination task, with respect to accuracy and efficiency.
Resumo:
This study analyzes civic activity, citizenship and their gendered manifestations in contemporary Russia. It is based on a case study conducted in the city of Tver , located in the vicinity of Moscow, during 2001-2005. The data consists of interviews with civic activists and municipal and regional authorities; observations of civic organizations; and a quantitative survey conducted among local civic groups. The theoretical and methodological framework of the study draws upon a micro perspective on organization, discourse analysis, gender and citizenship theories and Pierre Bourdieu s theory of fields and capital. This study develops theoretical understanding of the characteristics and logic of civic organization in Russia. It shows that social class centrally structures the field of civic activity. Organizations can be seen as a vehicle of the educated class to advocate their interests, help themselves and seek both social and individual-level change. The study also argues that civic organizations founded during the post-Soviet era are often an institutionalized form of informal social networks. Networks, which were a central element of everyday interaction in Soviet society, are a resource and often the only resource available that can be made use of in contemporary organizational activities. The study argues that gender operates as a key structuring principle in the Russian socio-political community. Civic activity is often discursively associated with femininity and institutional politics with masculinity. Women tend to participate more than men in civic organizations, while men dominate the formal political domain. The study shows that civic organizations are important loci of communality. This communality, however, differs from the communality envisioned in the communitarian and social capital debates in the West. It is selective communality , as it is restricted to the members of the organizations and does not create generalized reciprocity and trust. Civic organizations tend to build upon and reproduce the traditional Russian organizational form of circles , kruzhki. Along with the analysis of civic activities, the study also examines the redefinition of the role and functions of the state. The authorities interviewed in this study understand civic organizations as serving those goals and interests determined by the authorities, instead of viewing them as sites of citizens self-organization around interests and problems citizens themselves deem important, or as a counterforce to the state. By contrast, civic activists understand the core of organizational activity to be advocacy of their interests and rights, tackling social problems, the pursuit of wider social change and self-help. Co-operation between authorities and organizations tends to be personified and based upon unequal, hierarchical patron-client arrangements, which inhibits the development of democratic governance. The study will be published in Routledge Contemporary Russia and Eastern Europe Series later this year.
Resumo:
This study considers the scheduling problem observed in the burn-in operation of semiconductor final testing, where jobs are associated with release times, due dates, processing times, sizes, and non-agreeable release times and due dates. The burn-in oven is modeled as a batch-processing machine which can process a batch of several jobs as long as the total sizes of the jobs do not exceed the machine capacity and the processing time of a batch is equal to the longest time among all the jobs in the batch. Due to the importance of on-time delivery in semiconductor manufacturing, the objective measure of this problem is to minimize total weighted tardiness. We have formulated the scheduling problem into an integer linear programming model and empirically show its computational intractability. Due to the computational intractability, we propose a few simple greedy heuristic algorithms and meta-heuristic algorithm, simulated annealing (SA). A series of computational experiments are conducted to evaluate the performance of the proposed heuristic algorithms in comparison with exact solution on various small-size problem instances and in comparison with estimated optimal solution on various real-life large size problem instances. The computational results show that the SA algorithm, with initial solution obtained using our own proposed greedy heuristic algorithm, consistently finds a robust solution in a reasonable amount of computation time.