Mathematics

The objective of this paper is to present the properties and potentials of Gumbel Power function (GuPF) distribution to rainfall and wind speed datasets using the T-X methodology. The density and hazard rate function of the GuPF distribution are unimodal and increasing respectively. Statistical properties of the new distribution such as quantile, moments, and probability weighted moments (PWMs), order statistics and entropy are derived. The Maximum likelihood estimation method is used to estimate the parameters of the proposed model. The superiority of GuPF distribution over other distributions with the same baseline is illustrated using two environmental datasets.

The purposes of the present study were to (1) investigate the effects of the arm movement and initial knee joint angle employed in standing long jump by the ground reaction force analysis and three-dimensional motion analysis; and (2) investigate how the jump performance of the female gender related to the body configuration. Thirty-four healthy adult females performed standing long jump on a force platform with full effort. Body segment and joint angles were analyzed by three-dimensional motion analysis system. Using kinetic and kinematic data, the trajectories on mass center of body, knee joint angle, magnitude of peak takeoff force, and impulse generation in preparing phase were calculated. Average standing long jump performances with free arm motion were +1.5 times above performance with restricted arm motion in both knee initial angles. The performances with knee 90° initial flexion were +1.2 times above performance with knee 45° initial flexion in free and restricted arm motio...

Recently, there are more people jogging with a treadmill at the gym or the home setting. The main available selected modes for treadmill jogging are speed and slope of incline. Increased speeds and incline slopes will not only increase the cardiopulmonary loading but may also alter the lower extremity (LE) movement patterns. There are few systematic investigations of the effect of the speed and incline on LE kinematics. Most studies have used 2D methods which focused on movements in sagittal plane only and this has limitations in the acquired data since lower extremity movements also include frontal and transverse planes. The current study aimed to investigate LE movement during jogging at different speeds and incline slopes using a high speed three-dimensional (3D) motion analysis system.Eighteen young healthy males were recruited. The video-based motion capture system with six CCD cameras, HIRES Expert Vision System (Motion Analysis Corporation, CA, USA), was used to collect kinem...

Pelbagai usaha melibatkan inovasi dan teknologi berkaitan teknik penanaman dan pengeluaran hasil telah diberi penekanan oleh organisasi yang terlibat dalam penanaman kelapa sawit. Usaha ini bertujuan untuk menjamin kesejahteraan pekebun kecil sawit antaranya melalui interaksi dan pendedahan terhadap kaedah penanaman serta aktiviti hiliran. Oleh itu, kajian dilakukan untuk mengenalpasti tindakbalas pekebun kecil sawit terhadap pelbagai inovasi dan teknologi yang diperkenalkan oleh agensi terbabit. Hal ini perlu diberi penekanan kerana maklumat daripada pihak agensi berkaitan menjelaskan bahawa produktiviti per hektar di kawasan kajian tidak mencapai sasaran pengeluaran yang ditetapkan oleh pihak agensi. Seramai 300 orang pekebun kecil sawit di daerah Lahad Datu, Semporna dan Tawau di Sabah telah ditemubual dengan menggunakan soal selidik. Hasil kajian dianalisis secara diskriptif bagi memahami kekangan pekebun kecil sawit terhadap penggunaan inovasi dan teknologi dalam penanaman kelapa sawit di kawasan kajian. Dapatan kajian mendapati majoriti pekebun kecil menjelaskan bahawa kekangan penggunaan inovasi dan teknologi berpunca daripada faktor pemilikan tanah, masalah akses kepada kredit, akses kepada pasaran output dan input serta kekangan terhadap sumber dan bukan sumber. Kekangan tersebut telah mewujudkan jurang interaksi antara organisasi dengan pekebun kecil sawit. Jurang berkenaan telah mendorong mereka untuk terus bergantung kepada orang tengah. Oleh itu, pihak agensi dan pekebun kecil sawit perlu bekerjasama untuk menambahbaik jurang dengan memberi penekanan terhadap program inovasi dan teknologi dalam institusi pekebun kecil.

