The Role of Abduction in Self-Similarity

Based on the Aristotelian criterion referred to as 'abductio', Peirce suggests a method of hypothetical inference, which operates in a different way than the deductive and inductive methods. “Abduction is nothing but guessing” (Peirce, 7.219). This principle is of extreme value for the study of our understanding of mathematical self-similarity in both of its typical presentations: relative or absolute. For the first case, abduction incarnates the quantitative/qualitative relationships of a self-similar object or process; for the second case, abduction makes understandable the statistical treatment of self-similarity, 'guessing' the continuity of geometric features to the infinity through the use of a systematic stereotype (for instance, the assumption that the general shape of the Sierpiński triangle continuates identically into its particular shapes). The metaphor coined by Peirce, of an exact map containig itself the same exact map (a map of itself), is not only the most important precedent of Mandelbrot’s problem of measuring the boundaries of a continuous irregular surface with a logarithmic ruler, but also still being a useful abstraction for the conceptualisation of relative and absolute self-similarity, and its mechanisms of implementation. It is useful, also, for explaining some of the most basic geometric ontologies as mental constructions: in the notion of infinite convergence of points in the corners of a triangle, or the intuition for defining two parallel straight lines as two lines in a plane that 'never' intersect.

A novel approach for large-scale polypeptide folding based on elastic networks using continuous optimization

We present a new computationally efficient method for large-scale polypeptide folding using coarse-grained elastic networks and gradient-based continuous optimization techniques. The folding is governed by minimization of energy based on Miyazawa–Jernigan contact potentials. Using this method we are able to substantially reduce the computation time on ordinary desktop computers for simulation of polypeptide folding starting from a fully unfolded state. We compare our results with available native state structures from Protein Data Bank (PDB) for a few de-novo proteins and two natural proteins, Ubiquitin and Lysozyme. Based on our simulations we are able to draw the energy landscape for a small de-novo protein, Chignolin. We also use two well known protein structure prediction software, MODELLER and GROMACS to compare our results. In the end, we show how a modification of normal elastic network model can lead to higher accuracy and lower time required for simulation.

Growth, self-assembly and dynamics of nano-scale films at fluid interfaces

Ultrathin films at fluid interfaces are important not only from a fundamental point of view as 2D complex fluids but have also become increasingly relevant in the development of novel functional materials. There has been an explosion in the synthesis work in this area over the last decade, giving rise to many exotic nanostructures at fluid interfaces. However, the factors controlling particle nucleation, growth and self-assembly at interfaces are poorly understood on a quantitative level. We will outline some of the recent attempts in this direction. Some of the selected investigations examining the macroscopic mechanical properties of molecular and particulate films at fluid interfaces will be reviewed. We conclude with a discussion of the electronic properties of these films that have potential technological and biological applications.

A four-timescale algorithm for constrained stochastic optimization of RED

The overall performance of random early detection (RED) routers in the Internet is determined by the settings of their associated parameters. The non-availability of a functional relationship between the RED performance and its parameters makes it difficult to implement optimization techniques directly in order to optimize the RED parameters. In this paper, we formulate a generic optimization framework using a stochastically bounded delay metric to dynamically adapt the RED parameters. The constrained optimization problem thus formulated is solved using traditional nonlinear programming techniques. Here, we implement the barrier and penalty function approaches, respectively. We adopt a second-order nonlinear optimization framework and propose a novel four-timescale stochastic approximation algorithm to estimate the gradient and Hessian of the barrier and penalty objectives and update the RED parameters. A convergence analysis of the proposed algorithm is briefly sketched. We perform simulations to evaluate the performance of our algorithm with both barrier and penalty objectives and compare these with RED and a variant of it in the literature. We observe an improvement in performance using our proposed algorithm over RED, and the above variant of it.

An Expenditure-Based Estimation of Self-Employment Income Underreporting in Finland