No. Alumni Universitas HENDRI WAHYUDI No. Alumni Fakultas BIODATA a)Tempat / tanggal lahir: Bukittinggi / 20 Januari 1987 b) Nama orang tua:H.Hirwandi c) Fakultas : Ekonomi d) Jurusan : Manajemen e) No. Bp :0910525170 f) Tanggal Lulus : 02 Mei 2012 g) Predikat Lulus : Sangat Memuaskan h) IPK : 3,01 i) Lama Studi : 2 Tahun10 Bulan h) Alamat Orang Tua : Jl.Hamka No 30B Bukittinggi. PENGARUH BAURAN PROMOSI PADA KEPUTUSAN PEMBELIAN KONSUMEN MOBIL TOYOTA AUTO 2000 CABANG PADANG Skripsi S1 oleh : Hendri Wahyudi Pembimbing : Alfitman, SE.M.Sc ABSTRAK Penelitian ini bertujuan untuk menguji pengaruh bauran promosi pada keputusan pembelian konsumen mobil Toyota Auto 2000 Cabang Padang. Penelitian ini juga bertujuan untuk mengetahui apakah Penjualan perseorangan (X1), Promosi penjualan (X2), Periklanan (X3) dan Hubungan masyarakat (X4) yang mempengaruhi keputusan pembelian konsumen. Dalam penelitian ini populasi yang diambil adalah 100 orang responden yang pernah mengambil keputusan untuk memb...

E-Government merupakan suatu upaya untuk memanfaatkan teknologi informasi dan komunikasi yang dimaksudkan untuk meningkatkan efisiensi, efektivitas, transparansi dan akuntabilitas penyelenggaraan pemerintah dan pelayanan publik. Pengembangan E-Government di Indonesia semakin bergulir dan berjalan seperti penerapan E-Budgeting, E-Procurement, E-Audit, E-Catalog, E-Payment, E-Controlling bahkan hingga E-Health. Kini proses rekrutmen Aparatur Sipil Negara (ASN) pun bisa dilakukan melalui online untuk memudahkan proses pendaftaran dan memilih instansi. Sejauh ini, masih terdapat beberapa kendala yang dialami para pelamar CPNS dalam penggunaan website SSCN. Oleh karena itu, untuk mengetahui tingkat kesuksesan website SSCN dimata pengguna, maka perlu dilakukan pengukuran kesuksesan website dengan menggunakan model DeLone dan McLean (2003). Data yang didapat kemudian diolah dan didapatkan 201 responden dengan data valid. Diperoleh hasil yang menunjukkan terdapat beberapa variabel berpengar...

In recent years P. C. Hammer's problem of determining a convex body from its 'X-ray pictures' was investigated by Gardner and McMullen [4], Gardner [3], Falconer and Volcic . An earlier result is due to Giering . An X-ray picture of a convex body in a direction may be identified with its Steiner symmetral in that direction. Some of these papers consider X-ray pictures taken from points not on the line at infinity, but here we are not concerned with that situation. Gardner and McMullen proved that there exist four directions such that the corresponding X-ray pictures distinguish between all convex bodies, and that no three directions can do this. Giering proved that, given a plane convex body K, there exist three directions depending on K, such that the corresponding X-ray pictures distinguish K from any other convex body. He has also shown that two directions are in general not enough. Convex bodies with the same X-ray pictures as a given one were called 'ghosts' in , in analogy with the ghost densities from computerized tomography .

Flexibility in shape and scale of Burr XII distribution can make close approximation of numerous well-known probability density functions. Due to these capabilities, the usages of Burr XII distribution are applied in risk analysis, lifetime data analysis and process capability estimation. In this paper the Cross-Entropy (CE) method is further developed in terms of Maximum Likelihood Estimation (MLE) to estimate the parameters of Burr XII distribution for the complete data or in the presence of multiple censoring. A simulation study is conducted to evaluate the performance of the MLE by means of CE method for different parameter settings and sample sizes. The results are compared to other existing methods in both uncensored and censored situations.

En este artículo se presenta el diseño, construcción y funcionamiento de un dispositivo móvil de detección de gases o Nariz electrónica, con capacidad de ser controlado y monitoreado en tiempo real de manera remota vía WiFi. En primer lugar, se presenta los componentes principales de la nariz electrónica, como lo son sensores de gas y las tarjetas controladoras, quienes permiten la comunicación y el monitoreo de forma inalámbrica y en tiempo real. Seguido tenemos el diseño mecánico conformado por servomotores, ruedas y chasis, que permite el acople de la nariz electrónica y le brinda movilidad y soporte. Posteriormente se incluye información referente al contenido de la programación de los diferentes componentes, software utilizado y su funcionamiento. Finalmente se plantea la posibilidad de utilizar este dispositivo como una solución de bajo costo al problema que representa para el hombre la medición de diferentes concentraciones de gases, ya sea en lugares desconocidos o difíciles de acceder y que presenten algún tipo de riesgo a la integridad individual o colectiva.

International Journal of Psychology and Psychological Therapy Universidad de Almería (España) riptp@ual.es ISSN (Versión impresa): 1577-7057 ESPAÑA ... 2002 Cristobal Bohórquez / Andrés García / María Teresa Gutiérrez / Jesús Gómez / Vicente Pérez EFECTO DEL ...