This paper estimates the extent of income underreporting by the self-employed in Finland using the expenditure based approach developed by Pissarides & Weber (1989). Household spending data are for the years 1994 to 1996. The results suggest that self-employment income in Finland is underreported by some 27% on average. Since income for the self-employed is about 8 % of all incomes in Finland, the size of this part of the black economy in Finland is estimated to be about 2,3% of GDP.

Scheduling parallel batch processors with incompatible job families using ant colony optimization

The present work concerns with the static scheduling of jobs to parallel identical batch processors with incompatible job families for minimizing the total weighted tardiness. This scheduling problem is applicable in burn-in operations and wafer fabrication in semiconductor manufacturing. We decompose the problem into two stages: batch formation and batch scheduling, as in the literature. The Ant Colony Optimization (ACO) based algorithm called ATC-BACO algorithm is developed in which ACO is used to solve the batch scheduling problems. Our computational experimentation shows that the proposed ATC-BACO algorithm performs better than the available best traditional dispatching rule called ATC-BATC rule.

Stress induced phase transition in monomolecular perfluroalkylsilane film self assembled on aluminium surface

We control the stiffnesses of two dual double cantelevers placed in series to control penetration into a perflurooctyltrichlorosilane monolayer self assembled on aluminium and silicon substrates. The top cantilever which carries the probe is displaced with respect to the bottom cantilever which carries the substrate, the difference in displacement recorded using capacitors gives penetration. We further modulate the input displacement sinusoidally to deconvolute the viscoelastic properties of the monolayer. When the intervention is limited to the terminal end of the molecule there is a strong viscous response in consonance with the ability of the molecule to dissipate energy by the generation of gauche defects freely. When the intervention reaches the backbone, at a contact mean pressure of 0.2GPa the damping disappears abruptly and the molecule registers a steep rise in elastic modulus and relaxation time constant, with increasing contact pressure. We offer a physical explanation of the process and describe this change as due to a phase transition from a liquid like to a solid like state.

Protein sequence design on the basis of topology optimization techniques -Using continuous modeling of discrete amino acid types

The notion of optimization is inherent in protein design. A long linear chain of twenty types of amino acid residues are known to fold to a 3-D conformation that minimizes the combined inter-residue energy interactions. There are two distinct protein design problems, viz. predicting the folded structure from a given sequence of amino acid monomers (folding problem) and determining a sequence for a given folded structure (inverse folding problem). These two problems have much similarity to engineering structural analysis and structural optimization problems respectively. In the folding problem, a protein chain with a given sequence folds to a conformation, called a native state, which has a unique global minimum energy value when compared to all other unfolded conformations. This involves a search in the conformation space. This is somewhat akin to the principle of minimum potential energy that determines the deformed static equilibrium configuration of an elastic structure of given topology, shape, and size that is subjected to certain boundary conditions. In the inverse-folding problem, one has to design a sequence with some objectives (having a specific feature of the folded structure, docking with another protein, etc.) and constraints (sequence being fixed in some portion, a particular composition of amino acid types, etc.) while obtaining a sequence that would fold to the desired conformation satisfying the criteria of folding. This requires a search in the sequence space. This is similar to structural optimization in the design-variable space wherein a certain feature of structural response is optimized subject to some constraints while satisfying the governing static or dynamic equilibrium equations. Based on this similarity, in this work we apply the topology optimization methods to protein design, discuss modeling issues and present some initial results.

Self assessment schemes for multi-agent cooperative search

In this paper, we present self assessment schemes (SAS) for multiple agents performing a search mission on an unknown terrain. The agents are subjected to limited communication and sensor ranges. The agents communicate and coordinate with their neighbours to arrive at route decisions. The self assessment schemes proposed here have very low communication and computational overhead. The SAS also has attractive features like scalability to large number of agents and fast decision-making capability. SAS can be used with partial or complete information sharing schemes during the search mission. We validate the performance of SAS using simulation on a large search space consisting of 100 agents with different information structures and self assessment schemes. We also compare the results obtained using SAS with that of a previously proposed negotiation scheme. The simulation results show that the SAS is scalable to large number of agents and can perform as good as the negotiation schemes with reduced communication requirement (almost 20% of that required for negotiation).