BACKGROUND From 2019, science students at the University of Sydney will be required to have high school mathematics. Our research has highlighted biology students lack confidence in mathematics (e.g. Quinnell & Wong, 2007; Quinnell, Thompson & LeBard, 2013; LeBard, Thompson & Quinnell, 2014) and this lack of confidence can be associated with anxiety. We are interested in whether the new HSC maths requirement will impact biology students’ attitudes to, and conceptions of, mathematics, particularly mathematics confidence. Here we offer an early assessment using current data. APPROACHES We surveyed first year biology students in 2015 and 2018 using the Attitudes to Mathematics survey instrument (modified from Fennema and Sherman, Doepken et al; confidence n=12, usefulness n=12), would recommend maths to others (Wismath & Worrall, 2015; n=2), conceptions of Biology (Quinnell, May, Peat & Taylor, 2005; fragmented n=10 and cohesive n=10), and conceptions of mathematics (Crawford, Gordon, ...

Several regularization terms, some of them widely applied to neural networks, such as weight decay and weight elimination, and some others new, are tested when applied to networks with a small number of connections handling continuous variables. These networks are found when using additive algorithms that work by adding processors. First the different methods and their rationale is presented. Then, results are shown, first for curve fitting problems. Since the network constructive algorithm is being used for system modeling, results are also shown for a toy problem that includes recurrency buildup, in order to test the influence of the regularization terms in this process. The results show that this terms can be of help in order to detect unnecessary connections. No clear winner has been found among the presented terms in these tests.

RESUMO. O objetivo deste trabalho foi avaliar o desempenho de duas semeadorasadubadoras oferecidas comercialmente para plantio direto. Os ensaios foram realizados no Sítio Cazarotto, localizado no Distrito de Iguatemi, município de Maringá-Paraná, em Latossolo Vermelho Distrófico onde foram montados dois experimentos. No primeiro, foi utilizada uma semeadora-adubadora com mecanismo dosador do tipo disco horizontal e, o segundo, uma semeadora-adubadora com mecanismo do tipo pneumático. Utilizou-se delineamento de blocos ao acaso em arranjo de parcelas subdivididas com quatro repetições. Os tratamentos principais eram condições de cobertura do solo (vegetação espontânea, aveia dessecada e aveia dessecada + rolada) e os secundários as velocidades de deslocamento (disco horizontal: 4,74; 5,41; 6,47 e 7,24 km h -1 e pneumática: 5,56; 8,04 e 10,21 km h -1 ). Com o aumento da velocidade, a população de plantas e a porcentagem de espaçamentos aceitáveis reduziram, sendo que a população de plantas, agronomicamente, recomendada não foi alcançada por ambas as semeadoras. O mecanismo pneumático obteve melhores resultados que o disco horizontal. A produtividade foi maior onde se obtiveram menores populações, sendo influenciada pelo déficit hídrico. Palavras-chave: população de plantas, distribuição longitudinal, produtividade, soja (Glycine max (L.) Merril) ABSTRACT. Performance of seed distribution mechanisms under different speeds and soil covering conditions. The objective of this work was to evaluate the performance of two seeders offered commercially for no-tillage. The assays were conducted at the Cazarotto Farm, located in the Iguatemi District, municipal district of Maringá, Paraná State, in a HAPLOTOX Soil. Two experiments were set up: the first using a seeder with a horizontal plate distribution mechanism, and the second using a seeder with pneumatic-type mechanism. A split-plot design was used, with four replications. The main treatments were: soil covering conditions (spontaneous vegetation, desiccated black oat, and desiccated + rolled black oat); and the secondary treatments were the forward speeds (horizontal plate: 4.74, 5.41, 6.47 and 7.24 km h -1 ; and pneumatic: 5.56, 8.04 and 10.21 km h -1 ). With the increase in speed, the plant population and the percentage of acceptable spacings were reduced, and the recommended plant population was not reached by either seeder. The pneumatic mechanism obtained better results than the horizontal plate. The yield was larger where smaller populations were obtained, influenced by the water deficit.

Given a random RNA secondary structure, S, we study RNA sequences having fixed ratios of nucleotides that are compatible with S. We perform this analysis for RNA secondary structures subject to various base-pairing rules and minimum arc- and stack-length restrictions. Our main result reads as follows: in the simplex of nucleotide ratios, there exists a convex region, in which, in the limit of long sequences, a random structure asymptotically almost surely (a.a.s.) has compatible sequence with these ratios and outside of which a.a.s. a random structure has no such compatible sequence. We localize this region for RNA secondary structures subject to various base-pairing rules and minimum arc- and stack-length restrictions. In particular, for GC-sequences (GC denoting the nucleotides guanine and cytosine, respectively) having a ratio of G nucleotides smaller than 1/3, a random RNA secondary structure without any minimum arc- and stack-length restrictions has a.a.s. no such compatible se...

Given an alphabet Σ, a (directed) graph G whose edges are weighted and Σ-labeled, and a formal language L ⊆ Σ * , the formal-language-constrained shortest/simple path problem consists of finding a shortest (simple) path p in G complying with the additional constraint that l(p) ∈ L. Here l(p) denotes the unique word obtained by concatenating the Σ-labels of the edges along the path p. The main contributions of this paper include the following: (1) We show that the formal-language-constrained shortest path problem is solvable efficiently in polynomial time when L is restricted to be a context-free language (CFL). When L is specified as a regular language we provide algorithms with improved space and time bounds. (2) In contrast, we show that the problem of finding a simple path between a source and a given destination is NP-hard, even when L is restricted to fixed simple regular languages and to very simple classes of graphs (e.g., complete grids). (3) For the class of treewidth-bounded graphs, we show that (i) the problem of finding a regular-language-constrained simple path between source and destination is solvable in polynomial time and (ii) the extension to finding CFL-constrained simple paths is NP-complete. Our results extend the previous results in [SIAM

We study a class of discrete dynamical systems that is motivated by the generic structure of simulations. The systems consist of the following data: (a) a ®nite graph Y with vertex set f1Y F F F Y ng where each vertex has a binary state, (b) functions p i X F n 2 3 F n 2 and (c) an update ordering p. The functions p i update the binary state of vertex i as a function of the state of vertex i and its Y-neighbors and leave the states of all other vertices ®xed. The update ordering is a permutation of the Y-vertices. By composing the functions p i in the order given by p one obtains the sequential dynamical system (SDS DS): We derive a decomposition result, characterize invertible SDS DS and study ®xed points. In particular we analyse how many dierent SDS D S that can be obtained by reordering a given multiset of update functions and give a criterion for when one can derive concentration results on this number. Finally, some speci®c SDS DS are investigated.

Knowledge of fundamental traffic flow characteristics of traffic simulation models is an essential requirement when using these models for the planning, design, and operation of transportation systems. In this paper we discuss the following: a description of how features relevant to traffic flow are currently under implementation in the TRANSIMS microsimulation, a proposition for standardized traffic flow tests for traffic simulation models, and the results of these tests for two different versions of the TRANSIMS microsimulation.

We present an asymptotically optimal reduction of one-outof-two String Oblivious Transfer to one-out-of-two Bit Oblivious Transfer using Interactive Hashing in conjunction with Privacy Amplification. Interactive Hashing is used in an innovative way to test the receiver's adherence to the protocol. We show that (1 + )k uses of Bit OT suffice to implement String OT for k-bit strings. Our protocol represents a two-fold improvement over the best constructions in the literature and is asymptotically optimal. We then show that our construction can also accommodate weaker versions of Bit OT, thereby obtaining a significantly lower expansion factor compared to previous constructions. Besides increasing efficiency, our constructions allow the use of any 2-universal family of Hash Functions for performing Privacy Amplification. Of independent interest, our reduction illustrates the power of Interactive Hashing as an ingredient in the design of cryptographic protocols.

Quantum 2-party cryptography differs from its classical counterpart in at least one important way: Given blak-box access to a perfect commitment scheme there exists a secure 1-2 quantum oblivious transfer. This reduction proposed by Crépeau and Kilian was proved secure against any receiver by Yao, in the case where perfect commitments are used. However, quantum commitments would normally be based on computational assumptions. A natural question therefore arises: What happens to the security of the above reduction when computationally secure commitments are used instead of perfect ones? In this paper, we address the security of 1-2 QOT when computationally binding string commitments are available. In particular, we analyse the security of a primitive called Quantum Measurement Commitment when it is constructed from unconditionally concealing but computationally binding commitments. As measuring a quantum state induces an irreversible collapse, we describe a QMC as an instance of "computational collapse of a quantum state". In a QMC a state appears to be collapsed to a polynomial time observer who cannot extract full information about the state without breaking a computational assumption. We reduce the security of QMC to a weak binding criteria for the string commitment. We also show that secure QMCs implies QOT using a straightforward variant of the reduction above.

Noisy channels are a valuable resource from a cryptographic point of view. They can be used for exchanging secret-keys as well as realizing other cryptographic primitives such as commitment and oblivious transfer. To be really useful, noisy channels have to be consider in the scenario where a cheating party has some degree of control over the channel characteristics. Damg ård et al. (EUROCRYPT 1999) proposed a more realistic model where such level of control is permited to an adversary, the so called unfair noisy channels, and proved that they can be used to obtain commitment and oblivious transfer protocols. Given that noisy channels are a precious resource for cryptographic purposes, one important question is determining the optimal rate in which they can be used. The commitment capacity has already been determined for the cases of discrete memoryless channels and Gaussian channels. In this work we address the problem of determining the commitment capacity of unfair noisy channels. We compute a single-letter characterization of the commitment capacity of unfair noisy channels. In the case where an adversary has no control over the channel (the fair case) our capacity reduces to the well-known capacity of a discrete memoryless binary symmetric channel.

The Wire-Tap Channel of Wyner shows that a Binary Symmetric Channel may be used as a basis for exchanging a secret key, in a crypt,ographic scenario of two honest people facing an eavesdropper. Later CrCpeau and Kilian showed how a BSC may be used to implement Oblivious Transfer in a cryptographic scenario of two possibly dishonest people facing each other. Unfortunately this result is rather impractical as it requires f l ( n " ) bits to be transmitted through the BSC to accomplish a single OT. The current paper provides efficient protocols to achieve the cryptographic primitives of Bit Commitment and Oblivious Transfer based on the existence of a Binary Symmetric Channel. Our protocols respectively require sending O(n) and O ( n 3 ) bits through the BSC. These results are based on a technique known as Generalized Privacy Amplification [l] that allow two people to extract secret information from partially compromised data. * Supported in part by Qukbec's FCAR and Canada's NSERC.

Assume A owns two secret k-bit strings. She is willing to disclose one of them to B , at his choosing, provided he does not learn anything about the other string. Conversely, B does not want A to learn which secret he chose to learn. A protocol for the above task is said to implement One-out-of-two String Oblivious Transfer, denoted (:)-OTk. This primitive is particularly useful in a variety of cryptographic settings. An apparently simpler task corresponds to the case k = 1 of two one-bit secrets: this is known as One-out-of-two Bit Oblivious Transfer, denoted (:)-OT. We address the question of reducing (:)-OTk to (:)-OT. This question is not new: it was introduced in 1986. However, most solutions until now have implicitly or explicitly depended on the notion of self-intersecting codes. It can be proved that this restriction makes it asymptotically impossible to implement (:)-OTk with fewer than about 3.5277k instances of (:)-OT. The current paper introduces the idea of using privacy amplification as underlying technique to reduce (:)-Ork to (:)-OT. This allows for more efficient solutions at the cost of an exponentially small probability of failure: it is sufficient t,o use slightly more than 2k instances of (:)-OT in order to implement (f)-OTk. Moreover, we show that privacy amplification allows for the efficient implementation of (:)-OTk from generalized versions of (:)-OT that would not have been suitable for the earlier techniques based on self-intersecting codes. An application of this more general reduction is given.

The foundation of zero-knowledge is the simulator : a weak machine capable of pretending to be a weak verifier talking with allpowerful provers. To achieve this, simulators need some kind of advantage such as the knowledge of a trapdoor. In existing zero-knowledge multiprover protocols, this advantage is essentially signalling, something that the provers are explicitly forbidden to do. This advantage is stronger than necessary, as it is possible to define a sense in which simulators need much less to simulate. We define a framework in which we can quantify the simulators' non-local advantage and exhibit examples of zero-knowledge protocols that are sound against local or entangled provers that are not sound against no-signalling provers precisely because the no-signalling simulation strategy can be adopted by malicious provers.

In multi-prover interactive proofs (MIPs), the verifier is usually non-adaptive. This stems from an implicit problem which we call "contamination" by the verifier. We make explicit the verifier contamination problem, and identify a solution by constructing a generalization of the MIP model. This new model quantifies non-locality as a new dimension in the characterization of MIPs. A new property of zero-knowledge emerges naturally as a result by also quantifying the non-locality of the simulator.

Secure multi-party computing, also called secure function evaluation, has been extensively studied in classical cryptography. We consider the extension of this task to computation with quantum inputs and circuits. Our protocols are information-theoretically secure, i.e. no assumptions are made on the computational power of the adversary. For the weaker task of verifiable quantum secret sharing, we give a protocol which tolerates any t < n/4 cheating parties (out of n). This is shown to be optimal. We use this new tool to show how to perform any multi-party quantum computation as long as the number of dishonest players is less than n/6.

Iu their 1985 paper, Goldwasser, Micah and Rackoff set forth the notion of zeroknowledge interactive proofs [GMRl]. This seminal paper generated considerable activity around the world. In the span of a few years, a substantial number of results were obtained by different groups of researchers. Among those, the following two theorems make an intriguing pair: . Fortnow [F], together with Boppana, Hasrud and Zachos [BHZ]: The existence of a perfect zero-knowledge protocol for an NP-complete problem would imply that the polynomial hierarchy collapses. l Brussard, Chazm and Cr6peau [BCC]: There exists a perfect zero-knowledge protocol for satisfiability. Nevertheless, the polynomial hierarchy has not collapsed! Of course, the resolution of this apparent paradox is that the above two results strongly depend on fundamentally incompatible definitions of what a protocol is. The purpose of this paper is to explain the various notions involved and to offer a new terminology that emphasizes their differences. There are two orthogonal aspects to zero-knowledge interactive proofs. One is the notion of zero-knowledge and the other is the notion of interactive proof. Unfortunately, these two notions are often thought to be inseparable. This confusion is reminiscent of the long lasting confusion among many people between public-key encryption and digital signature. It is clear that interactive proofs make sense independently of zero-knowledge (after all, Babai's Arthur-Merlin games pa] were invented independently of [GMRl]), but it is more subtle to see that a protocol could be zero-knowledge without being an interactive proof.

We coiisider a situation where two parties, Alice and Bob, share a common secret string arid would like to mutually check their knowledge of that string. We describe a simple and efficient protocol based on the exchange of quantum information to check mutual knowledge of a common string in such a way that honest parties will always succeed in convincing each other, while a dishonest party interacting with an honest party will have vanishingly small probability of convincing him. Moieover, a dishonest party gains only d very small amount, of information about t,he secret string from running the protocol: whoever enters the protocol with no knowledge of the secret string would have to enter this protocol an exponential number of times in order to gain non-negligible information about the string. Our scheme offers an efficient identification technique with a security that depends on no computational assumption, only on the correctness of quantum mechanics. We believe such a system should be used in smartcards to avoid frauds from typing PIN codes to dishonest teller machines. Weren't you worried tlie last time you typed your PIN (Personal Identification Number) to an unknown teller machine that it could be a fake and that its sole purpose could he to steal your PIN? According to a recent headline of the NY Times [as] maybe YOU should worry: The problem with current identification systems is that the customer must trust tlie equipment to which he types his PIN. It is completely trivial to modify a teller machine to memorize the PIN numbers that people type to it. PINS are meant to be checked, not given. (Consult [I] for an extensive study of frauds at teller machines.) Of course, it is always possible to completely solve the problem of identification and authentication of messages by classical methods that require

In this paper, we consider the problem of selecting an implementation of each circuit module from a cell library so as to satisfy overall delay and area (or delay and power) requirements. Two versions of the circuit implementation problem, basic circuit implementation problem and the general circuit implementation problem are shown to be NP-hard. A pseudo-polynomial time algorithm for the basic circuit implementation problem on series-parallel circuits is developed, and heuristics for the basic circuit implementation problem on general circuits are formulated and experimented with. Manuscript

O(k log N) algonthms are obtained to permute and sort N data items on cube and perfect shuffle computers with N 1+1/k processing elements, 1 __<_ k -< log N These algorithms lead directly to a generahzedconnecuon-network construction having O(klog N) delay and O(kNX+l/klog N) contact pairs. This network has the advantage that the switches can be set m O(klog N) t~me by either a cube or perfect shuffle computer with N ~+~/h processing elements. Categories and SubJect Descriptors. B 4 3 [Input~Output and Data Communications] Interconnecuons (Subsystems)--topology, C. 1.2 [Processor Architectures]. Multiple Data Stream Architectures (MulUprocessors)--mterconnect:on architectures, parallel processors, single-instruct:on-stream multiple-data-stream architectures (SIMD); F 2 2 [Analysis of Algorithms and Problem Complexity] Nonnumencal Algorithms and Problems--routing and layout, sorting and searching

Absrracr-This paper extends the polynominal time algorithm obtained in [7] to find a minimal cardinality path set that long covers each lead or gate input of a digital logic circuit. The extension of this paper allows one to find, in polynominal time, a minimal cardinality path set that both long and short covers these leads or gate inputs.

La presente investigacion tuvo por objetivo identificar los factores que influyen en la produccion del platano (Musa AAB) en el Ecuador periodo 2014-2016, se estudio variables agronomicas generales consideradas en la Encuesta de Superficie y Produccion Agropecuaria Continua (ESPAC), el estudio fue de alcance descriptivo y correlacional causal porque se aplico el analisis factorial de datos mixtos (AFDM) y el analisis de regresion lineal multiple con variables dummy (ARLMVD), todo esto usando el software estadistico R version 3.4.2 con la ayuda de la hoja de calculo Excel 2016. El estudio tambien utilizo metodos estadisticos descriptivos y bivariados, en donde se determino que la mayor produccion del platano en el pais se da entre 0.23 y 183 toneladas metricas, por otro lado, la variable produccion del platano tiene una relacion lineal positiva perfecta con la variable ventas, una relacion lineal positiva muy alta con las variables: superficie plantada, superficie en edad productiva ...

Background: Within the structural and grammatical bounds of a common language, all authors develop their own distinctive writing styles. Whether the relative occurrence of common words can be measured to produce accurate models of authorship is of particular interest. This work introduces a new score that helps to highlight such variations in word occurrence, and is applied to produce models of authorship of a large group of plays from the Shakespearean era. Methodology: A text corpus containing 55,055 unique words was generated from 168 plays from the Shakespearean era (16th and 17th centuries) of undisputed authorship. A new score, CM1, is introduced to measure variation patterns based on the frequency of occurrence of each word for the authors John Fletcher, Ben Jonson, Thomas Middleton and William Shakespeare, compared to the rest of the authors in the study (which provides a reference of relative word usage at that time). A total of 50 WEKA methods were applied for Fletcher, Jonson and Middleton, to identify those which were able to produce models yielding over 90% classification accuracy. This ensemble of WEKA methods was then applied to model Shakespearean authorship across all 168 plays, yielding a Matthews' correlation coefficient (MCC) performance of over 90%. Furthermore, the best model yielded an MCC of 99%. Our results suggest that different authors, while adhering to the structural and grammatical bounds of a common language, develop measurably distinct styles by the tendency to over-utilise or avoid particular common words and phrasings. Considering language and the potential of words as an abstract chaotic system with a high entropy, similarities can be drawn to the Maxwell's Demon thought experiment; authors subconsciously favour or filter certain words, modifying the probability profile in ways that could reflect their individuality and style.

This paper contains a survey of main results in the theory of invariant subspaces that have a direct or intermediate connection with the well-known list of problems in operator theory posed by Halmos in 1970. For most results we present brief proofs, schemes of proofs, or basic ideas of proofs. Bibliography: 124 titles.

Many phenomena are complex and therefore difficult to measure and to evaluate. Research, in the last years, has been focusing on the development and use of a system of Composite Indicators in order to obtain a global description of a complex phenomenon and to convey a suitable synthesis of information. The existing literature offers several alternative methods for obtaining a Composite Indicators. The work focuses on building them through to Structural Equation Modeling, specifically with the use of Partial Least Squares-Path Modeling. In recent years many advances have been developed, in the context of these models to solve some problems related to the role that the Composite Indicators play within that system; in particular, the research focuses on a particular aspect linked to the high level of abstraction, when a Composite Indicator is manifold, lacks its own manifest variables and is described by various underlying blocks. In this regard we have proposed two alternative methods for analyzing and studying higher-order construct Composite Indicator, on the calculation of the estimates for the determination of endogenous block, so as to be the best estimated and represented by the blocks below.

Composite indicators (CIs), in the social sciences, are used more and more for measuring very complex phenomena as the poverty, the progress and the well-being. Using an approach Model Based in to build CIs, instead of an approach Data Driven, it is possible to consider the role (formative and reflective) of the manifest variables (MVs) and to model the relationships among the CIs. In this article, we begin introducing structural equation modeling (SEM) as a tool for building Model Based CIs. Secondly, among the several methods developed to estimate SEM, we show Partial Least Squares Path Modeling (PLS-PM), due to the key role that estimation of the latent variables (i.e. the CIs) plays in the estimation process. Moreover, we present some recent developments in PLS-PM for the treatment of non metric data, hierarchical data, longitudinal data and multi-block data. Finally, we demonstrate how these recent developments can strongly help in the building of CIs. It is easy to realize, for example, that as a consequence of considering nominal and ordinal data, the knowledge about a phenomenon synthesized by a CI is considerably extended and improved especially for operational use. In order to highlight the potentiality of the proposed approach, the construction of a CI is discussed. In particular, a CI of Social Cohesion, developed by using European Values Study data, will be described in detail.

Partial least squares path modeling presents some inconsistencies in terms of coherence with the predictive directions specified in the inner model (i.e. the path directions), because the directions of the links in the inner model are not taken into account in the iterative algorithm. In fact, the procedure amplifies interdependence among blocks and fails to distinguish between dependent and explanatory blocks. The method proposed in this paper takes into account and respects the specified path directions, with the aim of improving the predictive ability of the model and to maintain the hypothesized theoretical inner model. To highlight its properties, the proposed method is compared to the classical PLS path modeling in terms of explained variability, predictive relevance and interpretation using artificial data through a real data application. A further development of the method allows to treat multi-dimensional blocks in composite-based path modeling.

The Vassiliev conjecture states that the Vassiliev invariants are dense in the space of all numerical link invariants in the sense that any link invariant is a pointwise limit of Vassiliev invariants. In this article, we prove that the Vassiliev conjecture holds in the case of the coefficients of the HOMFLY and the Kauffman polynomials. Contents 1 Reducing the problem: the weak Vassiliev conjecture 2 2 Approximation of the coefficients of the HOMFLYPT polynomial by Vassiliev invariants 3 2.1 Notations .

Khovanov homology for knots has generated a flurry of activity in the topology community. This paper studies the Khovanov type cohomology for graphs with a special attention to torsions. When the underlying algebra is Z[x]/(x 2), we determine precisely those graphs whose cohomology contains torsion. For a larger class of algebras, we show that torsion often occurs. Our investigation of torsion led to other related general results. The ideas of this paper could potentially be used to predict the Khovanov-Rozansky sl(m) homology of knots (in particular (2, n) torus knots). We also predict that our work is connected with Hochschild and Connes cyclic

Khovanov homology for knots has generated a flurry of activity in the topology community. This paper studies the Khovanov type cohomology for graphs with a special attention to torsion. When the underlying algebra is Z[x]/(x 2), we determine precisely those graphs whose cohomology contains torsion. For a large class of algebras, we show that torsion often occurs. Our investigation of torsion led to other related general results. Our computation could potentially be used to predict the Khovanov-Rozansky sl(m) homology of knots (in particular (2,n) torus knot). We also predict that our work is

The Vassiliev conjecture states that the Vassiliev invariants are dense in the space of all numerical link invariants in the sense that any link invariant is a pointwise limit of Vassiliev invariants. In this article, we prove that the Vassiliev conjecture holds in the case of the coefficients of the HOMFLY and the Kauffman polynomials.

Khovanov homology for knots has generated a flurry of activity in the topology community. This paper studies the Khovanov type cohomology for graphs with a special attention to torsion. When the underlying algebra is Z[x]/(x 2 ), we determine precisely those graphs whose cohomology contains torsion. For a large class of algebras, we show that torsion often occurs. Our investigation of torsion led to other related general results. Our computation could potentially be used to predict the Khovanov-Rozansky sl(m) homology of knots (in particular (2, n) torus knot). We also predict that our work is connected with Hochschild and Connes cyclic homology of algebras.

In this study, the differences between the socio economic characteristics and agricultural applications of the producers who had soil analysis and those who did not were determined in Edirne and Tekirdağ provinces, and a comparative analysis was done in terms of fertilization and soil analysis applications. In each province, 3 laboratories which had the most sample acceptance number for soil analysis were selected. In 2015, a total of 200 producers were interviewed, including 60 producers from 20 producers who applied to the laboratories and benefited from soil analysis subsidies, and 40 producers with similar characteristics who did not benefit from soil analysis subsidies in the same regions. The differences between the socio-economic characteristics of the producers were determined by non-linear canonical correlation analysis. It was seen that the education level of the producers, the total size of the land they cultivated, having non-agricultural income and having agricultural insurance were the most important variables in the differences between the producers who had soil analysis and those who did not.

Efficient Use of Nitrogen in Cropping Systems Efficient use of N in cropping systems is often viewed from agronomic, economic, or environmental perspectives. A given N management system may provide highly efficient use of N from one perspective but be relatively inefficient from another. This chapter reviews basic factors affecting N use efficiency (NUE) from agronomic, economic, and environmental perspectives and discusses interrelationships among these perspectives. The agronomic section reviews ways of characterizing NUE based on yield and N recovery in relation to N inputs and discusses physical potentials and limitations for improving these relationships. Since Chapt. 17 (this book) deals with the role of N in attaining high yield potentials, the agronomic section in this chapter emphasizes factors affecting the slope of yield curves rather than factors affecting maximum yield levels with a nonlimiting N rate. The economic section reviews factors that determine optimum N rates and discusses economic considerations for optimizing inputs (e.g., application practices and nitrification inhibitors) that affect the slope of yield curves. The environmental section examines relationships between N fertilizer recovery and environmental impact of N fertilizer use and also environmental implications of maximizing return from N fertilizer use. I. AGRONOMIC PERSPECTIVE A. Characterizing Efficiency The phrase N use efficiency (NUE) usually has referred to relationships between yield and N rate (yield efficiency), N recovered and N rate (N recovery efficiency), or yield and N recovered (physiological efficiency). For