Size effect in self consolidating concrete beams with and without notches

The aim of this study is to obtain the fracture characteristics of low and medium compressive strength self consolidating concrete (SCC) for notched and un-notched plain concrete beams by using work of fracture G(F) and size effect model G(f) methods and comparing them with those of normal concrete and high performance concrete. The results show that; (i) with an increase in compressive strength, G(F) increases and G(f) decreases; (ii) with an increase in depth of beam, the decrease in nominal stress of notched beam is more when compared with that of a notchless beam.

Perceptions Towards Adoption of Mobile Self-services: A Case Study (Available in Hanken intranet only)

This thesis is an exploratory case study that aims to understand the attitudes affecting adoption of mobile self-services. This study used a demo mobile self-service that could be used by consumers for making address changes. The service was branded with a large and trusted Finnish brand. The theoretical framework that was used consisted of adoption theories of technology, adoption theories of self-service and literature concerning mobile services. The reviewed adoption theories of both technology and self-service had their foundation in IDT or TRA/TPB. Based on the reviewed theories an initial framework was created. The empirical data collection was done through three computer aided group interview sessions with a total of 32 respondents. The data analysis started from the premises of the initial framework. Based on the empirical data the framework was constantly reviewed and altered and the data recoded accordingly. The result of this thesis was a list of attitudinal factors that affect the adoption of a mobile self-service either positively or negatively. The factors that were found to affect the attitudes towards adoption of mobile self-services positively were: that the service was time & place independent and saved time. Most respondents, but not all, also had a positive attitude towards adoption due to ease of use and being mentally compatible with the service. Factors that affected adoption negatively were lack of technical compatibility, perceived risk for high costs and risk for malicious software. The identified factors were triangulated in respect to existing literature and general attitudes towards mobile services.

A self-consistent formulation for analysis and generation of non-uniform DNA structure

A fully self-consistent formulation is described here for the analysis and generation of base-pairs in non-uniform DNA structures, in terms of various local parameters. It is shown that the internal "wedge parameters" are mathematically related to the parameters describing the base-pair orientation with respect to an external helix axis. Hence any one set of three translation and three rotation parameters are necessary and sufficient to completely describe the relative orientation of the base-pairs comprising a step (or doublet). A general procedure is outlined for obtaining an average or global helix axis from the local helix axes for each step. A graphical representation of the local helix axes in the form of a polar plot is also shown and its application for estimating the curvature of oligonucleotide structures is illustrated, with examples of both A and B type structures.

University Students' Approaches to Learning, Self-Regulation, and Cognitive and Attributional Strategies : Connections with Well-Being and Academic Success

This dissertation empirically explores the relations among three theoretical perspectives: university students approaches to learning, self-regulated learning, as well as cognitive and attributional strategies. The relations were quantitatively studied from both variable- and person-centered perspectives. In addition, the meaning that students gave to their disciplinary choices was examined. The general research questions of the study were: 1) What kinds of relationships exist among approaches to learning, regulation of learning, and cognitive and attributional strategies? What kinds of cognitive-motivational profiles can be identified among university students, and how are such profiles related to study success and well-being? 3) How do university students explain their disciplinary choices? Four empirical studies addressed these questions. Studies I, II, and III were quantitative, applying self-report questionnaires, and Study IV was qualitative in nature. Study I explored relations among cognitive strategies, approaches to learning, regulation of learning, and study success by using correlations and a K-means cluster analysis. The participants were 366 students from various faculties at different phases of their studies. The results showed that all the measured constructs were logically related to each other in both variable- and person-centered approaches. Study II further examined what kinds of cognitive-motivational profiles could be identified among first-year university students (n=436) in arts, law, and agriculture and forestry. Differences in terms of study success, exhaustion, and stress among students with differing profiles were also looked at. By using a latent class cluster analysis (LCCA), three groups of students were identified: non-academic (34%), self-directed (35%), and helpless students (31%). Helpless students reported the highest levels of stress and exhaustion. Self-directed students received the highest grades. In Study III, cognitive-motivational profiles were identified among novice teacher students (n=213) using LCCA. Well-being, epistemological beliefs, and study success were looked at in relation to the profiles. Three groups of students were found: non-regulating (50%), self-directed (35%), and non-reflective (22%). Self-directed students again received the best grades. Non-regulating students reported the highest levels of stress and exhaustion, the lowest level of interest, and showed the strongest preference for certain and practical knowledge. Study IV, which was qualitative in nature, explored how first-year students (n = 536 ) in three fields of studies, arts, law, and veterinary medicine explained their disciplinary choices. Content analyses showed that interest appeared to be a common concept in students description of their choices across the three faculties. However, the objects of interest of the freshmen appeared rather unspecified. Veterinary medicine and law students most often referred to future work or a profession, whereas only one-fifth of the arts students did so. The dissertation showed that combining different theoretical perspectives and methodologies enabled us to build a rich picture of university students cognitive and motivational predispositions towards studying and learning. Further, cognitive-emotional aspects played a significant role in studying, not only in relation to study success, but also in terms of well-being. Keywords: approaches to learning, self-regulation, cognitive and attributional strategies, university students

Distributed nonlinear optimization algorithms for general network problems

There are a number of large networks which occur in many problems dealing with the flow of power, communication signals, water, gas, transportable goods, etc. Both design and planning of these networks involve optimization problems. The first part of this paper introduces the common characteristics of a nonlinear network (the network may be linear, the objective function may be non linear, or both may be nonlinear). The second part develops a mathematical model trying to put together some important constraints based on the abstraction for a general network. The third part deals with solution procedures; it converts the network to a matrix based system of equations, gives the characteristics of the matrix and suggests two solution procedures, one of them being a new one. The fourth part handles spatially distributed networks and evolves a number of decomposition techniques so that we can solve the problem with the help of a distributed computer system. Algorithms for parallel processors and spatially distributed systems have been described.There are a number of common features that pertain to networks. A network consists of a set of nodes and arcs. In addition at every node, there is a possibility of an input (like power, water, message, goods etc) or an output or none. Normally, the network equations describe the flows amoungst nodes through the arcs. These network equations couple variables associated with nodes. Invariably, variables pertaining to arcs are constants; the result required will be flows through the arcs. To solve the normal base problem, we are given input flows at nodes, output flows at nodes and certain physical constraints on other variables at nodes and we should find out the flows through the network (variables at nodes will be referred to as across variables).The optimization problem involves in selecting inputs at nodes so as to optimise an objective function; the objective may be a cost function based on the inputs to be minimised or a loss function or an efficiency function. The above mathematical model can be solved using Lagrange Multiplier technique since the equalities are strong compared to inequalities. The Lagrange multiplier technique divides the solution procedure into two stages per iteration. Stage one calculates the problem variables % and stage two the multipliers lambda. It is shown that the Jacobian matrix used in stage one (for solving a nonlinear system of necessary conditions) occurs in the stage two also.A second solution procedure has also been imbedded into the first one. This is called total residue approach. It changes the equality constraints so that we can get faster convergence of the iterations.Both solution procedures are found to coverge in 3 to 7 iterations for a sample network.The availability of distributed computer systems — both LAN and WAN — suggest the need for algorithms to solve the optimization problems. Two types of algorithms have been proposed — one based on the physics of the network and the other on the property of the Jacobian matrix. Three algorithms have been deviced, one of them for the local area case. These algorithms are called as regional distributed algorithm, hierarchical regional distributed algorithm (both using the physics properties of the network), and locally distributed algorithm (a multiprocessor based approach with a local area network configuration). The approach used was to define an algorithm that is faster and uses minimum communications. These algorithms are found to converge at the same rate as the non distributed (unitary) case.