A note on limited pushdown alphabets in stateless deterministic pushdown automata

Czech Academy of Sciences Publication Activity Database

Masopust, Tomáš

2013-01-01

Roč. 24, č. 3 (2013), s. 319-328 ISSN 0129-0541 R&D Projects: GA ČR(CZ) GPP202/11/P028 Institutional support: RVO:67985840 Keywords : deterministic pushdown automata * stateless pushdown automata * realtime pushdown automata Subject RIV: BA - General Mathematics Impact factor: 0.326, year: 2013 http://www.worldscientific.com/doi/abs/10.1142/S0129054113500068

Greedy Algorithms for Nonnegativity-Constrained Simultaneous Sparse Recovery

Science.gov (United States)

Kim, Daeun; Haldar, Justin P.

2016-01-01

This work proposes a family of greedy algorithms to jointly reconstruct a set of vectors that are (i) nonnegative and (ii) simultaneously sparse with a shared support set. The proposed algorithms generalize previous approaches that were designed to impose these constraints individually. Similar to previous greedy algorithms for sparse recovery, the proposed algorithms iteratively identify promising support indices. In contrast to previous approaches, the support index selection procedure has been adapted to prioritize indices that are consistent with both the nonnegativity and shared support constraints. Empirical results demonstrate for the first time that the combined use of simultaneous sparsity and nonnegativity constraints can substantially improve recovery performance relative to existing greedy algorithms that impose less signal structure. PMID:26973368

Greedy Algorithms for Reduced Bases in Banach Spaces

KAUST Repository

DeVore, Ronald

2013-02-26

Given a Banach space X and one of its compact sets F, we consider the problem of finding a good n-dimensional space X n⊂X which can be used to approximate the elements of F. The best possible error we can achieve for such an approximation is given by the Kolmogorov width dn(F)X. However, finding the space which gives this performance is typically numerically intractable. Recently, a new greedy strategy for obtaining good spaces was given in the context of the reduced basis method for solving a parametric family of PDEs. The performance of this greedy algorithm was initially analyzed in Buffa et al. (Modél. Math. Anal. Numér. 46:595-603, 2012) in the case X=H is a Hilbert space. The results of Buffa et al. (Modél. Math. Anal. Numér. 46:595-603, 2012) were significantly improved upon in Binev et al. (SIAM J. Math. Anal. 43:1457-1472, 2011). The purpose of the present paper is to give a new analysis of the performance of such greedy algorithms. Our analysis not only gives improved results for the Hilbert space case but can also be applied to the same greedy procedure in general Banach spaces. © 2013 Springer Science+Business Media New York.

Formal Modeling of Greedy Nodes in 802.15.4 WSN

Directory of Open Access Journals (Sweden)

Youcef Hammal

2015-06-01

Full Text Available This paper deals with formal specification of the non-slotted CSMA/CA protocol in wireless sensor networks(WSN whose some nodes own a greedy behavior. This protocol requires sensor nodes to wait some time before initiating a transmission, whereas greedy nodes may try to reduce their waiting duration, which may penalize other nodes. To analyze their impact on WSN mode in operation, we use timed automata of the model-checker UPPAAL to capture the abstract behavior of communication medium, sane, and greedy nodes in WSN. This enables the use of analysis tools to check whether these models satisfy intended properties.

Greedy algorithms withweights for construction of partial association rules

KAUST Repository

Moshkov, Mikhail; Piliszczu, Marcin; Zielosko, Beata Marta

2009-01-01

This paper is devoted to the study of approximate algorithms for minimization of the total weight of attributes occurring in partial association rules. We consider mainly greedy algorithms with weights for construction of rules. The paper contains bounds on precision of these algorithms and bounds on the minimal weight of partial association rules based on an information obtained during the greedy algorithm run.

Greedy algorithms withweights for construction of partial association rules

KAUST Repository

Moshkov, Mikhail

2009-09-10

This paper is devoted to the study of approximate algorithms for minimization of the total weight of attributes occurring in partial association rules. We consider mainly greedy algorithms with weights for construction of rules. The paper contains bounds on precision of these algorithms and bounds on the minimal weight of partial association rules based on an information obtained during the greedy algorithm run.

Deterministic Greedy Routing with Guaranteed Delivery in 3D Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Su Xia

2014-05-01

Full Text Available With both computational complexity and storage space bounded by a small constant, greedy routing is recognized as an appealing approach to support scalable routing in wireless sensor networks. However, significant challenges have been encountered in extending greedy routing from 2D to 3D space. In this research, we develop decentralized solutions to achieve greedy routing in 3D sensor networks. Our proposed approach is based on a unit tetrahedron cell (UTC mesh structure. We propose a distributed algorithm to realize volumetric harmonic mapping (VHM of the UTC mesh under spherical boundary condition. It is a one-to-one map that yields virtual coordinates for each node in the network without or with one internal hole. Since a boundary has been mapped to a sphere, node-based greedy routing is always successful thereon. At the same time, we exploit the UTC mesh to develop a face-based greedy routing algorithm and prove its success at internal nodes. To deliver a data packet to its destination, face-based and node-based greedy routing algorithms are employed alternately at internal and boundary UTCs, respectively. For networks with multiple internal holes, a segmentation and tunnel-based routing strategy is proposed on top of VHM to support global end-to-end routing. As far as we know, this is the first work that realizes truly deterministic routing with constant-bounded storage and computation in general 3D wireless sensor networks.

Two-pass greedy regular expression parsing

DEFF Research Database (Denmark)

Grathwohl, Niels Bjørn Bugge; Henglein, Fritz; Nielsen, Lasse

2013-01-01

We present new algorithms for producing greedy parses for regular expressions (REs) in a semi-streaming fashion. Our lean-log algorithm executes in time O(mn) for REs of size m and input strings of size n and outputs a compact bit-coded parse tree representation. It improves on previous algorithms...... by: operating in only 2 passes; using only O(m) words of random-access memory (independent of n); requiring only kn bits of sequentially written and read log storage, where k ... and not requiring it to be stored at all. Previous RE parsing algorithms do not scale linearly with input size, or require substantially more log storage and employ 3 passes where the first consists of reversing the input, or do not or are not known to produce a greedy parse. The performance of our unoptimized C...

Heuristic rules analysis on the fuel cells design using greedy search;Analisis de reglas heuristicas en el diseno de celdas de combustible usando busqueda greedy

Energy Technology Data Exchange (ETDEWEB)

Ortiz, J. J.; Castillo, J. A.; Montes, J. L.; Hernandez, J. L., E-mail: juanjose.ortiz@inin.gob.m [ININ, Carretera Mexico-Toluca s/n, 52750 Ocoyoacac, Estado de Mexico (Mexico)

2009-10-15

This work approaches the study of one of the heuristic rules of fuel cells design for boiling water nuclear reactors. This rule requires that the minor uranium enrichment is placed in the corners of the fuel cell. Also the search greedy is applied for the fuel cells design where explicitly does not take in count this rule, allowing the possibility to place any uranium enrichment with the condition that it does not contain gadolinium. Results are shown in the quality of the obtained cell by search greedy when it considers the rule and when not. The cell quality is measured with the value of the power pick factor obtained, as well as of the neutrons multiplication factor in an infinite medium. Cells were analyzed with 1 and 2 gadolinium concentrations low operation conditions at 120% of the nominal power of the reactors of the nuclear power plant of Laguna Verde. The results show that not to consider the rule in cells with a single gadolinium concentration, it has as repercussion that the greedy search has a minor performance. On the other hand with cells of two gadolinium concentrations, the performance of the greedy search was better. (Author)

Resistance against brute-force attacks on stateless forwarding in information centric networking

OpenAIRE

Alzahrani, Bander A.; Reed, Martin J.; Vassilakis, Vassilios G.

2015-01-01

Line Speed Publish/Subscribe Inter-networking (LIPSIN) is one of the proposed forwarding mechanisms in Information Centric Networking (ICN). It is a stateless source-routing approach based on Bloom filters. However, it has been shown that LIPSIN is vulnerable to brute-force attacks which may lead to distributed denial-of-service (DDoS) attacks and unsolicited messages. In this work, we propose a new forwarding approach that maintains the advantages of Bloom filter based forwarding while allow...

Perimeter security for Minnesota correctional facilities

Energy Technology Data Exchange (ETDEWEB)

Crist, D. [Minnesota Department of Corrections, St. Paul, MN (United States); Spencer, D.D. [Sandia National Labs., Albuquerque, NM (United States)

1996-12-31

For the past few years, the Minnesota Department of Corrections, assisted by Sandia National Laboratories, has developed a set of standards for perimeter security at medium, close, and maximum custody correctional facilities in the state. During this process, the threat to perimeter security was examined and concepts about correctional perimeter security were developed. This presentation and paper will review the outcomes of this effort, some of the lessons learned, and the concepts developed during this process and in the course of working with architects, engineers and construction firms as the state upgraded perimeter security at some facilities and planned new construction at other facilities.

Heuristic rules analysis on the fuel cells design using greedy search

International Nuclear Information System (INIS)

Ortiz, J. J.; Castillo, J. A.; Montes, J. L.; Hernandez, J. L.

2009-10-01

This work approaches the study of one of the heuristic rules of fuel cells design for boiling water nuclear reactors. This rule requires that the minor uranium enrichment is placed in the corners of the fuel cell. Also the search greedy is applied for the fuel cells design where explicitly does not take in count this rule, allowing the possibility to place any uranium enrichment with the condition that it does not contain gadolinium. Results are shown in the quality of the obtained cell by search greedy when it considers the rule and when not. The cell quality is measured with the value of the power pick factor obtained, as well as of the neutrons multiplication factor in an infinite medium. Cells were analyzed with 1 and 2 gadolinium concentrations low operation conditions at 120% of the nominal power of the reactors of the nuclear power plant of Laguna Verde. The results show that not to consider the rule in cells with a single gadolinium concentration, it has as repercussion that the greedy search has a minor performance. On the other hand with cells of two gadolinium concentrations, the performance of the greedy search was better. (Author)

Greedy Deep Dictionary Learning

OpenAIRE

Tariyal, Snigdha; Majumdar, Angshul; Singh, Richa; Vatsa, Mayank

2016-01-01

In this work we propose a new deep learning tool called deep dictionary learning. Multi-level dictionaries are learnt in a greedy fashion, one layer at a time. This requires solving a simple (shallow) dictionary learning problem, the solution to this is well known. We apply the proposed technique on some benchmark deep learning datasets. We compare our results with other deep learning tools like stacked autoencoder and deep belief network; and state of the art supervised dictionary learning t...

Fire Perimeters

Data.gov (United States)

California Natural Resource Agency — The Fire Perimeters data consists of CDF fires 300 acres and greater in size and USFS fires 10 acres and greater throughout California from 1950 to 2003. Some fires...

Comparison of greedy algorithms for α-decision tree construction

KAUST Repository

Alkhalid, Abdulaziz; Chikalov, Igor; Moshkov, Mikhail

2011-01-01

A comparison among different heuristics that are used by greedy algorithms which constructs approximate decision trees (α-decision trees) is presented. The comparison is conducted using decision tables based on 24 data sets from UCI Machine Learning Repository [2]. Complexity of decision trees is estimated relative to several cost functions: depth, average depth, number of nodes, number of nonterminal nodes, and number of terminal nodes. Costs of trees built by greedy algorithms are compared with minimum costs calculated by an algorithm based on dynamic programming. The results of experiments assign to each cost function a set of potentially good heuristics that minimize it. © 2011 Springer-Verlag.

Comparison of Greedy Algorithms for Decision Tree Optimization

KAUST Repository

Alkhalid, Abdulaziz; Chikalov, Igor; Moshkov, Mikhail

2013-01-01

This chapter is devoted to the study of 16 types of greedy algorithms for decision tree construction. The dynamic programming approach is used for construction of optimal decision trees. Optimization is performed relative to minimal values

24 CFR 3285.307 - Perimeter support piers.

Science.gov (United States)

2010-04-01

... URBAN DEVELOPMENT MODEL MANUFACTURED HOME INSTALLATION STANDARDS Foundations § 3285.307 Perimeter support piers. (a) Piers required at mate-line supports, perimeter piers, and piers at exterior wall...

Tackling Error Propagation through Reinforcement Learning: A Case of Greedy Dependency Parsing

OpenAIRE

Le, Minh; Fokkens, Antske

2017-01-01

Error propagation is a common problem in NLP. Reinforcement learning explores erroneous states during training and can therefore be more robust when mistakes are made early in a process. In this paper, we apply reinforcement learning to greedy dependency parsing which is known to suffer from error propagation. Reinforcement learning improves accuracy of both labeled and unlabeled dependencies of the Stanford Neural Dependency Parser, a high performance greedy parser, while maintaining its eff...

Trapped in Statelessness: Rohingya Refugees in Bangladesh.

Science.gov (United States)

Milton, Abul Hasnat; Rahman, Mijanur; Hussain, Sumaira; Jindal, Charulata; Choudhury, Sushmita; Akter, Shahnaz; Ferdousi, Shahana; Mouly, Tafzila Akter; Hall, John; Efird, Jimmy T

2017-08-21

The Rohingya people are one of the most ill-treated and persecuted refugee groups in the world, having lived in a realm of statelessness for over six generations, and who are still doing so. In recent years, more than 500,000 Rohingyas fled from Myanmar (Burma) to neighboring countries. This article addresses the Rohingya refugee crisis in Bangladesh, with special emphasis on the living conditions of this vulnerable population. We reviewed several documents on Rohingya refugees, visited a registered refugee camp (Teknaf), collected case reports, and conducted a series of meetings with stakeholders in the Cox's Bazar district of Bangladesh. A total of 33,131 registered Rohingya refugees are living in two registered camps in Cox's Bazar, and up to 80,000 additional refugees are housed in nearby makeshift camps. Overall, the living conditions of Rohingya refugees inside the overcrowded camps remain dismal. Mental health is poor, proper hygiene conditions are lacking, malnutrition is endemic, and physical/sexual abuse is high. A concerted diplomatic effort involving Bangladesh and Myanmar, and international mediators such as the Organization of Islamic Countries and the United Nations, is urgently required to effectively address this complex situation.

Sistem Pencarian Hotel Berdasarkan Rute Perjalanan Terpendek Dengan Mempertimbangkan Daya Tarik Wisata Menggunakan Algoritma Greedy

Directory of Open Access Journals (Sweden)

Audrey Maximillian Herli

2015-04-01

Full Text Available Hotel search was an important thingfor travelers in their traveling journey. Travelers would consider criteria such as class, price and review of the hotel.Beside those things, distance between Hotel and tourist attractionswasalsoimportant factor to be considered. In this research, system was constructed to perform a hotels search by shortest travelling route using Greedy Algorithm. This research was conducted through four stages, the first stage wasdata and information collectingof tourist attraction and hotel. Second stagewasdata analysis with greedy algorithm in purpose to classify the data and implementing greedy algorithm with manual calculation to the problem research. The third stage was the development of the system, and the last stage wasevaluating the system with the experts who are experienced in the field of tourism and the prospective user of this application. Results from this study was the system can provide recommendations and sequence the shortest journey between the hotel and tourist attraction based on the greedy algorithm.

Contemporary Greedy Institutions: An Essay on Lewis Coser’s Concept in Times of the ‘Hive Mind’

OpenAIRE

de Campo, Marianne Egger

2013-01-01

Lewis Coser perennially discussed various forms and facets of ‘greedy institutions’ with their total grasp on the individual. Coser’s ‘greedy institutions’ demand undivided time and loyalty from the individual who will voluntarily devote him/herself for exclusive benefits only granted to loyal followers. Although the ancient authorities have vanished—princes with their court Jews, masters with their servants, or religious and political missionaries— one can argue that the idea of the greedy i...

Optimization by GRASP greedy randomized adaptive search procedures

CERN Document Server

Resende, Mauricio G C

2016-01-01

This is the first book to cover GRASP (Greedy Randomized Adaptive Search Procedures), a metaheuristic that has enjoyed wide success in practice with a broad range of applications to real-world combinatorial optimization problems. The state-of-the-art coverage and carefully crafted pedagogical style lends this book highly accessible as an introductory text not only to GRASP, but also to combinatorial optimization, greedy algorithms, local search, and path-relinking, as well as to heuristics and metaheuristics, in general. The focus is on algorithmic and computational aspects of applied optimization with GRASP with emphasis given to the end-user, providing sufficient information on the broad spectrum of advances in applied optimization with GRASP. For the more advanced reader, chapters on hybridization with path-relinking and parallel and continuous GRASP present these topics in a clear and concise fashion. Additionally, the book offers a very complete annotated bibliography of GRASP and combinatorial optimizat...

Divergence-Measure Fields, Sets of Finite Perimeter, and Conservation Laws

Science.gov (United States)

Chen, Gui-Qiang; Torres, Monica

2005-02-01

Divergence-measure fields in L∞ over sets of finite perimeter are analyzed. A notion of normal traces over boundaries of sets of finite perimeter is introduced, and the Gauss-Green formula over sets of finite perimeter is established for divergence-measure fields in L∞. The normal trace introduced here over a class of surfaces of finite perimeter is shown to be the weak-star limit of the normal traces introduced in Chen & Frid [6] over the Lipschitz deformation surfaces, which implies their consistency. As a corollary, an extension theorem of divergence-measure fields in L∞ over sets of finite perimeter is also established. Then we apply the theory to the initial-boundary value problem of nonlinear hyperbolic conservation laws over sets of finite perimeter.

Fire Perimeters - Southern California, Fall 2007 [ds385

Data.gov (United States)

California Natural Resource Agency — Southern Callifornia fire perimeters for the Fall 2007 wildfires. The perimeters were assembled from various sources by California Department of Fish and Game (DFG)...

Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem

DEFF Research Database (Denmark)

Görtz, Simon; Klose, Andreas

2009-01-01

-charge transportation problem. Nevertheless, just a few methods for solving this problem have been proposed in the literature. In this paper, some greedy heuristic solutions methods for the SSFCTP are investigated. It is shown that two greedy approaches for the SSFCTP known from the literature can be arbitrarily bad......, whereas an approximation algorithm proposed in the literature for the binary min-knapsack problem has a guaranteed worst case bound if adapted accordingly to the case of the SSFCTP....

Nuclear-power-plant perimeter-intrusion alarm systems

International Nuclear Information System (INIS)

Halsey, D.J.

1982-04-01

Timely intercept of an intruder requires the examination of perimeter barriers and sensors in terms of reliable detection, immediate assessment and prompt response provisions. Perimeter security equipment and operations must at the same time meet the requirements of the Code of Federal Regulations, 10 CFR 73.55 with some attention to the performance and testing figures of Nuclear Regulatory Guide 5.44, Revision 2, May 1980. A baseline system is defined which recommends a general approach to implementing perimeter security elements: barriers, lighting, intrusion detection, alarm assessment. The baseline approach emphasizes cost/effectiveness achieved by detector layering and logic processing of alarm signals to produce reliable alarms and low nuisance alarm rates. A cost benefit of layering along with video assessment is reduction in operating expense. The concept of layering is also shown to minimize testing costs where detectability performance as suggested by Regulatory Guide 5.44 is to be performed. Synthesis of the perimeter intrusion alarm system and limited testing of CCTV and Video Motion Detectors (VMD), were performed at E-Systems, Greenville Division, Greenville, Texas during 1981

Treatment planning for prostate brachytherapy using region of interest adjoint functions and a greedy heuristic

International Nuclear Information System (INIS)

Yoo, Sua; Kowalok, Michael E; Thomadsen, Bruce R; Henderson, Douglass L

2003-01-01

We have developed an efficient treatment-planning algorithm for prostate implants that is based on region of interest (ROI) adjoint functions and a greedy heuristic. For this work, we define the adjoint function for an ROI as the sensitivity of the average dose in the ROI to a unit-strength brachytherapy source at any seed position. The greedy heuristic uses a ratio of target and critical structure adjoint functions to rank seed positions according to their ability to irradiate the target ROI while sparing critical structure ROIs. This ratio is computed once for each seed position prior to the optimization process. Optimization is performed by a greedy heuristic that selects seed positions according to their ratio values. With this method, clinically acceptable treatment plans are obtained in less than 2 s. For comparison, a branch-and-bound method to solve a mixed integer-programming model took more than 50 min to arrive at a feasible solution. Both methods achieved good treatment plans, but the speedup provided by the greedy heuristic was a factor of approximately 1500. This attribute makes this algorithm suitable for intra-operative real-time treatment planning

Greedy Algorithms for Reduced Bases in Banach Spaces

KAUST Repository

DeVore, Ronald; Petrova, Guergana; Wojtaszczyk, Przemyslaw

2013-01-01

family of PDEs. The performance of this greedy algorithm was initially analyzed in Buffa et al. (Modél. Math. Anal. Numér. 46:595-603, 2012) in the case X=H is a Hilbert space. The results of Buffa et al. (Modél. Math. Anal. Numér. 46:595-603, 2012) were

A new greedy search method for the design of digital IIR filter

Directory of Open Access Journals (Sweden)

Ranjit Kaur

2015-07-01

Full Text Available A new greedy search method is applied in this paper to design the optimal digital infinite impulse response (IIR filter. The greedy search method is based on binary successive approximation (BSA and evolutionary search (ES. The suggested greedy search method optimizes the magnitude response and the phase response simultaneously and also finds the lowest order of the filter. The order of the filter is controlled by a control gene whose value is also optimized along with the filter coefficients to obtain optimum order of designed IIR filter. The stability constraints of IIR filter are taken care of during the design procedure. To determine the trade-off relationship between conflicting objectives in the non-inferior domain, the weighting method is exploited. The proposed approach is effectively applied to solve the multiobjective optimization problems of designing the digital low-pass (LP, high-pass (HP, bandpass (BP, and bandstop (BS filters. It has been demonstrated that this technique not only fulfills all types of filter performance requirements, but also the lowest order of the filter can be found. The computational experiments show that the proposed approach gives better digital IIR filters than the existing evolutionary algorithm (EA based methods.

An Accelerated Greedy Missing Point Estimation Procedure

DEFF Research Database (Denmark)

Zimmermann, Ralf; Willcox, Karen

2016-01-01

, without requiring solution of the modified eigenvalue problem. Based on theoretical insights into symmetric rank-one eigenvalue modifications, we derive a variation of the greedy method that is faster than the standard approach and yields better results for the cases studied. The proposed approach...... is illustrated by numerical experiments, where we observe a speed-up by two orders of magnitude when c Read More: http://epubs.siam.org/doi/abs/10.1137/15M1042899...

Application of a greedy algorithm to military aircraft fleet retirements

NARCIS (Netherlands)

Newcamp, J.M.; Verhagen, W.J.C.; Udluft, H.; Curran, Ricky

2017-01-01

This article presents a retirement analysis model for aircraft fleets. By employing a greedy algorithm, the presented solution is capable of identifying individually weak assets in a fleet of aircraft with inhomogeneous historical utilization. The model forecasts future retirement scenarios

Sensitivity analysis of a greedy heuristic for knapsack problems

NARCIS (Netherlands)

Ghosh, D; Chakravarti, N; Sierksma, G

2006-01-01

In this paper, we carry out parametric analysis as well as a tolerance limit based sensitivity analysis of a greedy heuristic for two knapsack problems-the 0-1 knapsack problem and the subset sum problem. We carry out the parametric analysis based on all problem parameters. In the tolerance limit

Improving performances of suboptimal greedy iterative biclustering heuristics via localization.

Science.gov (United States)

Erten, Cesim; Sözdinler, Melih

2010-10-15

Biclustering gene expression data is the problem of extracting submatrices of genes and conditions exhibiting significant correlation across both the rows and the columns of a data matrix of expression values. Even the simplest versions of the problem are computationally hard. Most of the proposed solutions therefore employ greedy iterative heuristics that locally optimize a suitably assigned scoring function. We provide a fast and simple pre-processing algorithm called localization that reorders the rows and columns of the input data matrix in such a way as to group correlated entries in small local neighborhoods within the matrix. The proposed localization algorithm takes its roots from effective use of graph-theoretical methods applied to problems exhibiting a similar structure to that of biclustering. In order to evaluate the effectivenesss of the localization pre-processing algorithm, we focus on three representative greedy iterative heuristic methods. We show how the localization pre-processing can be incorporated into each representative algorithm to improve biclustering performance. Furthermore, we propose a simple biclustering algorithm, Random Extraction After Localization (REAL) that randomly extracts submatrices from the localization pre-processed data matrix, eliminates those with low similarity scores, and provides the rest as correlated structures representing biclusters. We compare the proposed localization pre-processing with another pre-processing alternative, non-negative matrix factorization. We show that our fast and simple localization procedure provides similar or even better results than the computationally heavy matrix factorization pre-processing with regards to H-value tests. We next demonstrate that the performances of the three representative greedy iterative heuristic methods improve with localization pre-processing when biological correlations in the form of functional enrichment and PPI verification constitute the main performance

Reducing a congestion with introduce the greedy algorithm on traffic light control

Science.gov (United States)

Catur Siswipraptini, Puji; Hendro Martono, Wisnu; Hartanti, Dian

2018-03-01

The density of vehicles causes congestion seen at every junction in the city of jakarta due to the static or manual traffic timing lamp system consequently the length of the queue at the junction is uncertain. The research has been aimed at designing a sensor based traffic system based on the queue length detection of the vehicle to optimize the duration of the green light. In detecting the length of the queue of vehicles using infrared sensor assistance placed in each intersection path, then apply Greedy algorithm to help accelerate the movement of green light duration for the path that requires, while to apply the traffic lights regulation program based on greedy algorithm which is then stored on microcontroller with Arduino Mega 2560 type. Where a developed system implements the greedy algorithm with the help of the infrared sensor it will extend the duration of the green light on the long vehicle queue and accelerate the duration of the green light at the intersection that has the queue not too dense. Furthermore, the design is made to form an artificial form of the actual situation of the scale model or simple simulator (next we just called as scale model of simulator) of the intersection then tested. Sensors used are infrared sensors, where the placement of sensors in each intersection on the scale model is placed within 10 cm of each sensor and serves as a queue detector. From the results of the test process on the scale model with a longer queue obtained longer green light time so it will fix the problem of long queue of vehicles. Using greedy algorithms can add long green lights for 2 seconds on tracks that have long queues at least three sensor levels and accelerate time at other intersections that have longer queue sensor levels less than level three.

'Misclassification error' greedy heuristic to construct decision trees for inconsistent decision tables

KAUST Repository

Azad, Mohammad; Moshkov, Mikhail

2014-01-01

A greedy algorithm has been presented in this paper to construct decision trees for three different approaches (many-valued decision, most common decision, and generalized decision) in order to handle the inconsistency of multiple decisions in a decision table. In this algorithm, a greedy heuristic ‘misclassification error’ is used which performs faster, and for some cost function, results are better than ‘number of boundary subtables’ heuristic in literature. Therefore, it can be used in the case of larger data sets and does not require huge amount of memory. Experimental results of depth, average depth and number of nodes of decision trees constructed by this algorithm are compared in the framework of each of the three approaches.

A note on the Greedy [beta-]transformation with arbitrary digits

NARCIS (Netherlands)

Dajani, K.; Kalle, C.C.C.J.

2011-01-01

We consider a generalization of the greedy and lazy [beta]expansions with digit set A = fa0

A Smart Collaborative Routing Protocol for Reliable Data Diffusion in IoT Scenarios.

Science.gov (United States)

Ai, Zheng-Yang; Zhou, Yu-Tong; Song, Fei

2018-06-13

It is knotty for current routing protocols to meet the needs of reliable data diffusion during the Internet of Things (IoT) deployments. Due to the random placement, limited resources and unattended features of existing sensor nodes, the wireless transmissions are easily exposed to unauthorized users, which becomes a vulnerable area for various malicious attacks, such as wormhole and Sybil attacks. However, the scheme based on geographic location is a suitable candidate to defend against them. This paper is inspired to propose a smart collaborative routing protocol, Geographic energy aware routing and Inspecting Node (GIN), for guaranteeing the reliability of data exchanging. The proposed protocol integrates the directed diffusion routing, Greedy Perimeter Stateless Routing (GPSR), and the inspecting node mechanism. We first discuss current wireless routing protocols from three diverse perspectives (improving transmission rate, shortening transmission range and reducing transmission consumption). Then, the details of GIN, including the model establishment and implementation processes, are presented by means of the theoretical analysis. Through leveraging the game theory, the inspecting node is elected to monitor the network behaviors. Thirdly, we evaluate the network performances, in terms of transmission delay, packet loss ratio, and throughput, between GIN and three traditional schemes (i.e., Flooding, GPSR, and GEAR). The simulation results illustrate that the proposed protocol is able to outperform the others.

Search Greedy for radial fuel optimization

International Nuclear Information System (INIS)

Ortiz, J. J.; Castillo, J. A.; Pelta, D. A.

2008-01-01

In this work a search algorithm Greedy is presented for the optimization of fuel cells in reactors BWR. As first phase a study was made of sensibility of the Factor of Pick of Local Power (FPPL) of the cell, in function of the exchange of the content of two fuel rods. His way it could settle down that then the rods to exchange do not contain gadolinium, small changes take place in the value of the FPPL of the cell. This knowledge was applied later in the search Greedy to optimize fuel cell. Exchanges of rods with gadolinium takes as a mechanism of global search and exchanges of rods without gadolinium takes as a method of local search. It worked with a cell of 10x10 rods and 2 circular water channels in center of the same one. From an inventory of enrichments of uranium and concentrations of given gadolinium and one distribution of well-known enrichments; the techniques finds good solutions that the FPPL minimizes, maintaining the factor of multiplication of neutrons in a range appropriate of values. In the low part of the assembly of a lot of recharge of a cycle of 18 months the cells were placed. The values of FPPL of the opposing cells are similar or smaller to those of the original cell and with behaviors in the nucleus also comparable to those obtained with the original cell. The evaluation of the cells was made with the code of transport CASMO-IV and the evaluation of the nucleus was made by means of the one simulator of the nucleus SIMULATE-3. (Author)

TH-CD-209-01: A Greedy Reassignment Algorithm for the PBS Minimum Monitor Unit Constraint

Energy Technology Data Exchange (ETDEWEB)

Lin, Y; Kooy, H; Craft, D; Depauw, N; Flanz, J; Clasie, B [Massachusetts General Hospital and Harvard Medical School, Boston, MA (United States)

2016-06-15

Purpose: To investigate a Greedy Reassignment algorithm in order to mitigate the effects of low weight spots in proton pencil beam scanning (PBS) treatment plans. Methods: To convert a plan from the treatment planning system’s (TPS) to a deliverable plan, post processing methods can be used to adjust the spot maps to meets the minimum MU constraint. Existing methods include: deleting low weight spots (Cut method), or rounding spots with weight above/below half the limit up/down to the limit/zero (Round method). An alternative method called Greedy Reassignment was developed in this work in which the lowest weight spot in the field was removed and its weight reassigned equally among its nearest neighbors. The process was repeated with the next lowest weight spot until all spots in the field were above the MU constraint. The algorithm performance was evaluated using plans collected from 190 patients (496 fields) treated at our facility. The evaluation criteria were the γ-index pass rate comparing the pre-processed and post-processed dose distributions. A planning metric was further developed to predict the impact of post-processing on treatment plans for various treatment planning, machine, and dose tolerance parameters. Results: For fields with a gamma pass rate of 90±1%, the metric has a standard deviation equal to 18% of the centroid value. This showed that the metric and γ-index pass rate are correlated for the Greedy Reassignment algorithm. Using a 3rd order polynomial fit to the data, the Greedy Reassignment method had 1.8 times better metric at 90% pass rate compared to other post-processing methods. Conclusion: We showed that the Greedy Reassignment method yields deliverable plans that are closest to the optimized-without-MU-constraint plan from the TPS. The metric developed in this work could help design the minimum MU threshold with the goal of keeping the γ-index pass rate above an acceptable value.

Perimeter intrusion sensors

International Nuclear Information System (INIS)

Eaton, M.J.

1977-01-01

To obtain an effective perimeter intrusion detection system requires careful sensor selection, procurement, and installation. The selection process involves a thorough understanding of the unique site features and how these features affect the performance of each type of sensor. It is necessary to develop procurement specifications to establish acceptable sensor performance limits. Careful explanation and inspection of critical installation dimensions is required during on-site construction. The implementation of these activities at a particular site is discussed

A greedy heuristic using adjoint functions for the optimization of seed and needle configurations in prostate seed implant

Energy Technology Data Exchange (ETDEWEB)

Yoo, Sua [Department of Radiation Oncology, Duke University Medical Center, Box 3295, Durham, NC 27710 (United States); Kowalok, Michael E [Department of Radiation Oncology, Virginia Commonwealth University Health System, 401 College St., PO Box 980058, Richmond, VA 23298-0058 (United States); Thomadsen, Bruce R [Department of Medical Physics, University of Wisconsin-Madison, 1530 MSC, 1300 University Ave., Madison, WI 53706 (United States); Henderson, Douglass L [Department of Engineering Physics, University of Wisconsin-Madison, 153 Engineering Research Bldg., 1500 Engineering Dr., Madison, WI 53706 (United States)

2007-02-07

We continue our work on the development of an efficient treatment-planning algorithm for prostate seed implants by incorporation of an automated seed and needle configuration routine. The treatment-planning algorithm is based on region of interest (ROI) adjoint functions and a greedy heuristic. As defined in this work, the adjoint function of an ROI is the sensitivity of the average dose in the ROI to a unit-strength brachytherapy source at any seed position. The greedy heuristic uses a ratio of target and critical structure adjoint functions to rank seed positions according to their ability to irradiate the target ROI while sparing critical structure ROIs. Because seed positions are ranked in advance and because the greedy heuristic does not modify previously selected seed positions, the greedy heuristic constructs a complete seed configuration quickly. Isodose surface constraints determine the search space and the needle constraint limits the number of needles. This study additionally includes a methodology that scans possible combinations of these constraint values automatically. This automated selection scheme saves the user the effort of manually searching constraint values. With this method, clinically acceptable treatment plans are obtained in less than 2 min. For comparison, the branch-and-bound method used to solve a mixed integer-programming model took close to 2.5 h to arrive at a feasible solution. Both methods achieved good treatment plans, but the speedup provided by the greedy heuristic was a factor of approximately 100. This attribute makes this algorithm suitable for intra-operative real-time treatment planning.

A greedy heuristic using adjoint functions for the optimization of seed and needle configurations in prostate seed implant

International Nuclear Information System (INIS)

Yoo, Sua; Kowalok, Michael E; Thomadsen, Bruce R; Henderson, Douglass L

2007-01-01

We continue our work on the development of an efficient treatment-planning algorithm for prostate seed implants by incorporation of an automated seed and needle configuration routine. The treatment-planning algorithm is based on region of interest (ROI) adjoint functions and a greedy heuristic. As defined in this work, the adjoint function of an ROI is the sensitivity of the average dose in the ROI to a unit-strength brachytherapy source at any seed position. The greedy heuristic uses a ratio of target and critical structure adjoint functions to rank seed positions according to their ability to irradiate the target ROI while sparing critical structure ROIs. Because seed positions are ranked in advance and because the greedy heuristic does not modify previously selected seed positions, the greedy heuristic constructs a complete seed configuration quickly. Isodose surface constraints determine the search space and the needle constraint limits the number of needles. This study additionally includes a methodology that scans possible combinations of these constraint values automatically. This automated selection scheme saves the user the effort of manually searching constraint values. With this method, clinically acceptable treatment plans are obtained in less than 2 min. For comparison, the branch-and-bound method used to solve a mixed integer-programming model took close to 2.5 h to arrive at a feasible solution. Both methods achieved good treatment plans, but the speedup provided by the greedy heuristic was a factor of approximately 100. This attribute makes this algorithm suitable for intra-operative real-time treatment planning

Fragmentation of percolation cluster perimeters

Science.gov (United States)

Debierre, Jean-Marc; Bradley, R. Mark

1996-05-01

We introduce a model for the fragmentation of porous random solids under the action of an external agent. In our model, the solid is represented by a bond percolation cluster on the square lattice and bonds are removed only at the external perimeter (or `hull') of the cluster. This model is shown to be related to the self-avoiding walk on the Manhattan lattice and to the disconnection events at a diffusion front. These correspondences are used to predict the leading and the first correction-to-scaling exponents for several quantities defined for hull fragmentation. Our numerical results support these predictions. In addition, the algorithm used to construct the perimeters reveals itself to be a very efficient tool for detecting subtle correlations in the pseudo-random number generator used. We present a quantitative test of two generators which supports recent results reported in more systematic studies.

Detecting highly overlapping community structure by greedy clique expansion

OpenAIRE

Lee, Conrad; Reid, Fergal; McDaid, Aaron; Hurley, Neil

2010-01-01

In complex networks it is common for each node to belong to several communities, implying a highly overlapping community structure. Recent advances in benchmarking indicate that existing community assignment algorithms that are capable of detecting overlapping communities perform well only when the extent of community overlap is kept to modest levels. To overcome this limitation, we introduce a new community assignment algorithm called Greedy Clique Expansion (GCE). The algorithm identifies d...

Efficient and accurate Greedy Search Methods for mining functional modules in protein interaction networks.

Science.gov (United States)

He, Jieyue; Li, Chaojun; Ye, Baoliu; Zhong, Wei

2012-06-25

Most computational algorithms mainly focus on detecting highly connected subgraphs in PPI networks as protein complexes but ignore their inherent organization. Furthermore, many of these algorithms are computationally expensive. However, recent analysis indicates that experimentally detected protein complexes generally contain Core/attachment structures. In this paper, a Greedy Search Method based on Core-Attachment structure (GSM-CA) is proposed. The GSM-CA method detects densely connected regions in large protein-protein interaction networks based on the edge weight and two criteria for determining core nodes and attachment nodes. The GSM-CA method improves the prediction accuracy compared to other similar module detection approaches, however it is computationally expensive. Many module detection approaches are based on the traditional hierarchical methods, which is also computationally inefficient because the hierarchical tree structure produced by these approaches cannot provide adequate information to identify whether a network belongs to a module structure or not. In order to speed up the computational process, the Greedy Search Method based on Fast Clustering (GSM-FC) is proposed in this work. The edge weight based GSM-FC method uses a greedy procedure to traverse all edges just once to separate the network into the suitable set of modules. The proposed methods are applied to the protein interaction network of S. cerevisiae. Experimental results indicate that many significant functional modules are detected, most of which match the known complexes. Results also demonstrate that the GSM-FC algorithm is faster and more accurate as compared to other competing algorithms. Based on the new edge weight definition, the proposed algorithm takes advantages of the greedy search procedure to separate the network into the suitable set of modules. Experimental analysis shows that the identified modules are statistically significant. The algorithm can reduce the

A Greedy Approach for Placement of Subsurface Aquifer Wells in an Ensemble Filtering Framework

KAUST Repository

El Gharamti, Mohamad; Marzouk, Youssef M.; Huan, Xun; Hoteit, Ibrahim

2015-01-01

Optimizing wells placement may help in better understanding subsurface solute transport and detecting contaminant plumes. In this work, we use the ensemble Kalman filter (EnKF) as a data assimilation tool and propose a greedy observational design algorithm to optimally select aquifer wells locations for updating the prior contaminant ensemble. The algorithm is greedy in the sense that it operates sequentially, without taking into account expected future gains. The selection criteria is based on maximizing the information gain that the EnKF carries during the update of the prior uncertainties. We test the efficiency of this algorithm in a synthetic aquifer system where a contaminant plume is set to migrate over a 30 years period across a heterogenous domain.

A Greedy Approach for Placement of Subsurface Aquifer Wells in an Ensemble Filtering Framework

KAUST Repository

El Gharamti, Mohamad

2015-11-26

Optimizing wells placement may help in better understanding subsurface solute transport and detecting contaminant plumes. In this work, we use the ensemble Kalman filter (EnKF) as a data assimilation tool and propose a greedy observational design algorithm to optimally select aquifer wells locations for updating the prior contaminant ensemble. The algorithm is greedy in the sense that it operates sequentially, without taking into account expected future gains. The selection criteria is based on maximizing the information gain that the EnKF carries during the update of the prior uncertainties. We test the efficiency of this algorithm in a synthetic aquifer system where a contaminant plume is set to migrate over a 30 years period across a heterogenous domain.

An efficient community detection algorithm using greedy surprise maximization

International Nuclear Information System (INIS)

Jiang, Yawen; Jia, Caiyan; Yu, Jian

2014-01-01

Community detection is an important and crucial problem in complex network analysis. Although classical modularity function optimization approaches are widely used for identifying communities, the modularity function (Q) suffers from its resolution limit. Recently, the surprise function (S) was experimentally proved to be better than the Q function. However, up until now, there has been no algorithm available to perform searches to directly determine the maximal surprise values. In this paper, considering the superiority of the S function over the Q function, we propose an efficient community detection algorithm called AGSO (algorithm based on greedy surprise optimization) and its improved version FAGSO (fast-AGSO), which are based on greedy surprise optimization and do not suffer from the resolution limit. In addition, (F)AGSO does not need the number of communities K to be specified in advance. Tests on experimental networks show that (F)AGSO is able to detect optimal partitions in both simple and even more complex networks. Moreover, algorithms based on surprise maximization perform better than those algorithms based on modularity maximization, including Blondel–Guillaume–Lambiotte–Lefebvre (BGLL), Clauset–Newman–Moore (CNM) and the other state-of-the-art algorithms such as Infomap, order statistics local optimization method (OSLOM) and label propagation algorithm (LPA). (paper)

Fiber-optic perimeter security system based on WDM technology

Science.gov (United States)

Polyakov, Alexandre V.

2017-10-01

Intelligent underground fiber optic perimeter security system is presented. Their structure, operation, software and hardware with neural networks elements are described. System allows not only to establish the fact of violation of the perimeter, but also to locate violations. This is achieved through the use of WDM-technology division spectral information channels. As used quasi-distributed optoelectronic recirculation system as a discrete sensor. The principle of operation is based on registration of the recirculation period change in the closed optoelectronic circuit at different wavelengths under microstrain exposed optical fiber. As a result microstrain fiber having additional power loss in a fiber optical propagating pulse, which causes a time delay as a result of switching moments of the threshold device. To separate the signals generated by intruder noise and interference, the signal analyzer is used, based on the principle of a neural network. The system detects walking, running or crawling intruder, as well as undermining attempts to register under the perimeter line. These alarm systems can be used to protect the perimeters of facilities such as airports, nuclear reactors, power plants, warehouses, and other extended territory.

21 CFR 886.1605 - Perimeter.

Science.gov (United States)

2010-04-01

... 21 Food and Drugs 8 2010-04-01 2010-04-01 false Perimeter. 886.1605 Section 886.1605 Food and Drugs FOOD AND DRUG ADMINISTRATION, DEPARTMENT OF HEALTH AND HUMAN SERVICES (CONTINUED) MEDICAL DEVICES... or manual device intended to determine the extent of the peripheral visual field of a patient. The...

Tackling Error Propagation through Reinforcement Learning: A Case of Greedy Dependency Parsing

NARCIS (Netherlands)

Le, M.N.; Fokkens, A.S.

Error propagation is a common problem in NLP. Reinforcement learning explores erroneous states during training and can therefore be more robust when mistakes are made early in a process. In this paper, we apply reinforcement learning to greedy dependency parsing which is known to suffer from error

A Statistical Model for Uplink Intercell Interference with Power Adaptation and Greedy Scheduling

KAUST Repository

Tabassum, Hina

2012-10-03

This paper deals with the statistical modeling of uplink inter-cell interference (ICI) considering greedy scheduling with power adaptation based on channel conditions. The derived model is implicitly generalized for any kind of shadowing and fading environments. More precisely, we develop a generic model for the distribution of ICI based on the locations of the allocated users and their transmit powers. The derived model is utilized to evaluate important network performance metrics such as ergodic capacity, average fairness and average power preservation numerically. Monte-Carlo simulation details are included to support the analysis and show the accuracy of the derived expressions. In parallel to the literature, we show that greedy scheduling with power adaptation reduces the ICI, average power consumption of users, and enhances the average fairness among users, compared to the case without power adaptation. © 2012 IEEE.

A Statistical Model for Uplink Intercell Interference with Power Adaptation and Greedy Scheduling

KAUST Repository

Tabassum, Hina; Yilmaz, Ferkan; Dawy, Zaher; Alouini, Mohamed-Slim

2012-01-01

This paper deals with the statistical modeling of uplink inter-cell interference (ICI) considering greedy scheduling with power adaptation based on channel conditions. The derived model is implicitly generalized for any kind of shadowing and fading environments. More precisely, we develop a generic model for the distribution of ICI based on the locations of the allocated users and their transmit powers. The derived model is utilized to evaluate important network performance metrics such as ergodic capacity, average fairness and average power preservation numerically. Monte-Carlo simulation details are included to support the analysis and show the accuracy of the derived expressions. In parallel to the literature, we show that greedy scheduling with power adaptation reduces the ICI, average power consumption of users, and enhances the average fairness among users, compared to the case without power adaptation. © 2012 IEEE.

Numerical quantification and minimization of perimeter losses in high-efficiency silicon solar cells

Energy Technology Data Exchange (ETDEWEB)

Altermatt, P.P.; Heiser, Gernot; Green, M.A. [New South Wales Univ., Kensington, NSW (Australia)

1996-09-01

This paper presents a quantitative analysis of perimeter losses in high-efficiency silicon solar cells. A new method of numerical modelling is used, which provides the means to simulate a full-sized solar cell, including its perimeter region. We analyse the reduction in efficiency due to perimeter losses as a function of the distance between the active cell area and the cut edge. It is shown how the optimum distance depends on whether the cells in the panel are shingled or not. The simulations also indicate that passivating the cut-face with a thermal oxide does not increase cell efficiency substantially. Therefore, doping schemes for the perimeter domain are suggested in order to increase efficiency levels above present standards. Finally, perimeter effects in cells that remain embedded in the wafer during the efficiency measurement are outlined. (author)

Historical Fire Perimeters - Southern California [ds384

Data.gov (United States)

California Natural Resource Agency — CDF, USDA Forest Service Region 5, BLM, NPS, Contract Counties and other agencies jointly maintain a comprehensive fire perimeter GIS layer for public and private...

Evaluation of a Didactic Method for the Active Learning of Greedy Algorithms

Science.gov (United States)

Esteban-Sánchez, Natalia; Pizarro, Celeste; Velázquez-Iturbide, J. Ángel

2014-01-01

An evaluation of the educational effectiveness of a didactic method for the active learning of greedy algorithms is presented. The didactic method sets students structured-inquiry challenges to be addressed with a specific experimental method, supported by the interactive system GreedEx. This didactic method has been refined over several years of…

Effective Iterated Greedy Algorithm for Flow-Shop Scheduling Problems with Time lags

Science.gov (United States)

ZHAO, Ning; YE, Song; LI, Kaidian; CHEN, Siyu

2017-05-01

Flow shop scheduling problem with time lags is a practical scheduling problem and attracts many studies. Permutation problem(PFSP with time lags) is concentrated but non-permutation problem(non-PFSP with time lags) seems to be neglected. With the aim to minimize the makespan and satisfy time lag constraints, efficient algorithms corresponding to PFSP and non-PFSP problems are proposed, which consist of iterated greedy algorithm for permutation(IGTLP) and iterated greedy algorithm for non-permutation (IGTLNP). The proposed algorithms are verified using well-known simple and complex instances of permutation and non-permutation problems with various time lag ranges. The permutation results indicate that the proposed IGTLP can reach near optimal solution within nearly 11% computational time of traditional GA approach. The non-permutation results indicate that the proposed IG can reach nearly same solution within less than 1% computational time compared with traditional GA approach. The proposed research combines PFSP and non-PFSP together with minimal and maximal time lag consideration, which provides an interesting viewpoint for industrial implementation.

Integrated multisensor perimeter detection systems

Science.gov (United States)

Kent, P. J.; Fretwell, P.; Barrett, D. J.; Faulkner, D. A.

2007-10-01

The report describes the results of a multi-year programme of research aimed at the development of an integrated multi-sensor perimeter detection system capable of being deployed at an operational site. The research was driven by end user requirements in protective security, particularly in threat detection and assessment, where effective capability was either not available or prohibitively expensive. Novel video analytics have been designed to provide robust detection of pedestrians in clutter while new radar detection and tracking algorithms provide wide area day/night surveillance. A modular integrated architecture based on commercially available components has been developed. A graphical user interface allows intuitive interaction and visualisation with the sensors. The fusion of video, radar and other sensor data provides the basis of a threat detection capability for real life conditions. The system was designed to be modular and extendable in order to accommodate future and legacy surveillance sensors. The current sensor mix includes stereoscopic video cameras, mmWave ground movement radar, CCTV and a commercially available perimeter detection cable. The paper outlines the development of the system and describes the lessons learnt after deployment in a pilot trial.

Real-time estimation of wildfire perimeters from curated crowdsourcing

Science.gov (United States)

Zhong, Xu; Duckham, Matt; Chong, Derek; Tolhurst, Kevin

2016-04-01

Real-time information about the spatial extents of evolving natural disasters, such as wildfire or flood perimeters, can assist both emergency responders and the general public during an emergency. However, authoritative information sources can suffer from bottlenecks and delays, while user-generated social media data usually lacks the necessary structure and trustworthiness for reliable automated processing. This paper describes and evaluates an automated technique for real-time tracking of wildfire perimeters based on publicly available “curated” crowdsourced data about telephone calls to the emergency services. Our technique is based on established data mining tools, and can be adjusted using a small number of intuitive parameters. Experiments using data from the devastating Black Saturday wildfires (2009) in Victoria, Australia, demonstrate the potential for the technique to detect and track wildfire perimeters automatically, in real time, and with moderate accuracy. Accuracy can be further increased through combination with other authoritative demographic and environmental information, such as population density and dynamic wind fields. These results are also independently validated against data from the more recent 2014 Mickleham-Dalrymple wildfires.

Greedy algorithms for construction of approximate tests for decision tables with many-valued decisions

KAUST Repository

Azad, Mohammad; Chikalov, Igor; Moshkov, Mikhail; Zielosko, Beata

2012-01-01

The paper is devoted to the study of a greedy algorithm for construction of approximate tests (super-reducts) This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions For a given

Computing nonsimple polygons of minimum perimeter

NARCIS (Netherlands)

Fekete, S.P.; Haas, A.; Hemmer, M.; Hoffmann, M.; Kostitsyna, I.; Krupke, D.; Maurer, F.; Mitchell, J.S.B.; Schmidt, A.; Schmidt, C.; Troegel, J.

2018-01-01

We consider the Minimum Perimeter Polygon Problem (MP3): for a given set V of points in the plane, find a polygon P with holes that has vertex set V , such that the total boundary length is smallest possible. The MP3 can be considered a natural geometric generalization of the Traveling Salesman

Comparing imagery in The Greedy Hippo and Crouching Tiger, Hidden Dragon

Directory of Open Access Journals (Sweden)

John R. Botha

2012-11-01

Full Text Available This article used as point of departure the Ngano song-story entitled The Greedy Hippo as developed by Christiaan van der Westhuizen and based on the Tambani embroidery project. This animated interpretation of The Greedy Hippo is used to further the aims of interdisciplinary research as stated by the original project by comparing its fantasy imagery with that of the Chinese film Crouching Tiger, Hidden Dragon by director Ang Lee. The analysis of the images in both works of art has been based on Jungian archetypes, with specific reference to the need for an esoteric and imaginative reading of fantasy in the chosen works of art. Reference was made to the dominant role of realism as style in Western art as opposed to the more esoteric, symbolic, and fantasy imagery of the art of other cultures, with emphasis on China. Chinese landscape painting and even poetry has been briefly contextualised with regards to the chosen works of art. Finally, the different characters of both works of art were analysed within the contexts of their symbolic meanings as based on Jungian archetypes, with particular reference to the scenes where the characters are depicted as flying through the air, which were explained within the contexts of Wu Xia martial arts style films.s.

Greedy algorithms for diffuse optical tomography reconstruction

Science.gov (United States)

Dileep, B. P. V.; Das, Tapan; Dutta, Pranab K.

2018-03-01

Diffuse optical tomography (DOT) is a noninvasive imaging modality that reconstructs the optical parameters of a highly scattering medium. However, the inverse problem of DOT is ill-posed and highly nonlinear due to the zig-zag propagation of photons that diffuses through the cross section of tissue. The conventional DOT imaging methods iteratively compute the solution of forward diffusion equation solver which makes the problem computationally expensive. Also, these methods fail when the geometry is complex. Recently, the theory of compressive sensing (CS) has received considerable attention because of its efficient use in biomedical imaging applications. The objective of this paper is to solve a given DOT inverse problem by using compressive sensing framework and various Greedy algorithms such as orthogonal matching pursuit (OMP), compressive sampling matching pursuit (CoSaMP), and stagewise orthogonal matching pursuit (StOMP), regularized orthogonal matching pursuit (ROMP) and simultaneous orthogonal matching pursuit (S-OMP) have been studied to reconstruct the change in the absorption parameter i.e, Δα from the boundary data. Also, the Greedy algorithms have been validated experimentally on a paraffin wax rectangular phantom through a well designed experimental set up. We also have studied the conventional DOT methods like least square method and truncated singular value decomposition (TSVD) for comparison. One of the main features of this work is the usage of less number of source-detector pairs, which can facilitate the use of DOT in routine applications of screening. The performance metrics such as mean square error (MSE), normalized mean square error (NMSE), structural similarity index (SSIM), and peak signal to noise ratio (PSNR) have been used to evaluate the performance of the algorithms mentioned in this paper. Extensive simulation results confirm that CS based DOT reconstruction outperforms the conventional DOT imaging methods in terms of

Greedy and metaheuristics for the offline scheduling problem in grid computing

DEFF Research Database (Denmark)

Gamst, Mette

In grid computing a number of geographically distributed resources connected through a wide area network, are utilized as one computations unit. The NP-hard offline scheduling problem in grid computing consists of assigning jobs to resources in advance. In this paper, five greedy heuristics and two....... All heuristics solve instances with up to 2000 jobs and 1000 resources, thus the results are useful both with respect to running times and to solution values....

Current Density Distribution on the Perimeter of Waveguide Exciter Cylindrical Vibrator Conductor

OpenAIRE

Zakharia, Yosyp

2010-01-01

On ground of electrodynamic analysis the surface current distribution nonuniformity on the perimeter of waveguide-exciter cylindrical conductor is found. Considerable influence of current distribution nonuniformity on exciter input reactance is established. It is also showed, that the current distribution on the vibrator perimeter, for conductor radius no greater then 0,07 of waveguide cross section breadth, approximately uniform is.

Determination of a BNI perimeter. Guide nr 9, Release of the 2013/10/31

International Nuclear Information System (INIS)

2013-01-01

This guide specifies modalities of definition of the perimeter of a BNI (basic nuclear installation), and elements of assessment of criteria for the inclusion of installations, works and equipment within this perimeter, in compliance with legal measures specified in the French Code of the Environment and in various decrees. It first proposes an overview of the concerned articles in these legal texts, and notices some articulation with other legal texts which do not address nuclear issues. It specifies the various criteria of definition of a BNI perimeter by distinguishing installations, works and equipment under the responsibility of the operator and needed for the BNI exploitation, and installations, works and equipment not needed for the BNI exploitation but under the responsibility of the operator and susceptible to modify risks or inconveniences of the BNI. It addresses some peculiar situations: effluent processing installations and plants, control piezometers, the dredging of water and release sampling works, underground or underwater installations, and some specific departments (medicine, laundry, and so on). It outlines some important aspects of the procedure of modification of a BNI perimeter. An appendix addresses the methodology related to the inclusion of installations, equipment or works within the perimeter

AHP 47: THE GREEDY KING AND TRICKY MAN

Directory of Open Access Journals (Sweden)

Lcags so lhun 'grub ལྕགས་སོ་ལྷུན་འགྲུབ། (Klu sgrub ཀླུ་སྒྲུབ།

2017-04-01

Full Text Available Rgya mo skyid (b. 1992 of Mdo ba Town, Reb gong (Thun rin, Tongren County, Rma lho (Huangnan Tibetan Autonomous Prefecture, Mtsho sngon (Qinghai Province, China told me this story in an apartment in Xi'an City, Shaanxi Province on 21 August, 2016. She said, "When I was about five years old, my grandfather (Kun bzang, b. 1939 told me many stories such as this before we went to bed every night. I forgot many stories, but this story is still very clear." There was once a greedy local king who collected taxes monthly. There was also a very poor man known as Tricky Tsag thul. The local king came to Tricky's home to punish him for not paying his taxes for several months. ...

Greedy heuristics for minimization of number of terminal nodes in decision trees

KAUST Repository

Hussain, Shahid

2014-10-01

This paper describes, in detail, several greedy heuristics for construction of decision trees. We study the number of terminal nodes of decision trees, which is closely related with the cardinality of the set of rules corresponding to the tree. We compare these heuristics empirically for two different types of datasets (datasets acquired from UCI ML Repository and randomly generated data) as well as compare with the optimal results obtained using dynamic programming method.

Greedy heuristics for minimization of number of terminal nodes in decision trees

KAUST Repository

Hussain, Shahid

2014-01-01

This paper describes, in detail, several greedy heuristics for construction of decision trees. We study the number of terminal nodes of decision trees, which is closely related with the cardinality of the set of rules corresponding to the tree. We compare these heuristics empirically for two different types of datasets (datasets acquired from UCI ML Repository and randomly generated data) as well as compare with the optimal results obtained using dynamic programming method.

Tooth angulation and dental arch perimeter-the effect of orthodontic bracket prescription.

Science.gov (United States)

Pontes, Luana F; Cecim, Rodolpho L; Machado, Sissy M; Normando, David

2015-08-01

The aim of this study was to evaluate the effects of upper incisors and canine angulations introduced by different bracket prescriptions on dental arch perimeter. Cone beam computerized tomography scans collected using I-Cat (Imaging Sciences International, Hatfield, PA, USA) were selected conveniently from a database of routine exams of a clinical radiology center. Crown and radicular measurements of upper incisors and canines were made and exported to the Autocad 2011 software to create a virtual dental model. The virtual teeth were positioned with an angulation of zero; thereafter, a reference value for the perimeter of the arch was measured. Furthermore, teeth angulations were applied according to the standards of the Edgewise bracket system and the Straight-wire systems: MBT, Capelozza, Andrews, and Roth. The largest linear distances for tooth crown (anterior arch perimeter) and root (radicular distance) were obtained for each bracket prescription. The anterior perimeter for well-aligned incisors and canines without angulation was used as reference (crown: 47.34mm; root: 39.13mm). An increase in the arch perimeter was obtained for all bracket prescriptions evaluated, which ranged from 0.28 and 3.19mm in the Edgewise technique, for the crown and root measurements, respectively, to 1.09 and 11.28mm for the Roth prescription. Bracket prescriptions with greater angulation led to an increased use of space within the dental arch, mainly in the radicular region. The consequence of this radicular angular displacement will need to be further investigated. © The Author 2014. Published by Oxford University Press on behalf of the European Orthodontic Society. All rights reserved. For permissions, please email: journals.permissions@oup.com.

Comparison of Greedy Algorithms for Decision Tree Optimization

KAUST Repository

Alkhalid, Abdulaziz

2013-01-01

This chapter is devoted to the study of 16 types of greedy algorithms for decision tree construction. The dynamic programming approach is used for construction of optimal decision trees. Optimization is performed relative to minimal values of average depth, depth, number of nodes, number of terminal nodes, and number of nonterminal nodes of decision trees. We compare average depth, depth, number of nodes, number of terminal nodes and number of nonterminal nodes of constructed trees with minimum values of the considered parameters obtained based on a dynamic programming approach. We report experiments performed on data sets from UCI ML Repository and randomly generated binary decision tables. As a result, for depth, average depth, and number of nodes we propose a number of good heuristics. © Springer-Verlag Berlin Heidelberg 2013.

Visual field examination method using virtual reality glasses compared with the Humphrey perimeter

Directory of Open Access Journals (Sweden)

Tsapakis S

2017-08-01

Full Text Available Stylianos Tsapakis, Dimitrios Papaconstantinou, Andreas Diagourtas, Konstantinos Droutsas, Konstantinos Andreanos, Marilita M Moschos, Dimitrios Brouzas 1st Department of Ophthalmology, National and Kapodistrian University of Athens, Athens, Greece Purpose: To present a visual field examination method using virtual reality glasses and evaluate the reliability of the method by comparing the results with those of the Humphrey perimeter.Materials and methods: Virtual reality glasses, a smartphone with a 6 inch display, and software that implements a fast-threshold 3 dB step staircase algorithm for the central 24° of visual field (52 points were used to test 20 eyes of 10 patients, who were tested in a random and consecutive order as they appeared in our glaucoma department. The results were compared with those obtained from the same patients using the Humphrey perimeter.Results: High correlation coefficient (r=0.808, P<0.0001 was found between the virtual reality visual field test and the Humphrey perimeter visual field.Conclusion: Visual field examination results using virtual reality glasses have a high correlation with the Humphrey perimeter allowing the method to be suitable for probable clinical use. Keywords: visual fields, virtual reality glasses, perimetry, visual fields software, smartphone

Perimeter intrusion detection and assessment system

International Nuclear Information System (INIS)

Eaton, M.J.; Jacobs, J.; McGovern, D.E.

1977-11-01

To obtain an effective perimeter intrusion detection system requires careful sensor selection, procurement, and installation. The selection process involves a thorough understanding of the unique site features and how these features affect the performance of each type of sensor. It is necessary to develop procurement specifications to establish acceptable sensor performance limits. Careful explanation and inspection of critical installation dimensions is required during on-site construction. The implementation of these activities at a particular site is discussed

Urban Design Dimension Of Informality At The Perimeter Of Brawijaya University And UIN Maliki Malang

Directory of Open Access Journals (Sweden)

Tyaghita Cesarin Binar

2018-01-01

Full Text Available Informality is one of the commonly emerged issues in urban design which rarely explored, especially informality within university’s perimeter. Brawijaya as one of the biggest and oldest University in Malang over time has boosted the development of several of its perimeter, provided several hotspots for students and youth. These rapid hotspots growth is related to the growth of informal practices. For cities that developed by its universities, it is necessary to understand both of the formal and informal practices within its perimeter. Through this study I would like to know the characteristic of informality within university perimeter, which formed by Brawijaya, UIN Maliki, and ITN; and to frame it within Carmona’s Urban Design Dimension. Mapping is utilized as a primary method to analyze both formal and informality within site. The formal aspect consists of formal activities, function and site user. While informality mapper consists of street vendors and street art. The research found that while urban informality within Brawijaya and UIN Maliki are related to the character and morphology, its formal structure has; its relation is reciprocal. The morphological, visual and functional dimension of university perimeter is driven by the social, perceptual and temporal dimension formed by its user and showed through informality.

Design of ACM system based on non-greedy punctured LDPC codes

Science.gov (United States)

Lu, Zijun; Jiang, Zihong; Zhou, Lin; He, Yucheng

2017-08-01

In this paper, an adaptive coded modulation (ACM) scheme based on rate-compatible LDPC (RC-LDPC) codes was designed. The RC-LDPC codes were constructed by a non-greedy puncturing method which showed good performance in high code rate region. Moreover, the incremental redundancy scheme of LDPC-based ACM system over AWGN channel was proposed. By this scheme, code rates vary from 2/3 to 5/6 and the complication of the ACM system is lowered. Simulations show that more and more obvious coding gain can be obtained by the proposed ACM system with higher throughput.

Optimization of wind farm micro-siting for complex terrain using greedy algorithm

International Nuclear Information System (INIS)

Song, M.X.; Chen, K.; He, Z.Y.; Zhang, X.

2014-01-01

An optimization approach based on greedy algorithm for optimization of wind farm micro-siting is presented. The key of optimizing wind farm micro-siting is the fast and accurate evaluation of the wake flow interactions of wind turbines. The virtual particle model is employed for wake flow simulation of wind turbines, which makes the present method applicable for non-uniform flow fields on complex terrains. In previous bionic optimization method, within each step of the optimization process, only the power output of the turbine that is being located or relocated is considered. To aim at the overall power output of the wind farm comprehensively, a dependent region technique is introduced to improve the estimation of power output during the optimization procedure. With the technique, the wake flow influences can be reduced more efficiently during the optimization procedure. During the optimization process, the turbine that is being added will avoid being affected other turbines, and avoid affecting other turbine in the meantime. The results from the numerical calculations demonstrate that the present method is effective for wind farm micro-siting on complex terrain, and it produces better solutions in less time than the previous bionic method. - Highlights: • Greedy algorithm is applied to wind farm micro-siting problem. • The present method is effective for optimization on complex terrains. • Dependent region is suggested to improve the evaluation of wake influences. • The present method has better performance than the bionic method

A simple greedy algorithm for dynamic graph orientation

DEFF Research Database (Denmark)

Berglin, Edvin; Brodal, Gerth Stølting

2017-01-01

Graph orientations with low out-degree are one of several ways to efficiently store sparse graphs. If the graphs allow for insertion and deletion of edges, one may have to flip the orientation of some edges to prevent blowing up the maximum out-degree. We use arboricity as our sparsity measure....... With an immensely simple greedy algorithm, we get parametrized trade-off bounds between out-degree and worst case number of flips, which previously only existed for amortized number of flips. We match the previous best worst-case algorithm (in O(log n) flips) for general arboricity and beat it for either constant...... or super-logarithmic arboricity. We also match a previous best amortized result for at least logarithmic arboricity, and give the first results with worst-case O(1) and O(sqrt(log n)) flips nearly matching degree bounds to their respective amortized solutions....

Greedy algorithms for construction of approximate tests for decision tables with many-valued decisions

KAUST Repository

Azad, Mohammad

2012-12-14

The paper is devoted to the study of a greedy algorithm for construction of approximate tests (super-reducts) This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions For a given row, we should find a decision from the set attached to this row We consider bounds on the precision of this algorithm relative to the cardinality of tests.

Convex lattice polygons of fixed area with perimeter-dependent weights.

Science.gov (United States)

Rajesh, R; Dhar, Deepak

2005-01-01

We study fully convex polygons with a given area, and variable perimeter length on square and hexagonal lattices. We attach a weight tm to a convex polygon of perimeter m and show that the sum of weights of all polygons with a fixed area s varies as s(-theta(conv))eK(t)square root(s) for large s and t less than a critical threshold tc, where K(t) is a t-dependent constant, and theta(conv) is a critical exponent which does not change with t. Using heuristic arguments, we find that theta(conv) is 1/4 for the square lattice, but -1/4 for the hexagonal lattice. The reason for this unexpected nonuniversality of theta(conv) is traced to existence of sharp corners in the asymptotic shape of these polygons.

Fiber optic perimeter system for security in smart city

Science.gov (United States)

Cubik, Jakub; Kepak, Stanislav; Nedoma, Jan; Fajkus, Marcel; Zboril, Ondrej; Novak, Martin; Jargus, Jan; Vasinek, Vladimir

2017-10-01

Protection of persons and assets is the key challenge of Smart City safeguards technologies. Conventional security technologies are often outdated and easy to breach. Therefore, new technologies that could complement existing systems or replace them are developed. The use of optical fibers and their subsequent application in sensing is a trend of recent years. This article discusses the use of fiber-optic sensors in perimeter protection. The sensor consists of optical fibers and couplers only and being constructed without wires and metal parts bring many advantages. These include an absence of interference with electromagnetic waves, system presence can be difficult to detect as well as affect its operation. Testing installation of perimeter system was carried out under reinforced concrete structure. Subjects walked over the bridge at different speeds and over the different routes. The task for the system was an absolute detection of all subjects. The proposed system should find application mainly in areas with the presence of volatile substances, strong electromagnetic fields, or in explosive areas.

A greedy double swap heuristic for nurse scheduling

Directory of Open Access Journals (Sweden)

Murphy Choy

2012-10-01

Full Text Available One of the key challenges of nurse scheduling problem (NSP is the number of constraints placed on preparing the timetable, both from the regulatory requirements as well as the patients’ demand for the appropriate nursing care specialists. In addition, the preferences of the nursing staffs related to their work schedules add another dimension of complexity. Most solutions proposed for solving nurse scheduling involve the use of mathematical programming and generally considers only the hard constraints. However, the psychological needs of the nurses are ignored and this resulted in subsequent interventions by the nursing staffs to remedy any deficiency and often results in last minute changes to the schedule. In this paper, we present a staff preference optimization framework solved with a greedy double swap heuristic. The heuristic yields good performance in speed at solving the problem. The heuristic is simple and we will demonstrate its performance by implementing it on open source spreadsheet software.

Starvation dynamics of a greedy forager

Science.gov (United States)

Bhat, U.; Redner, S.; Bénichou, O.

2017-07-01

We investigate the dynamics of a greedy forager that moves by random walking in an environment where each site initially contains one unit of food. Upon encountering a food-containing site, the forager eats all the food there and can subsequently hop an additional S steps without food before starving to death. Upon encountering an empty site, the forager goes hungry and comes one time unit closer to starvation. We investigate the new feature of forager greed; if the forager has a choice between hopping to an empty site or to a food-containing site in its nearest neighborhood, it hops preferentially towards food. If the neighboring sites all contain food or are all empty, the forager hops equiprobably to one of these neighbors. Paradoxically, the lifetime of the forager can depend non-monotonically on greed, and the sense of the non-monotonicity is opposite in one and two dimensions. Even more unexpectedly, the forager lifetime in one dimension is substantially enhanced when the greed is negative; here the forager tends to avoid food in its local neighborhood. We also determine the average amount of food consumed at the instant when the forager starves. We present analytic, heuristic, and numerical results to elucidate these intriguing phenomena.

Developmental Dyscalculia and Automatic Magnitudes Processing: Investigating Interference Effects between Area and Perimeter

Directory of Open Access Journals (Sweden)

Hili Eidlin-Levy

2017-12-01

Full Text Available The relationship between numbers and other magnitudes has been extensively investigated in the scientific literature. Here, the objectives were to examine whether two continuous magnitudes, area and perimeter, are automatically processed and whether adults with developmental dyscalculia (DD are deficient in their ability to automatically process one or both of these magnitudes. Fifty-seven students (30 with DD and 27 with typical development performed a novel Stroop-like task requiring estimation of one aspect (area or perimeter while ignoring the other. In order to track possible changes in automaticity due to practice, we measured performance after initial and continuous exposure to stimuli. Similar to previous findings, current results show a significant group × congruency interaction, evident beyond exposure level or magnitude type. That is, the DD group systematically showed larger Stroop effects. However, analysis of each exposure period showed that during initial exposure to stimuli the DD group showed larger Stroop effects in the perimeter and not in the area task. In contrast, during continuous exposure to stimuli no triple interaction was evident. It is concluded that both magnitudes are automatically processed. Nevertheless, individuals with DD are deficient in inhibiting irrelevant magnitude information in general and, specifically, struggle to inhibit salient area information after initial exposure to a perimeter comparison task. Accordingly, the findings support the assumption that DD involves a deficiency in multiple cognitive components, which include domain-specific and domain-general cognitive functions.

Developmental Dyscalculia and Automatic Magnitudes Processing: Investigating Interference Effects between Area and Perimeter.

Science.gov (United States)

Eidlin-Levy, Hili; Rubinsten, Orly

2017-01-01

The relationship between numbers and other magnitudes has been extensively investigated in the scientific literature. Here, the objectives were to examine whether two continuous magnitudes, area and perimeter, are automatically processed and whether adults with developmental dyscalculia (DD) are deficient in their ability to automatically process one or both of these magnitudes. Fifty-seven students (30 with DD and 27 with typical development) performed a novel Stroop-like task requiring estimation of one aspect (area or perimeter) while ignoring the other. In order to track possible changes in automaticity due to practice, we measured performance after initial and continuous exposure to stimuli. Similar to previous findings, current results show a significant group × congruency interaction, evident beyond exposure level or magnitude type. That is, the DD group systematically showed larger Stroop effects. However, analysis of each exposure period showed that during initial exposure to stimuli the DD group showed larger Stroop effects in the perimeter and not in the area task. In contrast, during continuous exposure to stimuli no triple interaction was evident. It is concluded that both magnitudes are automatically processed. Nevertheless, individuals with DD are deficient in inhibiting irrelevant magnitude information in general and, specifically, struggle to inhibit salient area information after initial exposure to a perimeter comparison task. Accordingly, the findings support the assumption that DD involves a deficiency in multiple cognitive components, which include domain-specific and domain-general cognitive functions.

Biclustering of gene expression data using reactive greedy randomized adaptive search procedure.

Science.gov (United States)

Dharan, Smitha; Nair, Achuthsankar S

2009-01-30

Biclustering algorithms belong to a distinct class of clustering algorithms that perform simultaneous clustering of both rows and columns of the gene expression matrix and can be a very useful analysis tool when some genes have multiple functions and experimental conditions are diverse. Cheng and Church have introduced a measure called mean squared residue score to evaluate the quality of a bicluster and has become one of the most popular measures to search for biclusters. In this paper, we review basic concepts of the metaheuristics Greedy Randomized Adaptive Search Procedure (GRASP)-construction and local search phases and propose a new method which is a variant of GRASP called Reactive Greedy Randomized Adaptive Search Procedure (Reactive GRASP) to detect significant biclusters from large microarray datasets. The method has two major steps. First, high quality bicluster seeds are generated by means of k-means clustering. In the second step, these seeds are grown using the Reactive GRASP, in which the basic parameter that defines the restrictiveness of the candidate list is self-adjusted, depending on the quality of the solutions found previously. We performed statistical and biological validations of the biclusters obtained and evaluated the method against the results of basic GRASP and as well as with the classic work of Cheng and Church. The experimental results indicate that the Reactive GRASP approach outperforms the basic GRASP algorithm and Cheng and Church approach. The Reactive GRASP approach for the detection of significant biclusters is robust and does not require calibration efforts.

Design and evaluation of the ReKon : an integrated detection and assessment perimeter system.

Energy Technology Data Exchange (ETDEWEB)

Dabling, Jeffrey Glenn; Andersen, Jason Jann; McLaughlin, James O. [Stonewater Control Systems, Inc., Kannapolis, NC

2013-02-01

Kontek Industries (Kannapolis, NC) and their subsidiary, Stonewater Control Systems (Kannapolis, NC), have entered into a cooperative research and development agreement with Sandia to jointly develop and evaluate an integrated perimeter security system solution, one that couples access delay with detection and assessment. This novel perimeter solution was designed to be configurable for use at facilities ranging from high-security military sites to commercial power plants, to petro/chemical facilities of various kinds. A prototype section of the perimeter has been produced and installed at the Sandia Test and Evaluation Center in Albuquerque, NM. This prototype system integrated fiber optic break sensors, active infrared sensors, fence disturbance sensors, video motion detection, and ground sensors. This report documents the design, testing, and performance evaluation of the developed ReKon system. The ability of the system to properly detect pedestrian or vehicle attempts to bypass, breach, or otherwise defeat the system is characterized, as well as the Nuisance Alarm Rate.

DAVID: A new video motion sensor for outdoor perimeter applications

International Nuclear Information System (INIS)

Alexander, J.C.

1986-01-01

To be effective, a perimeter intrusion detection system must comprise both sensor and rapid assessment components. The use of closed circuit television (CCTV) to provide the rapid assessment capability, makes possible the use of video motion detection (VMD) processing as a system sensor component. Despite it's conceptual appeal, video motion detection has not been widely used in outdoor perimeter systems because of an inability to discriminate between genuine intrusions and numerous environmental effects such as cloud shadows, wind motion, reflections, precipitation, etc. The result has been an unacceptably high false alarm rate and operator work-load. DAVID (Digital Automatic Video Intrusion Detector) utilizes new digital signal processing techniques to achieve a dramatic improvement in discrimination performance thereby making video motion detection practical for outdoor applications. This paper begins with a discussion of the key considerations in implementing an outdoor video intrusion detection system, followed by a description of the DAVID design in light of these considerations

Top scientists join Stephen Hawking at Perimeter Institute

Science.gov (United States)

Banks, Michael

2009-03-01

Nine leading researchers are to join Stephen Hawking as visiting fellows at the Perimeter Institute for Theoretical Physics in Ontario, Canada. The researchers, who include string theorists Leonard Susskind from Stanford University and Asoka Sen from the Harisch-Chandra Research Institute in India, will each spend a few months of the year at the institute as "distinguished research chairs". They will be joined by another 30 scientists to be announced at a later date.

Asymptotics of the $s$-perimeter as $s\\searrow 0$

OpenAIRE

Dipierro, Serena; Figalli, Alessio; Palatucci, Giampiero; Valdinoci, Enrico

2012-01-01

We deal with the asymptotic behavior of the $s$-perimeter of a set $E$ inside a domain $\\Omega$ as $s\\searrow0$. We prove necessary and sufficient conditions for the existence of such limit, by also providing an explicit formulation in terms of the Lebesgue measure of $E$ and $\\Omega$. Moreover, we construct examples of sets for which the limit does not exist.

Refined universal laws for hull volumes and perimeters in large planar maps

International Nuclear Information System (INIS)

Guitter, Emmanuel

2017-01-01

We consider ensembles of planar maps with two marked vertices at distance k from each other, and look at the closed line separating these vertices and lying at distance d from the first one ( d   <   k ). This line divides the map into two components, the hull at distance d which corresponds to the part of the map lying on the same side as the first vertex and its complementary. The number of faces within the hull is called the hull volume, and the length of the separating line the hull perimeter. We study the statistics of the hull volume and perimeter for arbitrary d and k in the limit of infinitely large planar quadrangulations, triangulations and Eulerian triangulations. We consider more precisely situations where both d and k become large with the ratio d / k remaining finite. For infinitely large maps, two regimes may be encountered: either the hull has a finite volume and its complementary is infinitely large, or the hull itself has an infinite volume and its complementary is of finite size. We compute the probability for the map to be in either regime as a function of d / k as well as a number of universal statistical laws for the hull perimeter and volume when maps are conditioned to be in one regime or the other. (paper)

Design of complex bone internal structure using topology optimization with perimeter control.

Science.gov (United States)

Park, Jaejong; Sutradhar, Alok; Shah, Jami J; Paulino, Glaucio H

2018-03-01

Large facial bone loss usually requires patient-specific bone implants to restore the structural integrity and functionality that also affects the appearance of each patient. Titanium alloys (e.g., Ti-6Al-4V) are typically used in the interfacial porous coatings between the implant and the surrounding bone to promote stability. There exists a property mismatch between the two that in general leads to complications such as stress-shielding. This biomechanical discrepancy is a hurdle in the design of bone replacements. To alleviate the mismatch, the internal structure of the bone replacements should match that of the bone. Topology optimization has proven to be a good technique for designing bone replacements. However, the complex internal structure of the bone is difficult to mimic using conventional topology optimization methods without additional restrictions. In this work, the complex bone internal structure is recovered using a perimeter control based topology optimization approach. By restricting the solution space by means of the perimeter, the intricate design complexity of bones can be achieved. Three different bone regions with well-known physiological loadings are selected to illustrate the method. Additionally, we found that the target perimeter value and the pattern of the initial distribution play a vital role in obtaining the natural curvatures in the bone internal structures as well as avoiding excessive island patterns. Copyright © 2018 Elsevier Ltd. All rights reserved.

Clock Drawing in Spatial Neglect: A Comprehensive Analysis of Clock Perimeter, Placement, and Accuracy

Science.gov (United States)

Chen, Peii; Goedert, Kelly M.

2012-01-01

Clock drawings produced by right-brain-damaged (RBD) individuals with spatial neglect often contain an abundance of empty space on the left while numbers and hands are placed on the right. However, the clock perimeter is rarely compromised in neglect patients’ drawings. By analyzing clock drawings produced by 71 RBD and 40 healthy adults, this study investigated whether the geometric characteristics of the clock perimeter reveal novel insights to understanding spatial neglect. Neglect participants drew smaller clocks than either healthy or non-neglect RBD participants. While healthy participants’ clock perimeter was close to circular, RBD participants drew radially extended ellipses. The mechanisms for these phenomena were investigated by examining the relation between clock-drawing characteristics and performance on six subtests of the Behavioral Inattention Test (BIT). The findings indicated that the clock shape was independent of any BIT subtest or the drawing placement on the test sheet and that the clock size was significantly predicted by one BIT subtest: the poorer the figure and shape copying, the smaller the clock perimeter. Further analyses revealed that in all participants, clocks decreased in size as they were placed farther from the center of the paper. However, even when neglect participants placed their clocks towards the center of the page, they were smaller than those produced by healthy or non-neglect RBD participants. These results suggest a neglect-specific reduction in the subjectively available workspace for graphic production from memory, consistent with the hypothesis that neglect patients are impaired in the ability to enlarge the attentional aperture. PMID:22390278

Towards Rural Land Use: Challenges for Oversizing Urban Perimeters in Shrinking Towns

Science.gov (United States)

Sá, João; Virtudes, Ana

2017-12-01

This article, based on the literature review, aims to study the challenges of the urban dispersion and oversizing of urban perimeters, in the cases where the towns are shrinking or spreading to the rural land-use. It is focused on the case of Portugal where during the last decades there was an escaping to the big cities alongside to the sea (Atlantic and Mediterranean) shore. In the Interior part of the country, which means near to the border with Spain, several towns are shrinking, despite their huge urban perimeters, proposed by the municipal master plans, since the middle of the nineties. Consequently, these urban perimeters are nowadays oversizing, with empty buildings and non-urbanized areas. At the same time, the social patterns of occupation of this territory have changed significantly, moving from a society with signs of rurality to an urban realm, understood not only in territorial terms but also regarding the current lifestyle. This deep changing has occurred not only in urbanistic terms but also in the economic, cultural and social organizations of the country, under a movement that corresponds to a decline of the small urban settlements in rural areas, far away from the cosmopolitan strip of land nearby the sea, in between the capital city, Lisbon and the second one Oporto. These transformations were not driven by any significant public policy for land-use actions. On the contrary, the production of urban areas, supporting the new model of economic and social development was largely left to the initiative of economic and social private agents and land owners. These agents were the leading responsible for the new urban developments and housing. In this sense, this research aims to present some strategies for the short time period regarding the devolution of urban areas to rural land use. In this sense, the next steps of spatial planning policies, under the role of local authorities (the 308 municipalities including Madeira and Azores islands, plus the

Search Greedy for radial fuel optimization; Busqueda Greddy para optimizacion radial de combustible

Energy Technology Data Exchange (ETDEWEB)

Ortiz, J. J.; Castillo, J. A. [ININ, 52750 La Marquesa, Estado de Mexico (Mexico); Pelta, D. A. [Universidad de Granada, ETS Ingenieria Informatica y Telecomunicaciones, C/Daniel Saucedo Aranda s/n, 18071 Granada (Spain)]. e-mail: jjortiz@nuclear.inin.mx

2008-07-01

In this work a search algorithm Greedy is presented for the optimization of fuel cells in reactors BWR. As first phase a study was made of sensibility of the Factor of Pick of Local Power (FPPL) of the cell, in function of the exchange of the content of two fuel rods. His way it could settle down that then the rods to exchange do not contain gadolinium, small changes take place in the value of the FPPL of the cell. This knowledge was applied later in the search Greedy to optimize fuel cell. Exchanges of rods with gadolinium takes as a mechanism of global search and exchanges of rods without gadolinium takes as a method of local search. It worked with a cell of 10x10 rods and 2 circular water channels in center of the same one. From an inventory of enrichments of uranium and concentrations of given gadolinium and one distribution of well-known enrichments; the techniques finds good solutions that the FPPL minimizes, maintaining the factor of multiplication of neutrons in a range appropriate of values. In the low part of the assembly of a lot of recharge of a cycle of 18 months the cells were placed. The values of FPPL of the opposing cells are similar or smaller to those of the original cell and with behaviors in the nucleus also comparable to those obtained with the original cell. The evaluation of the cells was made with the code of transport CASMO-IV and the evaluation of the nucleus was made by means of the one simulator of the nucleus SIMULATE-3. (Author)

Greedy Local Search and Vertex Cover in Sparse Random Graphs

DEFF Research Database (Denmark)

Witt, Carsten

2009-01-01

. This work starts with a rigorous explanation for this claim based on the refined analysis of the Karp-Sipser algorithm by Aronson et al. Subsequently, theoretical supplements are given to experimental studies of search heuristics on random graphs. For c 1, a greedy and randomized local-search heuristic...... finds an optimal cover in polynomial time with a probability arbitrarily close to 1. This behavior relies on the absence of a giant component. As an additional insight into the randomized search, it is shown that the heuristic fails badly also on graphs consisting of a single tree component of maximum......Recently, various randomized search heuristics have been studied for the solution of the minimum vertex cover problem, in particular for sparse random instances according to the G(n, c/n) model, where c > 0 is a constant. Methods from statistical physics suggest that the problem is easy if c

Optimization of travel salesman problem using the ant colony system and Greedy search

International Nuclear Information System (INIS)

Esquivel E, J.; Ordonez A, A.; Ortiz S, J. J.

2008-01-01

In this paper we present some results obtained during the development of optimization systems that can be used to design refueling and patterns of control rods in a BWR. These systems use ant colonies and Greedy search. The first phase of this project is to be familiar with these optimization techniques applied to the problem of travel salesman problem (TSP). The utility of TSP study is that, like the refueling design and pattern design of control rods are problems of combinative optimization. Even, the similarity with the problem of the refueling design is remarkable. It is presented some results for the TSP with the 32 state capitals of Mexico country. (Author)

Experimental study of abdominal CT scanning exposal doses adjusted on the basis of pediatric abdominal perimeter

International Nuclear Information System (INIS)

Wei Wenzhou; Zhu Gongsheng; Zeng Lingyan; Yin Xianglin; Yang Fuwen; Liu Changsheng

2006-01-01

Objective: To optimize the abdominal helical CT scanning parameters in pediatric patients and to reduce its radiation hazards. Methods: 60 canines were evenly grouped into 4 groups on the basis of pediatric abdominal perimeter, scanned with 110,150,190 and 240 mAs, and their qualities of canine CT images were analyzed. 120 pediafric patients with clinic suspected abdominal diseases were divided into 4 groups on the basis of abdominal perimeter, scanned by optimal parameters and their image qualities were analyzed. Results: After CT exposure were reduced, the percentages of total A and B were 90.9 % and 92.0 % in experimental canines and in pediatric patients, respectively. Compared with conventional CT scanning, the exposure and single slice CT dose index weighted (CTDIw) were reduced to 45.8%-79.17%. Conclusion: By adjusted the pediatric helical CT parameters basedon the of pediatric abdominal perimeter, exposure of patient to the hazards of radiation is reduced. (authors)

Miniscrew-assisted rapid palatal expansion for managing arch perimeter in an adult patient

Directory of Open Access Journals (Sweden)

Amanda Carneiro da Cunha

Full Text Available ABSTRACT Introduction: Etiology of dental crowding may be related to arch constriction in diverse dimensions, and an appropriate manipulation of arch perimeter by intervening in basal bone discrepancies cases, may be a key for crowding relief, especially when incisors movement is limited due to underlying pathology, periodontal issues or restrictions related to soft tissue profile. Objectives: This case report illustrates a 24-year old woman, with maxillary transverse deficiency, upper and lower arches crowding, Class II, division 1, subdivision right relationship, previous upper incisors traumatic episode and straight profile. A non-surgical and non-extraction treatment approach was feasible due to the miniscrew-assisted rapid palatal expansion technique (MARPE. Methods: The MARPE appliance consisted of a conventional Hyrax expander supported by four orthodontic miniscrews. A slow expansion protocol was adopted, with an overall of 40 days of activation and a 3-month retention period. Intrusive traction miniscrew-anchored mechanics were used for correcting the Class II subdivision relationship, managing lower arch perimeter and midline deviation before including the upper central incisors. Results: Post-treatment records show an intermolar width increase of 5 mm, bilateral Class I molar and canine relationships, upper and lower crowding resolution, coincident dental midlines and proper intercuspation. Conclusions: The MARPE is an effective treatment approach for managing arch-perimeter deficiencies related to maxillary transverse discrepancies in adult patients.

A Guiding Evolutionary Algorithm with Greedy Strategy for Global Optimization Problems

Directory of Open Access Journals (Sweden)

Leilei Cao

2016-01-01

Full Text Available A Guiding Evolutionary Algorithm (GEA with greedy strategy for global optimization problems is proposed. Inspired by Particle Swarm Optimization, the Genetic Algorithm, and the Bat Algorithm, the GEA was designed to retain some advantages of each method while avoiding some disadvantages. In contrast to the usual Genetic Algorithm, each individual in GEA is crossed with the current global best one instead of a randomly selected individual. The current best individual served as a guide to attract offspring to its region of genotype space. Mutation was added to offspring according to a dynamic mutation probability. To increase the capability of exploitation, a local search mechanism was applied to new individuals according to a dynamic probability of local search. Experimental results show that GEA outperformed the other three typical global optimization algorithms with which it was compared.

Examining perimeter gating control of urban traffic networkswith locally adaptive traffic signals

NARCIS (Netherlands)

Keyvan Ekbatani, M.; Gao, X.; Gayah, V.V.; Knoop, V.L.

2015-01-01

Traditionally, urban traffic is controlled by traffic lights. Recent findings of the Macroscopic or Network Fundamental Diagram (MFD or NFD) have led to the development of novel traffic control strategies that can be applied at a networkwide level. One pertinent example is perimeter flow control

Differential GPS effectiveness in measuring area and perimeter in forested settings

International Nuclear Information System (INIS)

Frank, Jereme; Wing, Michael G

2013-01-01

This study quantifies area and perimeter measurement errors, traverse times, recording intervals, and overall time and cost effectiveness for using a mapping-grade differential Global Positioning System (GPS) receiver in forested settings. We compared two configurations including one that maximized data collection productivity (position dilution of precision (PDOP) 20, signal to noise ratio (SNR 33), and minimum elevation mask 5°) and a second that involved traditional receiver settings that was designed to improve accuracies (PDOP 6, SNR 39, and minimum elevation mask 15°). We determined that averaging 30 positions and using the settings that maximized productivity was the most time effective combination of recording interval and settings. This combination of recording interval and settings proved slightly more cost effective than other traditional surveying methods such as a laser with digital compass and string box. Average absolute per cent area errors when averaging 30 positions and using maximum settings were 2.6% and average absolute per cent perimeter errors were 2.0%. These results should help forest resource professionals more effectively evaluate GPS techniques and receiver configurations. (paper)

Adaptive Greedy Dictionary Selection for Web Media Summarization.

Science.gov (United States)

Cong, Yang; Liu, Ji; Sun, Gan; You, Quanzeng; Li, Yuncheng; Luo, Jiebo

2017-01-01

Initializing an effective dictionary is an indispensable step for sparse representation. In this paper, we focus on the dictionary selection problem with the objective to select a compact subset of basis from original training data instead of learning a new dictionary matrix as dictionary learning models do. We first design a new dictionary selection model via l 2,0 norm. For model optimization, we propose two methods: one is the standard forward-backward greedy algorithm, which is not suitable for large-scale problems; the other is based on the gradient cues at each forward iteration and speeds up the process dramatically. In comparison with the state-of-the-art dictionary selection models, our model is not only more effective and efficient, but also can control the sparsity. To evaluate the performance of our new model, we select two practical web media summarization problems: 1) we build a new data set consisting of around 500 users, 3000 albums, and 1 million images, and achieve effective assisted albuming based on our model and 2) by formulating the video summarization problem as a dictionary selection issue, we employ our model to extract keyframes from a video sequence in a more flexible way. Generally, our model outperforms the state-of-the-art methods in both these two tasks.

A Greedy Algorithm for Neighborhood Overlap-Based Community Detection

Directory of Open Access Journals (Sweden)

Natarajan Meghanathan

2016-01-01

Full Text Available The neighborhood overlap (NOVER of an edge u-v is defined as the ratio of the number of nodes who are neighbors for both u and v to that of the number of nodes who are neighbors of at least u or v. In this paper, we hypothesize that an edge u-v with a lower NOVER score bridges two or more sets of vertices, with very few edges (other than u-v connecting vertices from one set to another set. Accordingly, we propose a greedy algorithm of iteratively removing the edges of a network in the increasing order of their neighborhood overlap and calculating the modularity score of the resulting network component(s after the removal of each edge. The network component(s that have the largest cumulative modularity score are identified as the different communities of the network. We evaluate the performance of the proposed NOVER-based community detection algorithm on nine real-world network graphs and compare the performance against the multi-level aggregation-based Louvain algorithm, as well as the original and time-efficient versions of the edge betweenness-based Girvan-Newman (GN community detection algorithm.

An armored-cable-based fiber Bragg grating sensor array for perimeter fence intrusion detection

Science.gov (United States)

Hao, Jianzhong; Dong, Bo; Varghese, Paulose; Phua, Jiliang; Foo, Siang Fook

2012-01-01

In this paper, an armored-cable-based optical fiber Bragg grating (FBG) sensor array, for perimeter fence intrusion detection, is demonstrated and some of the field trial results are reported. The field trial was conducted at a critical local installation in Singapore in December 2010. The sensor array was put through a series of both simulated and live intrusion scenarios to test the stability and suitability of operation in the local environmental conditions and to determine its capabilities in detecting and reporting these intrusions accurately to the control station. Such a sensor array can provide perimeter intrusion detection with fine granularity and preset pin-pointing accuracy. The various types of intrusions included aided or unaided climbs, tampering and cutting of the fence, etc. The unique sensor packaging structure provides high sensitivity, crush resistance and protection against rodents. It is also capable of resolving nuisance events such as rain, birds sitting on the fence or seismic vibrations. These sensors are extremely sensitive with a response time of a few seconds. They can be customized for a desired spatial resolution and pre-determined sensitivity. Furthermore, it is easy to cascade a series of such sensors to monitor and detect intrusion events over a long stretch of fence line. Such sensors can be applied to real-time intrusion detection for perimeter security, pipeline security and communications link security.

Swivel arm perimeter for visual field testing in different body positions.

Science.gov (United States)

Flammer, J; Hendrickson, P; Lietz, A; Stümpfig, D

1993-01-01

To investigate the influence of body position on visual field results, a 'swivel arm perimeter' was built, based on a modified Octopus 1-2-3. Here, the measuring unit was detected from the control unit and mounted on a swivel arm, allowing its movement in all directions. The first results obtained with this device have indicated that its development was worthwhile.

Greedy Algorithm for the Construction of Approximate Decision Rules for Decision Tables with Many-Valued Decisions

KAUST Repository

Azad, Mohammad

2016-10-20

The paper is devoted to the study of a greedy algorithm for construction of approximate decision rules. This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. We consider bounds on the precision of this algorithm relative to the length of rules. To illustrate proposed approach we study a problem of recognition of labels of points in the plain. This paper contains also results of experiments with modified decision tables from UCI Machine Learning Repository.

Greedy Algorithm for the Construction of Approximate Decision Rules for Decision Tables with Many-Valued Decisions

KAUST Repository

Azad, Mohammad; Moshkov, Mikhail; Zielosko, Beata

2016-01-01

The paper is devoted to the study of a greedy algorithm for construction of approximate decision rules. This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. We consider bounds on the precision of this algorithm relative to the length of rules. To illustrate proposed approach we study a problem of recognition of labels of points in the plain. This paper contains also results of experiments with modified decision tables from UCI Machine Learning Repository.

Perimeter generating functions for the mean-squared radius of gyration of convex polygons

International Nuclear Information System (INIS)

Jensen, Iwan

2005-01-01

We have derived long series expansions for the perimeter generating functions of the radius of gyration of various polygons with a convexity constraint. Using the series we numerically find simple (algebraic) exact solutions for the generating functions. In all cases the size exponent ν 1. (letter to the editor)

Ship Block Transportation Scheduling Problem Based on Greedy Algorithm

Directory of Open Access Journals (Sweden)

Chong Wang

2016-05-01

Full Text Available Ship block transportation problems are crucial issues to address in reducing the construction cost and improving the productivity of shipyards. Shipyards aim to maximize the workload balance of transporters with time constraint such that all blocks should be transported during the planning horizon. This process leads to three types of penalty time: empty transporter travel time, delay time, and tardy time. This study aims to minimize the sum of the penalty time. First, this study presents the problem of ship block transportation with the generalization of the block transportation restriction on the multi-type transporter. Second, the problem is transformed into the classical traveling salesman problem and assignment problem through a reasonable model simplification and by adding a virtual node to the proposed directed graph. Then, a heuristic algorithm based on greedy algorithm is proposed to assign blocks to available transporters and sequencing blocks for each transporter simultaneously. Finally, the numerical experiment method is used to validate the model, and its result shows that the proposed algorithm is effective in realizing the efficient use of the transporters in shipyards. Numerical simulation results demonstrate the promising application of the proposed method to efficiently improve the utilization of transporters and to reduce the cost of ship block logistics for shipyards.

Evaluation of high-perimeter electrode designs for deep brain stimulation

Science.gov (United States)

Howell, Bryan; Grill, Warren M.

2014-08-01

Objective. Deep brain stimulation (DBS) is an effective treatment for movement disorders and a promising therapy for treating epilepsy and psychiatric disorders. Despite its clinical success, complications including infections and mis-programing following surgical replacement of the battery-powered implantable pulse generator adversely impact the safety profile of this therapy. We sought to decrease power consumption and extend battery life by modifying the electrode geometry to increase stimulation efficiency. The specific goal of this study was to determine whether electrode contact perimeter or area had a greater effect on increasing stimulation efficiency. Approach. Finite-element method (FEM) models of eight prototype electrode designs were used to calculate the electrode access resistance, and the FEM models were coupled with cable models of passing axons to quantify stimulation efficiency. We also measured in vitro the electrical properties of the prototype electrode designs and measured in vivo the stimulation efficiency following acute implantation in anesthetized cats. Main results. Area had a greater effect than perimeter on altering the electrode access resistance; electrode (access or dynamic) resistance alone did not predict stimulation efficiency because efficiency was dependent on the shape of the potential distribution in the tissue; and, quantitative assessment of stimulation efficiency required consideration of the effects of the electrode-tissue interface impedance. Significance. These results advance understanding of the features of electrode geometry that are important for designing the next generation of efficient DBS electrodes.

Optimization of approximate decision rules relative to number of misclassifications: Comparison of greedy and dynamic programming approaches

KAUST Repository

Amin, Talha

2013-01-01

In the paper, we present a comparison of dynamic programming and greedy approaches for construction and optimization of approximate decision rules relative to the number of misclassifications. We use an uncertainty measure that is a difference between the number of rows in a decision table T and the number of rows with the most common decision for T. For a nonnegative real number γ, we consider γ-decision rules that localize rows in subtables of T with uncertainty at most γ. Experimental results with decision tables from the UCI Machine Learning Repository are also presented. © 2013 Springer-Verlag.

Performance improvement of multi-class detection using greedy algorithm for Viola-Jones cascade selection

Science.gov (United States)

Tereshin, Alexander A.; Usilin, Sergey A.; Arlazarov, Vladimir V.

2018-04-01

This paper aims to study the problem of multi-class object detection in video stream with Viola-Jones cascades. An adaptive algorithm for selecting Viola-Jones cascade based on greedy choice strategy in solution of the N-armed bandit problem is proposed. The efficiency of the algorithm on the problem of detection and recognition of the bank card logos in the video stream is shown. The proposed algorithm can be effectively used in documents localization and identification, recognition of road scene elements, localization and tracking of the lengthy objects , and for solving other problems of rigid object detection in a heterogeneous data flows. The computational efficiency of the algorithm makes it possible to use it both on personal computers and on mobile devices based on processors with low power consumption.

Design and testing of a perimeter of increment threshold by projection

OpenAIRE

García Domene, María del Carmen; Luque Cobija, María José; Fez Saiz, Dolores de

2017-01-01

In the present study, we have designed and tested a perimeter for the detection of damage in the chromatic mechanisms using a video projector. To this purpose, we have characterized pixel to pixel a video projector, to account for the inhomogeneities in the projection. We have measured the tristimulus values of the projector primaries as a function of digital level, at 49 locations of the projection screen and, from them, we have arrived to a characterization model which reduces the color dif...

[Irrigated perimeters as a geopolitical strategy for the development of the semi-arid region and its implications for health, labor and the environment].

Science.gov (United States)

Pontes, Andrezza Graziella Veríssimo; Gadelha, Diego; Freitas, Bernadete Maria Coêlho; Rigotto, Raquel Maria; Ferreira, Marcelo José Monteiro

2013-11-01

An analysis was made of irrigated perimeters as a geopolitical strategy for expanding Brazilian agricultural frontiers and the "development" of the northeastern semi-arid region with respect to social determinants in health in rural communities. Research was conducted in the Chapada do Apodi in the states of Ceará and Rio Grande do Norte between 2007 and 2011. Various research techniques and tools were adopted, such as research-action, ethnographic studies, questionnaires and laboratory exams, water contamination analyses, social cartography and focal groups. In the context of agribusiness expansion, it was revealed that public policies of irrigation have had consequences for health, labor and the environment with the implementation of the Jaguaribe-Apodi Irrigated Perimeter in Ceará. The social and environmental conflict and resistance in the phase prior to the installation of the Santa Cruz do Apodi Irrigated Perimeter in Rio Grande do Norte was significant as it had consequences for the health-disease process on rural communities. It is important for the evaluation of public irrigation policies to consider the impacts of the perimeters on the lifestyle, labor, health and the environment of the affected territories.

Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic

Science.gov (United States)

2014-01-01

Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP), which aims to minimize total service time, and proposes an iterated greedy (IG) algorithm to solve it. The proposed IG algorithm is tested on three benchmark problem sets. Experimental results show that the proposed IG algorithm can obtain optimal solutions for all test instances of the first and second problem sets and outperforms the best-known solutions for 35 out of 90 test instances of the third problem set. PMID:25295295

Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic

Directory of Open Access Journals (Sweden)

Shih-Wei Lin

2014-01-01

Full Text Available Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP, which aims to minimize total service time, and proposes an iterated greedy (IG algorithm to solve it. The proposed IG algorithm is tested on three benchmark problem sets. Experimental results show that the proposed IG algorithm can obtain optimal solutions for all test instances of the first and second problem sets and outperforms the best-known solutions for 35 out of 90 test instances of the third problem set.

A greedy algorithm for construction of decision trees for tables with many-valued decisions - A comparative study

KAUST Repository

Azad, Mohammad

2013-11-25

In the paper, we study a greedy algorithm for construction of decision trees. This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. Experimental results for data sets from UCI Machine Learning Repository and randomly generated tables are presented. We make a comparative study of the depth and average depth of the constructed decision trees for proposed approach and approach based on generalized decision. The obtained results show that the proposed approach can be useful from the point of view of knowledge representation and algorithm construction.

A greedy algorithm for construction of decision trees for tables with many-valued decisions - A comparative study

KAUST Repository

Azad, Mohammad; Chikalov, Igor; Moshkov, Mikhail; Zielosko, Beata

2013-01-01

In the paper, we study a greedy algorithm for construction of decision trees. This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. Experimental results for data sets from UCI Machine Learning Repository and randomly generated tables are presented. We make a comparative study of the depth and average depth of the constructed decision trees for proposed approach and approach based on generalized decision. The obtained results show that the proposed approach can be useful from the point of view of knowledge representation and algorithm construction.

Analysis Of The Socioeconomic And Environmental Impacts Of Irrigated Agriculture In The Irrigated Perimeter Of Pau Dos Ferros (Rn

Directory of Open Access Journals (Sweden)

José Jobson Garcia de Almeida

2014-07-01

Full Text Available The Brazilian Government implemented irrigated perimeters to ameliorate problems of drought and poverty in the Northeast. In this sense, the objective of this work was to analyze the social, economic and environmental impacts generated by the practice of irrigated agriculture in the municipality of Pau dos Ferros-RN, resulting from the impacts caused by the activity. Obtained references on the topic, on-site visits and interviews with producers of the perimeter. It was observed the presence of negative impacts in the area, such as waste, contamination and water salinisation, compaction and soil erosion, deforestation caused by the removal of the native vegetation, high consumption of energy and public health problems.

BILGO: Bilateral greedy optimization for large scale semidefinite programming

KAUST Repository

Hao, Zhifeng; Yuan, Ganzhao; Ghanem, Bernard

2013-01-01

Many machine learning tasks (e.g. metric and manifold learning problems) can be formulated as convex semidefinite programs. To enable the application of these tasks on a large-scale, scalability and computational efficiency are considered as desirable properties for a practical semidefinite programming algorithm. In this paper, we theoretically analyze a new bilateral greedy optimization (denoted BILGO) strategy in solving general semidefinite programs on large-scale datasets. As compared to existing methods, BILGO employs a bilateral search strategy during each optimization iteration. In such an iteration, the current semidefinite matrix solution is updated as a bilateral linear combination of the previous solution and a suitable rank-1 matrix, which can be efficiently computed from the leading eigenvector of the descent direction at this iteration. By optimizing for the coefficients of the bilateral combination, BILGO reduces the cost function in every iteration until the KKT conditions are fully satisfied, thus, it tends to converge to a global optimum. In fact, we prove that BILGO converges to the global optimal solution at a rate of O(1/k), where k is the iteration counter. The algorithm thus successfully combines the efficiency of conventional rank-1 update algorithms and the effectiveness of gradient descent. Moreover, BILGO can be easily extended to handle low rank constraints. To validate the effectiveness and efficiency of BILGO, we apply it to two important machine learning tasks, namely Mahalanobis metric learning and maximum variance unfolding. Extensive experimental results clearly demonstrate that BILGO can solve large-scale semidefinite programs efficiently.

BILGO: Bilateral greedy optimization for large scale semidefinite programming

KAUST Repository

Hao, Zhifeng

2013-10-03

Many machine learning tasks (e.g. metric and manifold learning problems) can be formulated as convex semidefinite programs. To enable the application of these tasks on a large-scale, scalability and computational efficiency are considered as desirable properties for a practical semidefinite programming algorithm. In this paper, we theoretically analyze a new bilateral greedy optimization (denoted BILGO) strategy in solving general semidefinite programs on large-scale datasets. As compared to existing methods, BILGO employs a bilateral search strategy during each optimization iteration. In such an iteration, the current semidefinite matrix solution is updated as a bilateral linear combination of the previous solution and a suitable rank-1 matrix, which can be efficiently computed from the leading eigenvector of the descent direction at this iteration. By optimizing for the coefficients of the bilateral combination, BILGO reduces the cost function in every iteration until the KKT conditions are fully satisfied, thus, it tends to converge to a global optimum. In fact, we prove that BILGO converges to the global optimal solution at a rate of O(1/k), where k is the iteration counter. The algorithm thus successfully combines the efficiency of conventional rank-1 update algorithms and the effectiveness of gradient descent. Moreover, BILGO can be easily extended to handle low rank constraints. To validate the effectiveness and efficiency of BILGO, we apply it to two important machine learning tasks, namely Mahalanobis metric learning and maximum variance unfolding. Extensive experimental results clearly demonstrate that BILGO can solve large-scale semidefinite programs efficiently.

Nearest greedy for solving the waste collection vehicle routing problem: A case study

Science.gov (United States)

Mat, Nur Azriati; Benjamin, Aida Mauziah; Abdul-Rahman, Syariza; Wibowo, Antoni

2017-11-01

This paper presents a real case study pertaining to an issue related to waste collection in the northern part of Malaysia by using a constructive heuristic algorithm known as the Nearest Greedy (NG) technique. This technique has been widely used to devise initial solutions for issues concerning vehicle routing. Basically, the waste collection cycle involves the following steps: i) each vehicle starts from a depot, ii) visits a number of customers to collect waste, iii) unloads waste at the disposal site, and lastly, iv) returns to the depot. Moreover, the sample data set used in this paper consisted of six areas, where each area involved up to 103 customers. In this paper, the NG technique was employed to construct an initial route for each area. The solution proposed from the technique was compared with the present vehicle routes implemented by a waste collection company within the city. The comparison results portrayed that NG offered better vehicle routes with a 11.07% reduction of the total distance traveled, in comparison to the present vehicle routes.

THE IMPACT ASSESSMENT OF THE ABANDONED URANIUM MINING EXPLOITATIONS ON ROCKS AND SOILS - ZIMBRU PERIMETER, ARAD COUNTY

Directory of Open Access Journals (Sweden)

DIANA M. BANU

2016-10-01

Full Text Available The mining exploration and exploitation, especially the activity of uranium mineralization exploration and exploitation has a negative impact on the environment by the alterations of the landscape and the degradation of the environmental factors' quality. The principal environmental factors that could be affected by mining operations resulting from uranium exploitation are: water, air, soil, population, fauna, and flora. The aim of this study is, first, to identify the sources of pollution (natural radionuclides - natural radioactive series of uranium, radium, thorium, potassium and heavy metals that are accompanying the mineralizations for two of the most important environmental factors: rocks and soils: and, second, to assess the pollution impact on those two environmental factors. In order to identify this pollutants and their impact assessment it was selected as a study case an abandoned uranium mining perimeter named the Zimbru perimeter located in Arad County, Romania.

Application Development: AN Interactive, Non-Technical Perspective of the Geology and Geomorphology of the Ouray Perimeter Tail, CO.

Science.gov (United States)

Allen, H. M.; Giardino, J. R.

2015-12-01

Each year people seek respite from their busy lifestyles by traveling to state or national parks, national forests or wilderness areas. The majority of these parks were established in order to help preserve our natural heritage, including wildlife, forests, and the beauty of landscapes formed from thousands of years of geologic/geomorphologic processes. Whilst being able to enjoy the tranquility of nature, tourists are being robbed of a more in-depth experience as a result of the lack of a geologic background. One such location that attracts a large number of summer tourists is the perimeter trail in Ouray, Colorado. Located in the Southwestern portion of Colorado, Ouray is situated in the beautiful San Juan Mountain range along the "Million Dollar Highway." The Perimeter trail is a six-mile trail loop that circles the city of Ouray. The city is a very popular place for summertime tourism because of its unparalleled scenery. Ouray is situated in an area that is riddled with textbook angular unconformities, metasedimentary, sedimentary, and volcanic rocks. In the study area, The San Juans have been beautifully sculpted by an array of major faulting events, glacial activity and volcanics. With the understanding that technology is ever expanding, we think there is no better way to experience the Perimeter Trail than to have an interactive application that will be both educational as well as interesting. This application is a non-technical way of looking at the geology and geomorphology of the perimeter trail. Additionally, a paper brochure shows the most noteworthy points of interest. The brochure contains a brief geologic history of the San Juan Mountains accompanied with annotated photographs to illustrate the complex geology/geomorphology encountered on the trail. The application is based on an interactive three-dimensional map, which can be zoomed to various scales. The app hosts a locational service that uses the phone's GPS to communicate location of the hiker

Testing the effects of perimeter fencing and elephant exclosures on lion predation patterns in a Kenyan wildlife conservancy.

Science.gov (United States)

Dupuis-Desormeaux, Marc; Davidson, Zeke; Pratt, Laura; Mwololo, Mary; MacDonald, Suzanne E

2016-01-01

The use of fences to segregate wildlife can change predator and prey behaviour. Predators can learn to incorporate fencing into their hunting strategies and prey can learn to avoid foraging near fences. A twelve-strand electric predator-proof fence surrounds our study site. There are also porous one-strand electric fences used to create exclosures where elephant (and giraffe) cannot enter in order to protect blocs of browse vegetation for two critically endangered species, the black rhinoceros (Diceros bicornis) and the Grevy's zebra (Equus grevyi). The denser vegetation in these exclosures attracts both browsing prey and ambush predators. In this study we examined if lion predation patterns differed near the perimeter fencing and inside the elephant exclosures by mapping the location of kills. We used a spatial analysis to compare the predation patterns near the perimeter fencing and inside the exclosures to predation in the rest of the conservancy. Predation was not over-represented near the perimeter fence but the pattern of predation near the fence suggests that fences may be a contributing factor to predation success. Overall, we found that predation was over-represented inside and within 50 m of the exclosures. However, by examining individual exclosures in greater detail using a hot spot analysis, we found that only a few exclosures contained lion predation hot spots. Although some exclosures provide good hunting grounds for lions, we concluded that exclosures did not necessarily create prey-traps per se and that managers could continue to use this type of exclusionary fencing to protect stands of dense vegetation.

Testing the effects of perimeter fencing and elephant exclosures on lion predation patterns in a Kenyan wildlife conservancy

Directory of Open Access Journals (Sweden)

Marc Dupuis-Desormeaux

2016-02-01

Full Text Available The use of fences to segregate wildlife can change predator and prey behaviour. Predators can learn to incorporate fencing into their hunting strategies and prey can learn to avoid foraging near fences. A twelve-strand electric predator-proof fence surrounds our study site. There are also porous one-strand electric fences used to create exclosures where elephant (and giraffe cannot enter in order to protect blocs of browse vegetation for two critically endangered species, the black rhinoceros (Diceros bicornis and the Grevy’s zebra (Equus grevyi. The denser vegetation in these exclosures attracts both browsing prey and ambush predators. In this study we examined if lion predation patterns differed near the perimeter fencing and inside the elephant exclosures by mapping the location of kills. We used a spatial analysis to compare the predation patterns near the perimeter fencing and inside the exclosures to predation in the rest of the conservancy. Predation was not over-represented near the perimeter fence but the pattern of predation near the fence suggests that fences may be a contributing factor to predation success. Overall, we found that predation was over-represented inside and within 50 m of the exclosures. However, by examining individual exclosures in greater detail using a hot spot analysis, we found that only a few exclosures contained lion predation hot spots. Although some exclosures provide good hunting grounds for lions, we concluded that exclosures did not necessarily create prey-traps per se and that managers could continue to use this type of exclusionary fencing to protect stands of dense vegetation.

On the statistics of uplink inter-cell interference with greedy resource allocation

KAUST Repository

Tabassum, Hina

2012-10-03

In this paper, we introduce a new methodology to model the uplink inter-cell interference (ICI) in wireless cellular networks. The model takes into account both the effect of channel statistics (i.e., path loss, shadowing, fading) and the resource allocation scheme in the interfering cells. Firstly, we derive a semi-analytical expression for the distribution of the locations of the allocated user in a given cell considering greedy resource allocation with maximum signal-to-noise ratio (SNR) criterion. Based on this, we derive the distribution of the uplink ICI from one neighboring cell. Next, we compute the moment generating function (MGF) of the cumulative ICI observed from all neighboring cells and discuss some examples. Finally, we utilize the derived expressions to evaluate the outage probability in the network. In order to validate the accuracy of the developed semi-analytical expressions, we present comparison results with Monte Carlo simulations. The major benefit of the proposed mechanism is that it helps in estimating the distribution of ICI without the knowledge of instantaneous resource allocations in the neighbor cells. The proposed methodology applies to any shadowing and fading distributions. Moreover, it can be used to evaluate important network performance metrics numerically without the need for time-consuming Monte Carlo simulations. © 2011 IEEE.

On the statistics of uplink inter-cell interference with greedy resource allocation

KAUST Repository

Tabassum, Hina; Yilmaz, Ferkan; Dawy, Zaher; Alouini, Mohamed-Slim

2012-01-01

In this paper, we introduce a new methodology to model the uplink inter-cell interference (ICI) in wireless cellular networks. The model takes into account both the effect of channel statistics (i.e., path loss, shadowing, fading) and the resource allocation scheme in the interfering cells. Firstly, we derive a semi-analytical expression for the distribution of the locations of the allocated user in a given cell considering greedy resource allocation with maximum signal-to-noise ratio (SNR) criterion. Based on this, we derive the distribution of the uplink ICI from one neighboring cell. Next, we compute the moment generating function (MGF) of the cumulative ICI observed from all neighboring cells and discuss some examples. Finally, we utilize the derived expressions to evaluate the outage probability in the network. In order to validate the accuracy of the developed semi-analytical expressions, we present comparison results with Monte Carlo simulations. The major benefit of the proposed mechanism is that it helps in estimating the distribution of ICI without the knowledge of instantaneous resource allocations in the neighbor cells. The proposed methodology applies to any shadowing and fading distributions. Moreover, it can be used to evaluate important network performance metrics numerically without the need for time-consuming Monte Carlo simulations. © 2011 IEEE.

Chaos and order in stateless societies: Intercommunity exchange as a factor impacting the population dynamical patterns

International Nuclear Information System (INIS)

Medvinsky, Alexander B.; Rusakov, Alexey V.

2011-01-01

Highlights: → We model community dynamics in stateless societies. → Intercommunity barter is shown to be a factor impacting the societies dynamics. → Increase in the human population growth rate can lead to appearance of chaos. → Secular and millennial cycles are found to arise as a result of the barter. - Abstract: The once abstract notions of dynamical chaos now appear naturally in various systems [Kaplan D, Glass L. Understanding nonlinear dynamics. New York: Springer; 1995]. As a result, future trajectories of the systems may be difficult to predict. In this paper, we demonstrate the appearance of chaotic dynamics in model human communities, which consist of producers of agricultural product and producers of agricultural equipment. In the case of a solitary community, the horizon of predictability of the human population dynamics is shown to be dependent on both intrinsic instability of the dynamics and the chaotic attractor sizes. Since a separate community is usually a part of a larger commonality, we study the dynamics of social systems consisting of two interacting communities. We show that intercommunity barter can lead to stabilization of the dynamics in one of the communities, which implies persistence of stable equilibrium under changes of the maximum value of the human population growth rate. However, in the neighboring community, the equilibrium turns into a stable limit cycle as the maximum value of the human population growth rate increases. Following an increase in the maximum value of the human population growth rate leads to period-doubling bifurcations resulting in chaotic dynamics. The horizon of predictability of the chaotic oscillations is found to be limited by 5 years. We demonstrate that the intercommunity interaction can lead to the appearance of long-period harmonics in the chaotic time series. The period of the harmonics is of order 100 and 1000 years. Hence the long-period changes in the population size may be considered as an

Chaos and order in stateless societies: Intercommunity exchange as a factor impacting the population dynamical patterns

Energy Technology Data Exchange (ETDEWEB)

Medvinsky, Alexander B., E-mail: medvinsky@iteb.ru [Institute of Theoretical and Experimental Biophysics, Russian Academy of Sciences, Pushchino 142290, Moscow Region (Russian Federation); Rusakov, Alexey V. [Institute of Theoretical and Experimental Biophysics, Russian Academy of Sciences, Pushchino 142290, Moscow Region (Russian Federation)

2011-06-15

Highlights: > We model community dynamics in stateless societies. > Intercommunity barter is shown to be a factor impacting the societies dynamics. > Increase in the human population growth rate can lead to appearance of chaos. > Secular and millennial cycles are found to arise as a result of the barter. - Abstract: The once abstract notions of dynamical chaos now appear naturally in various systems [Kaplan D, Glass L. Understanding nonlinear dynamics. New York: Springer; 1995]. As a result, future trajectories of the systems may be difficult to predict. In this paper, we demonstrate the appearance of chaotic dynamics in model human communities, which consist of producers of agricultural product and producers of agricultural equipment. In the case of a solitary community, the horizon of predictability of the human population dynamics is shown to be dependent on both intrinsic instability of the dynamics and the chaotic attractor sizes. Since a separate community is usually a part of a larger commonality, we study the dynamics of social systems consisting of two interacting communities. We show that intercommunity barter can lead to stabilization of the dynamics in one of the communities, which implies persistence of stable equilibrium under changes of the maximum value of the human population growth rate. However, in the neighboring community, the equilibrium turns into a stable limit cycle as the maximum value of the human population growth rate increases. Following an increase in the maximum value of the human population growth rate leads to period-doubling bifurcations resulting in chaotic dynamics. The horizon of predictability of the chaotic oscillations is found to be limited by 5 years. We demonstrate that the intercommunity interaction can lead to the appearance of long-period harmonics in the chaotic time series. The period of the harmonics is of order 100 and 1000 years. Hence the long-period changes in the population size may be considered as an

Greedy solution of ill-posed problems: error bounds and exact inversion

International Nuclear Information System (INIS)

Denis, L; Lorenz, D A; Trede, D

2009-01-01

The orthogonal matching pursuit (OMP) is a greedy algorithm to solve sparse approximation problems. Sufficient conditions for exact recovery are known with and without noise. In this paper we investigate the applicability of the OMP for the solution of ill-posed inverse problems in general, and in particular for two deconvolution examples from mass spectrometry and digital holography, respectively. In sparse approximation problems one often has to deal with the problem of redundancy of a dictionary, i.e. the atoms are not linearly independent. However, one expects them to be approximatively orthogonal and this is quantified by the so-called incoherence. This idea cannot be transferred to ill-posed inverse problems since here the atoms are typically far from orthogonal. The ill-posedness of the operator probably causes the correlation of two distinct atoms to become huge, i.e. that two atoms look much alike. Therefore, one needs conditions which take the structure of the problem into account and work without the concept of coherence. In this paper we develop results for the exact recovery of the support of noisy signals. In the two examples, mass spectrometry and digital holography, we show that our results lead to practically relevant estimates such that one may check a priori if the experimental setup guarantees exact deconvolution with OMP. Especially in the example from digital holography, our analysis may be regarded as a first step to calculate the resolution power of droplet holography

Debate: Limitations on universality: the "right to health" and the necessity of legal nationality

Science.gov (United States)

2010-01-01

Background The "right to health," including access to basic healthcare, has been recognized as a universal human right through a number of international agreements. Attempts to protect this ideal, however, have relied on states as the guarantor of rights and have subsequently ignored stateless individuals, or those lacking legal nationality in any nation-state. While a legal nationality alone is not sufficient to guarantee that a right to healthcare is accessible, an absence of any legal nationality is almost certainly an obstacle in most cases. There are millions of so-called stateless individuals around the globe who are, in effect, denied medical citizenship in their countries of residence. A central motivating factor for this essay is the fact that statelessness as a concept is largely absent from the medical literature. The goal for this discussion, therefore, is primarily to illustrate the need for further monitoring of health access issues by the medical community, and for a great deal more research into the effects of statelessness upon access to healthcare. This is important both as a theoretical issue, in light of the recognition by many of healthcare as a universal right, as well as an empirical fact that requires further exploration and amelioration. Discussion Most discussions of the human right to health assume that every human being has legal nationality, but in reality there are at least 11 to 12 million stateless individuals worldwide who are often unable to access basic healthcare. The examples of the Roma in Europe, the hill tribes of Thailand, and many Palestinians in Israel highlight the negative health impacts associated with statelessness. Summary Stateless individuals often face an inability to access the most basic healthcare, much less the "highest attainable standard of health" outlined by international agreements. Rather than presuming nationality, statelessness must be recognized by the medical community. Additionally, it is imperative

Preferential Hyperacuity Perimeter (PreView PHP) for detecting choroidal neovascularization study.

Science.gov (United States)

Alster, Yair; Bressler, Neil M; Bressler, Susan B; Brimacombe, Judith A; Crompton, R Michael; Duh, Yi-Jing; Gabel, Veit-Peter; Heier, Jeffrey S; Ip, Michael S; Loewenstein, Anat; Packo, Kirk H; Stur, Michael; Toaff, Techiya

2005-10-01

To assess the ability of the Preferential Hyperacuity Perimeter (PreView PHP; Carl Zeiss Meditec, Dublin, CA) to detect recent-onset choroidal neovascularization (CNV) resulting from age-related macular degeneration (AMD) and to differentiate it from an intermediate stage of AMD. Prospective, comparative, concurrent, nonrandomized, multicenter study. Eligible participants' study eyes had a corrected visual acuity of 20/160 or better and either untreated CNV from AMD diagnosed within the last 60 days or an intermediate stage of AMD. After obtaining consent, visual acuity with habitual correction, masked PHP testing, stereoscopic color fundus photography, and fluorescein angiography were performed. Photographs and angiograms were evaluated by graders masked to diagnosis and PHP results. The reading center's diagnosis determined if the patient was categorized as having intermediate AMD or neovascular AMD. A successful study outcome was defined a priori as a sensitivity of at least 80% and a specificity of at least 80%. Of 185 patients who gave consent to be enrolled, 11 (6%) had PHP results judged to be unreliable. An additional 52 were not included because they did not meet all eligibility criteria. Of the remaining 122 patients, 57 had an intermediate stage of AMD and 65 had neovascular AMD. The sensitivity to detect newly diagnosed CNV using PHP testing was 82% (95% confidence interval [CI], 70%-90%). The specificity to differentiate newly diagnosed CNV from the intermediate stage of AMD using PHP testing was 88% (95% CI, 76%-95%). Preferential Hyperacuity Perimeter testing can detect recent-onset CNV resulting from AMD and can differentiate it from an intermediate stage of AMD with high sensitivity and specificity. These data suggest that monitoring with PHP should detect most cases of CNV of recent onset with few false-positive results at a stage when treatment usually would be beneficial. Thus, this monitoring should be considered in the management of the

Farmers’ willingness to pay for surface water in the West Mitidja irrigated perimeter, northern Algeria

International Nuclear Information System (INIS)

Azzi, M.; Calatrava, J.; Bedrani, S.

2018-01-01

Algeria is among the most water-stressed countries in the world. Because of its climatic conditions, irrigation is essential for agricultural production. Water prices paid by farmers in public irrigation districts are very low and do not cover the operation and maintenance (O&M) costs of the irrigated perimeters, thus leading to the deterioration of these infrastructures. The objective of this paper is to analyse whether farmer’s in the West Mitidja irrigation district in northern Algeria would be willing to pay more for surface water in order to maintain the water supply service in its current conditions. We estimated farmers’ willingness to pay (WTP) for water using data from a dichotomous choice contingent valuation survey to 112 randomly selected farmers. Farmers’ responses were modelled using logistic regression techniques. We also analysed which technical, structural, social and economic characteristics of farms and farmers explain the differences in WTP. Our results showed that nearly 80% of the surveyed farmers are willing to pay an extra price for irrigation water. The average WTP was 64% greater than the price currently paid by farmers, suggesting some scope for improving the financial resources of the Mitidja irrigated perimeter, but insufficient to cover all O&M costs. Some of the key identified factors that affect WTP for surface water relate to farm ownership, access to groundwater resources, cropping patterns, farmers’ agricultural training and risk exposure.

Rigorous derivation of the perimeter generating functions for the mean-squared radius of gyration of rectangular, Ferrers and pyramid polygons

International Nuclear Information System (INIS)

Lin, Keh Ying

2006-01-01

We have derived rigorously the perimeter generating functions for the mean-squared radius of gyration of rectangular, Ferrers and pyramid polygons. These functions were found by Jensen recently. His nonrigorous results are based on the analysis of the long series expansions. (comment)

Unsupervised quantification of abdominal fat from CT images using Greedy Snakes

Science.gov (United States)

Agarwal, Chirag; Dallal, Ahmed H.; Arbabshirani, Mohammad R.; Patel, Aalpen; Moore, Gregory

2017-02-01

Adipose tissue has been associated with adverse consequences of obesity. Total adipose tissue (TAT) is divided into subcutaneous adipose tissue (SAT) and visceral adipose tissue (VAT). Intra-abdominal fat (VAT), located inside the abdominal cavity, is a major factor for the classic obesity related pathologies. Since direct measurement of visceral and subcutaneous fat is not trivial, substitute metrics like waist circumference (WC) and body mass index (BMI) are used in clinical settings to quantify obesity. Abdominal fat can be assessed effectively using CT or MRI, but manual fat segmentation is rather subjective and time-consuming. Hence, an automatic and accurate quantification tool for abdominal fat is needed. The goal of this study is to extract TAT, VAT and SAT fat from abdominal CT in a fully automated unsupervised fashion using energy minimization techniques. We applied a four step framework consisting of 1) initial body contour estimation, 2) approximation of the body contour, 3) estimation of inner abdominal contour using Greedy Snakes algorithm, and 4) voting, to segment the subcutaneous and visceral fat. We validated our algorithm on 952 clinical abdominal CT images (from 476 patients with a very wide BMI range) collected from various radiology departments of Geisinger Health System. To our knowledge, this is the first study of its kind on such a large and diverse clinical dataset. Our algorithm obtained a 3.4% error for VAT segmentation compared to manual segmentation. These personalized and accurate measurements of fat can complement traditional population health driven obesity metrics such as BMI and WC.

The environmental impacts of land transformation in the coastal perimeter of the Mar Menor lagoon (Spain)

OpenAIRE

GARCÍA-AYLLON VEINTIMILLA, SALVADOR; Miralles García, José Luis

2014-01-01

Assigned to WIT Press all rights under copyright that may exist in and to the Work and any associated written or multimedia components or other enhancements accompanying the Work. The distinctive environment of the lagoon has long been attractive for visitors. A surge in touristic activities has taken place in the area since the early 1960s, characterised by intense urban development along the lagoon s perimeter to accommodate the growing seasonal population. This phenomenon has particular...

Farmers’ willingness to pay for surface water in the West Mitidja irrigated perimeter, northern Algeria

Directory of Open Access Journals (Sweden)

Malika Azzi

2018-04-01

Full Text Available Algeria is among the most water-stressed countries in the world. Because of its climatic conditions, irrigation is essential for agricultural production. Water prices paid by farmers in public irrigation districts are very low and do not cover the operation and maintenance (O&M costs of the irrigated perimeters, thus leading to the deterioration of these infrastructures. The objective of this paper is to analyse whether farmer’s in the West Mitidja irrigation district in northern Algeria would be willing to pay more for surface water in order to maintain the water supply service in its current conditions. We estimated farmers’ willingness to pay (WTP for water using data from a dichotomous choice contingent valuation survey to 112 randomly selected farmers. Farmers’ responses were modelled using logistic regression techniques. We also analysed which technical, structural, social and economic characteristics of farms and farmers explain the differences in WTP. Our results showed that nearly 80% of the surveyed farmers are willing to pay an extra price for irrigation water. The average WTP was 64% greater than the price currently paid by farmers, suggesting some scope for improving the financial resources of the Mitidja irrigated perimeter, but insufficient to cover all O&M costs. Some of the key identified factors that affect WTP for surface water relate to farm ownership, access to groundwater resources, cropping patterns, farmers’ agricultural training and risk exposure.

Area G perimeter surface-soil and single-stage water sampling: Environmental surveillance for fiscal year 94, Group ESH-19. Progress report

International Nuclear Information System (INIS)

Conrad, R.; Childs, M.; Lyons, C.R.; Coriz, F.

1996-08-01

ESH-19 personnel collected soil and single-stage water samples around the perimeter of Area G at Los Alamos National Laboratory during FY94 to characterize possible contaminant movement out of Area G through surface-water and sediment runoff. These samples were analyzed for tritium, total uranium, isotopic plutonium, americium-241, and cesium-137. Ten metals were also analyzed on selected soils using analytical laboratory techniques. All radiochemical data are compared with analogous samples collected during FY 93 and reported in LA-12986. Baseline concentrations for future disposal operations were established for metals and radionuclides by a sampling program in the proposed Area G Expansion Area. Considering the amount of radioactive waste that has been disposed at Area G, there is evidence of only low concentrations of radionuclides on perimeter surface soils. Consequently, little radioactivity is leaving the confines of Area G via the surface water runoff pathway

A Greedy Scanning Data Collection Strategy for Large-Scale Wireless Sensor Networks with a Mobile Sink.

Science.gov (United States)

Zhu, Chuan; Zhang, Sai; Han, Guangjie; Jiang, Jinfang; Rodrigues, Joel J P C

2016-09-06

Mobile sink is widely used for data collection in wireless sensor networks. It can avoid 'hot spot' problems but energy consumption caused by multihop transmission is still inefficient in real-time application scenarios. In this paper, a greedy scanning data collection strategy (GSDCS) is proposed, and we focus on how to reduce routing energy consumption by shortening total length of routing paths. We propose that the mobile sink adjusts its trajectory dynamically according to the changes of network, instead of predetermined trajectory or random walk. Next, the mobile sink determines which area has more source nodes, then it moves toward this area. The benefit of GSDCS is that most source nodes are no longer needed to upload sensory data for long distances. Especially in event-driven application scenarios, when event area changes, the mobile sink could arrive at the new event area where most source nodes are located currently. Hence energy can be saved. Analytical and simulation results show that compared with existing work, our GSDCS has a better performance in specific application scenarios.

29 CFR Appendix F to Subpart R of... - Perimeter Columns: Non-Mandatory Guidelines for Complying With § 1926.756(e) To Protect the...

Science.gov (United States)

2010-07-01

... to Subpart R of Part 1926 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND... Steel Erection Pt. 1926, Subpt. R, App. F Appendix F to Subpart R of Part 1926—Perimeter Columns: Non...

Ukraine-Japanese-Swedish project: Upgrading of perimeter protection system at Kharkov Institute of Physics and Technology (KIPT)

International Nuclear Information System (INIS)

Mikahaylov, V.; Lapshin, V.; Ek, P.; Flyghed, L.; Nilsson, A.; Ooka, N.; Shimizu, K.; Tanuma, K.

2001-01-01

Full text: Since the Ukraine voluntarily accepted the status of a non-nuclear-weapons state and concluded a Safeguards Agreement with the IAEA, the Kharkov Institute of Physics and Technology (KIPT) as a nuclear facility using the nuclear material of category 1, has become a Ukrainian priority object for the international community's efforts to ensure nuclear non-proliferation measures and to bring the existing protection systems to the generally accepted security standards. In March 1996, at the meeting held under the auspices of the IAEA in Kiev, the representatives from Japan, Sweden and the USA agreed to provide technical assistance concerning improvement of the nuclear material accountancy and control and physical protection system (MPC and A) available at KIPT. The Technical Secretariat of the Japan-Ukraine Committee for Co-operation on Reducing Nuclear Weapons and Swedish Nuclear Power Inspectorate undertook to solve the most expensive and labour-consuming task namely, the upgrading of the perimeter protection system at KIPT. This included that the current perimeter system, comprising several kilometers, should be completely replaced. Besides the above-mentioned problem, the upgrading should be carried out with the institute in operation. Thus, it was not allowed to replace the existing protection system by a new one unless KIPT was constantly protected. This required the creation of a new protected zone that to a large extent was occupied by the communication equipment, buildings, trees and other objects interfering with the work. All these difficulties required very comprehensive development of the project design as well as a great deal of flexibility during the implementation of the project. These problems were all successfully resolved thanks to a well working project organization, composed of experts from KIPT, JAERI and ANS, involving the highly qualified Swedish technical experts who played a leading role. In the framework of implementation of the

Comparison of perimeter trap crop varieties: effects on herbivory, pollination, and yield in butternut squash.

Science.gov (United States)

Adler, L S; Hazzard, R V

2009-02-01

Perimeter trap cropping (PTC) is a method of integrated pest management (IPM) in which the main crop is surrounded with a perimeter trap crop that is more attractive to pests. Blue Hubbard (Cucurbita maxima Duch.) is a highly effective trap crop for butternut squash (C. moschata Duch. ex Poir) attacked by striped cucumber beetles (Acalymma vittatum Fabricius), but its limited marketability may reduce adoption of PTC by growers. Research comparing border crop varieties is necessary to provide options for growers. Furthermore, pollinators are critical for cucurbit yield, and the effect of PTC on pollination to main crops is unknown. We examined the effect of five border treatments on herbivory, pollination, and yield in butternut squash and manipulated herbivory and pollination to compare their importance for main crop yield. Blue Hubbard, buttercup squash (C. maxima Duch.), and zucchini (C. pepo L.) were equally attractive to cucumber beetles. Border treatments did not affect butternut leaf damage, but butternut flowers had the fewest beetles when surrounded by Blue Hubbard or buttercup squash. Yield was highest in the Blue Hubbard and buttercup treatments, but this effect was not statistically significant. Native bees accounted for 87% of pollinator visits, and pollination did not limit yield. There was no evidence that border crops competed with the main crop for pollinators. Our results suggest that both buttercup squash and zucchini may be viable alternatives to Blue Hubbard as borders for the main crop of butternut squash. Thus, growers may have multiple border options that reduce pesticide use, effectively manage pests, and do not disturb mutualist interactions with pollinators.

System overview and applications of a panoramic imaging perimeter sensor

International Nuclear Information System (INIS)

Pritchard, D.A.

1995-01-01

This paper presents an overview of the design and potential applications of a 360-degree scanning, multi-spectral intrusion detection sensor. This moderate-resolution, true panoramic imaging sensor is intended for exterior use at ranges from 50 to 1,500 meters. This Advanced Exterior Sensor (AES) simultaneously uses three sensing technologies (infrared, visible, and radar) along with advanced data processing methods to provide low false-alarm intrusion detection, tracking, and immediate visual assessment. The images from the infrared and visible detector sets and the radar range data are updated as the sensors rotate once per second. The radar provides range data with one-meter resolution. This sensor has been designed for easy use and rapid deployment to cover wide areas beyond or in place of typical perimeters, and tactical applications around fixed or temporary high-value assets. AES prototypes are in development. Applications discussed in this paper include replacements, augmentations, or new installations at fixed sites where topological features, atmospheric conditions, environmental restrictions, ecological regulations, and archaeological features limit the use of conventional security components and systems

Greedy algorithms for high-dimensional non-symmetric linear problems***

Directory of Open Access Journals (Sweden)

Cancès E.

2013-12-01

Full Text Available In this article, we present a family of numerical approaches to solve high-dimensional linear non-symmetric problems. The principle of these methods is to approximate a function which depends on a large number of variates by a sum of tensor product functions, each term of which is iteratively computed via a greedy algorithm ? . There exists a good theoretical framework for these methods in the case of (linear and nonlinear symmetric elliptic problems. However, the convergence results are not valid any more as soon as the problems under consideration are not symmetric. We present here a review of the main algorithms proposed in the literature to circumvent this difficulty, together with some new approaches. The theoretical convergence results and the practical implementation of these algorithms are discussed. Their behaviors are illustrated through some numerical examples. Dans cet article, nous présentons une famille de méthodes numériques pour résoudre des problèmes linéaires non symétriques en grande dimension. Le principe de ces approches est de représenter une fonction dépendant d’un grand nombre de variables sous la forme d’une somme de fonctions produit tensoriel, dont chaque terme est calculé itérativement via un algorithme glouton ? . Ces méthodes possèdent de bonnes propriétés théoriques dans le cas de problèmes elliptiques symétriques (linéaires ou non linéaires, mais celles-ci ne sont plus valables dès lors que les problèmes considérés ne sont plus symétriques. Nous présentons une revue des principaux algorithmes proposés dans la littérature pour contourner cette difficulté ainsi que de nouvelles approches que nous proposons. Les résultats de convergence théoriques et la mise en oeuvre pratique de ces algorithmes sont détaillés et leur comportement est illustré au travers d’exemples numériques.

Area G perimeter surface-soil and single-stage water sampling: Environmental surveillance for fiscal year 1993

International Nuclear Information System (INIS)

Conrad, R.; Childs, M.; Rivera-Dirks, C.; Coriz, F.

1995-07-01

Area G, in Technical Area 54, has been the principle facility at Los Alamos National Laboratory for the storage and disposal of low-level and transuranic (TRU) radioactive wastes since 1957. The current environmental investigation consisted of ESH-19 personnel who collected soil and single-stage water samples around the perimeter of Area G to characterize possible contaminant movement through surface-water runoff. These samples were analyzed for tritium, total uranium, isotopic plutonium, americium-241 (soil only), and cesium 137. The metals, mercury, lead, and barium, were analyzed using x-ray fluorescence

The StreamCat Dataset: Accumulated Attributes for NHDPlusV2 Catchments (Version 2.1) for the Conterminous United States: Wildland Fire Perimeters By Year 2000 - 2010

Data.gov (United States)

U.S. Environmental Protection Agency — This dataset represents the historical fire perimeters within individual local NHDPlusV2 catchments and upstream, contributing watersheds based on the GeoMAC...

Evaluating the Relation between Dominant and Non-Dominant Hand Perimeters and Handgrip Strength of Basketball, Volleyball, Badminton and Handball Athletes

Science.gov (United States)

Kaplan, Defne Öcal

2016-01-01

In this study, it's aimed to evaluate the relation between dominant and non-dominant hand perimeters and handgrip strength of basketball, volleyball, badminton and handball athletes. Totally 101 active athletes (49 females, 52 male), of the average age in female 20±1.42 years, in male 21±1.99 years, joined to this study. Height, body weight, BMI…

The role of fire severity, distance from fire perimeter and vegetation on post-fire recovery of small-mammal communities in chaparal

Science.gov (United States)

Jay Diffendorfer; Genie M. Fleming; Scott Tremor; Wayne Spencer; Jan L. Beyers

2012-01-01

Chaparral shrublands in southern California, US, exhibit significant biodiversity but are prone to large, intense wildfires. Debate exists regarding fuel reduction to prevent such fires in wildland areas, but the effects of these fires on fauna are not well understood. We studied whether fire severity and distance from unburned fire perimeter influenced recovery of the...

Hardware implementation of adaptive filtering using charge-coupled devices. [For perimeter security sensors

Energy Technology Data Exchange (ETDEWEB)

Donohoe, G.W.

1977-01-01

Sandia Laboratories' Digital Systems Division/1734, as part of its work on the Base and Installation Security Systems (BISS) program has been making use of adaptive digital filters to improve the signal-to-noise ratio of perimeter sensor signals. In particular, the Widrow-Hoff least-mean-squares algorithm has been used extensively. This non-recursive linear predictor has been successful in extracting aperiodic signals from periodic noise. The adaptive filter generates a predictor signal which is subtracted from the input signal to produce an error signal. The value of this error is fed back to the filter to improve the quality of the next prediction. Implementation of the Widrow adaptive filter using a Charge-Coupled Device tapped analog delay line, analog voltage multipliers and operational amplifiers is described. The resulting filter adapts to signals with frequency components as high as several megahertz.

The StreamCat Dataset: Accumulated Attributes for NHDPlusV2 Catchments Riparian Buffer (Version 2.1) for the Conterminous United States: Wildland Fire Perimeters By Year 2000 - 2010

Data.gov (United States)

U.S. Environmental Protection Agency — This dataset represents the historical fire perimeters within individual local NHDPlusV2 catchments and upstream, contributing watersheds riparian buffers based on...

SIMULATION AND ANALYSIS OF GREEDY ROUTING PROTOCOL IN VIEW OF ENERGY CONSUMPTION AND NETWORK LIFETIME IN THREE DIMENSIONAL UNDERWATER WIRELESS SENSOR NETWORK

Directory of Open Access Journals (Sweden)

SHEENA KOHLI

2017-11-01

Full Text Available Underwater Wireless Sensor Network (UWSN comprises of a number of miniature sized sensing devices deployed in the sea or ocean, connected by dint of acoustic links to each other. The sensors trap the ambient conditions and transmit the data from one end to another. For transmission of data in any medium, routing protocols play a crucial role. Moreover, being battery limited, an unavoidable parameter to be considered in operation and analysis of protocols is the network energy and the network lifetime. The paper discusses the greedy routing protocol for underwater wireless sensor networks. The simulation of this routing protocol also takes into consideration the characteristics of acoustic communication like attenuation, transmission loss, signal to noise ratio, noise, propagation delay. The results from these observations may be used to construct an accurate underwater communication model.

Forming Of Spherical Titanium Cups From Circular Blanks With Cutouts On The Perimeter

Directory of Open Access Journals (Sweden)

Lacki P.

2015-06-01

Full Text Available Despite substantial demand for drawn parts made of high-strength sheet metal (including titanium alloys observed in the modern industry, particularly automotive and aviation, their application remains insignificant. This results from the fact that such sheet metal shows poor plasticity and its cold-forming is almost impossible. Low drawability makes it impossible to obtain even such simple shapes as spherical cups. The authors of this study developed circular sheet-metal blanks with cutouts on their perimeter. The blanks allow for cold forming of spherical cups from Ti6Al4V titanium alloy sheet metal using conventional rigid tools. The cutouts proposed in the study affect plastic strain distribution, which in turn leads to an increase in forming depth by about 30%. The numerical analysis, performed using the PamStamp 2G System software based on finite element method, was verified experimentally.

Pushing the physics envelope Canada's new Perimeter Institute is planning to apply the risk-taking approach of venture capitalism to the pursuit of theoretical physics

CERN Multimedia

Spurgeon, D

2001-01-01

An highly successful business man has donated 100 million Canadian dollars to found the Perimeter Institue for Theoretical Physics. It is designed to attract young, innovative scientists to tackle some of the most difficult problems in physics such as quantum gravity and quantum information theory (1 page).

Magmatically Greedy Reararc Volcanoes of the N. Tofua Segment of the Tonga Arc

Science.gov (United States)

Rubin, K. H.; Embley, R. W.; Arculus, R. J.; Lupton, J. E.

2013-12-01

Volcanism along the northernmost Tofua Arc is enigmatic because edifices of the arc's volcanic front are mostly, magmatically relatively anemic, despite the very high convergence rate of the Pacific Plate with this section of Tonga Arc. However, just westward of the arc front, in terrain generally thought of as part of the adjacent NE Lau Backarc Basin, lie a series of very active volcanoes and volcanic features, including the large submarine caldera Niuatahi (aka volcano 'O'), a large composite dacite lava flow terrain not obviously associated with any particular volcanic edifice, and the Mata volcano group, a series of 9 small elongate volcanoes in an extensional basin at the extreme NE corner of the Lau Basin. These three volcanic terrains do not sit on arc-perpendicular cross chains. Collectively, these volcanic features appear to be receiving a large proportion of the magma flux from the sub-Tonga/Lau mantle wedge, in effect 'stealing' this magma flux from the arc front. A second occurrence of such magma 'capture' from the arc front occurs in an area just to the south, on southernmost portion of the Fonualei Spreading Center. Erupted compositions at these 'magmatically greedy' volcanoes are consistent with high slab-derived fluid input into the wedge (particularly trace element abundances and volatile contents, e.g., see Lupton abstract this session). It is unclear how long-lived a feature this is, but the very presence of such hyperactive and areally-dispersed volcanism behind the arc front implies these volcanoes are not in fact part of any focused spreading/rifting in the Lau Backarc Basin, and should be thought of as 'reararc volcanoes'. Possible tectonic factors contributing to this unusually productive reararc environment are the high rate of convergence, the cold slab, the highly disorganized extension in the adjacent backarc, and the tear in the subducting plate just north of the Tofua Arc.

Avaliação do espaço adicional requerido no perímetro do arco inferior para o nivelamento da curva de Spee Assessment of the additional lower arch perimeter needed for leveling the curve of Spee

Directory of Open Access Journals (Sweden)

Marcio José da Silva Campos

2009-08-01

Full Text Available OBJETIVO: determinar o perímetro de arco adicional necessário para o nivelamento da curva de Spee através de uma técnica laboratorial em modelos de estudo. MÉTODOS: foram utilizados 70 modelos inferiores nos quais se mediu a profundidade da curva de Spee e o perímetro do arco (de segundo molar a segundo molar. Nos mesmos modelos, após a simulação do nivelamento da curva de Spee, o perímetro de arco foi novamente avaliado, mantendo sua forma e comprimento. RESULTADOS: foi confirmada a correlação entre a profundidade da curva de Spee e o perímetro de arco adicional, sendo deduzida a fórmula [Paa = 0,21 CSmax - 0,04]. CONCLUSÃO: a técnica proposta permitiu, através da avaliação do perímetro de arco com curva de Spee nivelada, a determinação do espaço disponível para o alinhamento dentário.AIM: To determine the additional arch perimeter needed for leveling the curve of Spee by means of a laboratory technique using dental casts. METHODS: Seventy lower dental models were used for measuring the depth of the curve of Spee and assessing the arch perimeter from second molar to second molar. In these dental casts, after simulation of leveling the curve of Spee, arch perimeter was reevaluated, after maintaining its form and length. RESULTS: The correlation between the depth of the curve of Spee and the additional arch perimeter was ratified, as can be shown by the formula [Paa = 0,21 CSmax - 0,04]. CONCLUSION: The proposed technique allowed, through the assessment of the arch perimeter with the leveled curve of Spee, the determination of the space available for tooth alignment.

Iterated greedy algorithms to minimize the total family flow time for job-shop scheduling with job families and sequence-dependent set-ups

Science.gov (United States)

Kim, Ji-Su; Park, Jung-Hyeon; Lee, Dong-Ho

2017-10-01

This study addresses a variant of job-shop scheduling in which jobs are grouped into job families, but they are processed individually. The problem can be found in various industrial systems, especially in reprocessing shops of remanufacturing systems. If the reprocessing shop is a job-shop type and has the component-matching requirements, it can be regarded as a job shop with job families since the components of a product constitute a job family. In particular, sequence-dependent set-ups in which set-up time depends on the job just completed and the next job to be processed are also considered. The objective is to minimize the total family flow time, i.e. the maximum among the completion times of the jobs within a job family. A mixed-integer programming model is developed and two iterated greedy algorithms with different local search methods are proposed. Computational experiments were conducted on modified benchmark instances and the results are reported.

The way of land use in the perimeter of town Podu Iloaiei.

Directory of Open Access Journals (Sweden)

Irina Elena TODAŞCĂ

2010-04-01

Full Text Available Podu Iloaiei is situated in the south part of Jijia Plain, in Bahlui hydrographic basin. The relief is predominantlysculptural, followed by the accumulation relief. There are quaternary and basarabian  sediments/deposits. The climate is temperate-continental with dryness nuances whichcontributed to the growth of forest steppe vegetation. The hidrography is represented by Bahlui river and its main tributary: Bahluet. Pedological layer is influenced by the particular factors and processes of pedogenesis of Podu Iloaiei. There are spread types ofsoil from the following soil classes:cernisols, fluvisols, protisols and anthrosols. Podu Iloaiei perimeter didn’t have a spectacular evolution concerning its target. Its use is predominantly agricultural(83%, no matter the period studied(before and after 1990 orits recently rural-urban administrative structure. We may speak, in this case, about the existence of an agricultural-town. Many lands of Podu Iloaiei research station were taken over after 1990, by local entrepreneurs who preserve the modern techniques of land use,inherited from it. More than that, it feels the pressure of Iasi city, which determined some lands to get real interest.

Full perimeter intersection criteria. Definitions and implementations in SR-Site

Energy Technology Data Exchange (ETDEWEB)

Munier, Raymond

2010-03-15

Large fractures intersecting canisters have potential to reactivate due to nearby earthquakes and thereby jeopardising the canister/buffer integrity. The use of full perimeter intersection (FPI) as a proxy for fracture size has been explored within SKB since late 2004. A methodology to use FPI as a deposition hole rejection criterion was first reported in and the concept has successively matured ever since. As a response to feedback obtained from various instances of our organisation and external reviewers, additional analyses and benchmarks were reported in 2007. An analytical solution to the canister/fracture intersection probability was introduced, which enabled us to benchmark various aspects of the FPI simulations. The methodology was first applied within the framework of SR-CAN to compute the number of potentially critical canister positions and soon after, based on preliminary DFN models, as one of many prerequisites for repository design. The methodology and simulation logic has evolved substantially ever since it was originally reported in 2006 and the present report is intended to entirely replace previous reports on this subject, to thereby provide the interested reader with an description of the modelling procedure, prerequisites and limitations. As a consequence thereof, major portions of previous reports are repeated herein, though we occasionally refer to these reports for comparative purposes. Furthermore, as the final versions of the site descriptive models have been reported we find it convenient to, within this report, also apply the methodology using the most actual site specific fracture data

AIRFIL: a FORTRAN program for reduction of data obtained from alpha spectrometry of perimeter air filters

International Nuclear Information System (INIS)

Hinton, E.R. Jr.; Howell, R.L.

1984-03-01

Isotopic alpha spectrometry of 238 U, 235 U, and 234 U, along with gross alpha/beta counting of perimeter air filters, is performed by the Oak Ridge Y-12 Plant Laboratory in support of the Envrirnomental Monitoring Section of the Radiation Safety Department. Weekly samples are gross alpha/beta counted and the isotopic analysis performed on quarterly composites. Calculations and data management represents a major portion of the anlaysis time when performed manually, even with a desktop calculator. In order to reduce calculation time, perform orderly data manipulation and management, reduce errors due to redundant calculations, and eliminate report typing turnaround time, a computer program (AIRFIL) has been developed that performs these functions. The program accepts data through user prompts, then calculates and prints intermediate and final data, including detection limits

Mad scientists, compassionate healers, and greedy egotists: the portrayal of physicians in the movies.

Science.gov (United States)

Flores, Glenn

2002-07-01

Cinematic depictions of physicians potentially can affect public expectations and the patient-physician relationship, but little attention has been devoted to portrayals of physicians in movies. The objective of the study was the analysis of cinematic depictions of physicians to determine common demographic attributes of movie physicians, major themes, and whether portrayals have changed over time. All movies released on videotape with physicians as main characters and readily available to the public were viewed in their entirety. Data were collected on physician characteristics, diagnoses, and medical accuracy, and dialogue concerning physicians was transcribed. The results showed that in the 131 films, movie physicians were significantly more likely to be male (p film physicians has declined steadily in recent decades. Movie physicians are most commonly surgeons (33%), psychiatrists (26%), and family practitioners (18%). Physicians were portrayed negatively in 44% of movies, and since the 1960s positive portrayals declined while negative portrayals increased. Physicians frequently are depicted as greedy, egotistical, uncaring, and unethical, especially in recent films. Medical inaccuracies occurred in 27% of films. Compassion and idealism were common in early physician movies but are increasingly scarce in recent decades. A recurrent theme is the "mad scientist," the physician-researcher that values research more than patients' welfare. Portrayals of physicians as egotistical and materialistic have increased, whereas sexism and racism have waned. Movies from the past two decades have explored critical issues surrounding medical ethics and managed care. We conclude that negative cinematic portrayals of physicians are on the rise, which may adversely affect patient expectations and the patient-physician relationship. Nevertheless, films about physicians can serve as useful gauges of public opinion about the medical profession, as tools for medical education, and as

Las Matematicas: Lenguaje Universal. Grados Intermedios, Nivel 5b: Medida Lineal, Perimetro y Area (Mathematics: A Universal Language. Intermediate Grades, Level 5b: Linear Measure, Perimeter and Area).

Science.gov (United States)

Dissemination and Assessment Center for Bilingual Education, Austin, TX.

This is one of a series of student booklets designed for use in a bilingual mathematics program in grades 6-8. The general format is to present each page in both Spanish and English. The mathematical topics in this booklet include measurement, perimeter, and area. (MK)

Spatial and Temporal Patterns of Unburned Areas within Fire Perimeters in the Northwestern United States from 1984 to 2014

Science.gov (United States)

Meddens, A. J.; Kolden, C.; Lutz, J. A.; Abatzoglou, J. T.; Hudak, A. T.

2016-12-01

Recently, there has been concern about increasing extent and severity of wildfires across the globe given rapid climate change. Areas that do not burn within fire perimeters can act as fire refugia, providing (1) protection from the detrimental effects of the fire, (2) seed sources, and (3) post-fire habitat on the landscape. However, recent studies have mainly focused on the higher end of the burn severity spectrum whereas the lower end of the burn severity spectrum has been largely ignored. We developed a spatially explicit database for 2,200 fires across the inland northwestern USA, delineating unburned areas within fire perimeters from 1984 to 2014. We used 1,600 Landsat scenes with one or two scenes before and one or two scenes after the fires to capture the unburned proportion of the fire. Subsequently, we characterized the spatial and temporal patterns of unburned areas and related the unburned proportion to interannual climate variability. The overall classification accuracy detecting unburned locations was 89.2% using a 10-fold cross-validation classification tree approach in combination with 719 randomly located field plots. The unburned proportion ranged from 2% to 58% with an average of 19% for a select number of fires. We find that using both an immediate post-fire image and a one-year post fire image improves classification accuracy of unburned islands over using just a single post-fire image. The spatial characteristics of the unburned islands differ between forested and non-forested regions with a larger amount of unburned area within non-forest. In addition, we show trends of unburned proportion related primarily to concurrent climatic drought conditions across the entire region. This database is important for subsequent analyses of fire refugia prioritization, vegetation recovery studies, ecosystem resilience, and forest management to facilitate unburned islands through fuels breaks, prescribed burning, and fire suppression strategies.

Greedy Sampling and Incremental Surrogate Model-Based Tailoring of Aeroservoelastic Model Database for Flexible Aircraft

Science.gov (United States)

Wang, Yi; Pant, Kapil; Brenner, Martin J.; Ouellette, Jeffrey A.

2018-01-01

This paper presents a data analysis and modeling framework to tailor and develop linear parameter-varying (LPV) aeroservoelastic (ASE) model database for flexible aircrafts in broad 2D flight parameter space. The Kriging surrogate model is constructed using ASE models at a fraction of grid points within the original model database, and then the ASE model at any flight condition can be obtained simply through surrogate model interpolation. The greedy sampling algorithm is developed to select the next sample point that carries the worst relative error between the surrogate model prediction and the benchmark model in the frequency domain among all input-output channels. The process is iterated to incrementally improve surrogate model accuracy till a pre-determined tolerance or iteration budget is met. The methodology is applied to the ASE model database of a flexible aircraft currently being tested at NASA/AFRC for flutter suppression and gust load alleviation. Our studies indicate that the proposed method can reduce the number of models in the original database by 67%. Even so the ASE models obtained through Kriging interpolation match the model in the original database constructed directly from the physics-based tool with the worst relative error far below 1%. The interpolated ASE model exhibits continuously-varying gains along a set of prescribed flight conditions. More importantly, the selected grid points are distributed non-uniformly in the parameter space, a) capturing the distinctly different dynamic behavior and its dependence on flight parameters, and b) reiterating the need and utility for adaptive space sampling techniques for ASE model database compaction. The present framework is directly extendible to high-dimensional flight parameter space, and can be used to guide the ASE model development, model order reduction, robust control synthesis and novel vehicle design of flexible aircraft.

Simplifying a hydrological ensemble prediction system with a backward greedy selection of members – Part 1: Optimization criteria

Directory of Open Access Journals (Sweden)

D. Brochero

2011-11-01

Full Text Available Hydrological Ensemble Prediction Systems (HEPS, obtained by forcing rainfall-runoff models with Meteorological Ensemble Prediction Systems (MEPS, have been recognized as useful approaches to quantify uncertainties of hydrological forecasting systems. This task is complex both in terms of the coupling of information and computational time, which may create an operational barrier. The main objective of the current work is to assess the degree of simplification (reduction of the number of hydrological members that can be achieved with a HEPS configured using 16 lumped hydrological models driven by the 50 weather ensemble forecasts from the European Centre for Medium-range Weather Forecasts (ECMWF. Here, Backward Greedy Selection (BGS is proposed to assess the weight that each model must represent within a subset that offers similar or better performance than a reference set of 800 hydrological members. These hydrological models' weights represent the participation of each hydrological model within a simplified HEPS which would issue real-time forecasts in a relatively short computational time. The methodology uses a variation of the k-fold cross-validation, allowing an optimal use of the information, and employs a multi-criterion framework that represents the combination of resolution, reliability, consistency, and diversity. Results show that the degree of reduction of members can be established in terms of maximum number of members required (complexity of the HEPS or the maximization of the relationship between the different scores (performance.

Area G perimeter surface-soil and single-stage water sampling. Environmental surveillance for fiscal year 95. Progress report

International Nuclear Information System (INIS)

Childs, M.; Conrad, R.

1997-09-01

ESH-19 personnel collected soil and single-stage water samples around the perimeter of Area G at Los Alamos National Laboratory (LANL) during FY 95 to characterize possible radionuclide movement out of Area G through surface water and entrained sediment runoff. Soil samples were analyzed for tritium, total uranium, isotopic plutonium, americium-241, and cesium-137. The single-stage water samples were analyzed for tritium and plutonium isotopes. All radiochemical data was compared with analogous samples collected during FY 93 and 94 and reported in LA-12986 and LA-13165-PR. Six surface soils were also submitted for metal analyses. These data were included with similar data generated for soil samples collected during FY 94 and compared with metals in background samples collected at the Area G expansion area

Repeatability of Retinal Sensitivity Measurements Using a Medmont Dark-Adapted Chromatic Perimeter in Healthy and Age-Related Macular Degeneration Cases.

Science.gov (United States)

Tan, Rose S; Guymer, Robyn H; Luu, Chi D

2018-05-01

To determine the intrasession and intersession test-retest repeatability of retinal sensitivity measurements using a dark-adapted chromatic perimeter (DACP). For intrasession testing, retinal sensitivity within the central 24° for the 505-nm stimulus was measured after 20, 30, and 40 minutes of dark adaptation (DA) and for the 625-nm stimulus was measured after the first and second 505-nm tests. For intersession testing, retinal sensitivity for both stimuli was measured after 30 minutes of DA at baseline and 1 month. The point-wise sensitivity (PWS) difference and coefficient of repeatability (CoR) of each stimulus and group were determined. For intrasession testing, 10 age-related macular degeneration (AMD) and eight control subjects were recruited. The overall CoR for the 505-nm stimulus was 8.4 dB for control subjects and 9.1 dB for AMD cases, and for the 625-nm stimulus was 6.7 dB for control subjects and 9.5 dB for AMD cases. For intersession testing, seven AMD cases and 13 control subjects returned an overall CoR for the 505-nm stimulus of 8.2 dB for the control and 11.7 dB for the AMD group. For the 625-nm stimulus the CoR was 6.2 dB for the control group and 8.4 dB for the AMD group. Approximately 80% of all test points had a PWS difference of ±5 dB between the two intrasession or intersession measurements for both stimuli. The CoR for the DACP is larger than that reported for scotopic perimeters; however, the majority of test points had a PWS difference of ±5 dB between tests. The DACP offers an opportunity to measure static and dynamic rod function at multiple locations with an acceptable reproducibility level.

Constructibility Challenges for Perimeter Control Blasting and Slope Development in Shale and Other "Weak" Rocks

Science.gov (United States)

Scarpato, D. J.

2016-02-01

Slope construction in shale can present some interesting challenges for geotechnical design engineers and contractors alike. There are challenges that can be expected and designed for; however, all too frequently, such challenges manifest themselves as "surprises" in the field. Common constructibility challenges can include drill hole deviation during drilling for controlled blasting; and, excavation slope instability arising from inconsistent perimeter control drilling. Drill hole deviation results from the cumulative effects from both drilling mechanics and rock mass conditions. Once a hole has initiated the deviation trajectory, it is difficult to rectify drill steel position. Although such challenges are not necessarily unique to shale, they are often exacerbated by weak, weathered and transversely isotropic nature of bedrock conditions. All too often, the working assumption is that shale is "soft" and easily excavatable; however, this blanket assumption can prove to be costly. This paper is intended to provide design professionals and contractors with the practical considerations needed to avoid the "surprises" associated with drill hole deviation, and minimize the potential for costly claims.

Interfacing Hardware Accelerators to a Time-Division Multiplexing Network-on-Chip

DEFF Research Database (Denmark)

Pezzarossa, Luca; Sørensen, Rasmus Bo; Schoeberl, Martin

2015-01-01

This paper addresses the integration of stateless hardware accelerators into time-predictable multi-core platforms based on time-division multiplexing networks-on-chip. Stateless hardware accelerators, like floating-point units, are typically attached as co-processors to individual processors in ...... implementation. The design evaluation is carried out using the open source T-CREST multi-core platform implemented on an Altera Cyclone IV FPGA. The size of the proposed design, including a floating-point accelerator, is about two-thirds of a processor....

Radionuclides, Heavy Metals, and Polychlorinated Biphenyls in Soils Collected Around the Perimeter of Low-Level Radioactive Waste Disposal Area G during 2006

International Nuclear Information System (INIS)

P. R. Fresquez

2007-01-01

Twenty-one soil surface samples were collected in March around the perimeter of Area G, the primary disposal facility for low-level radioactive solid waste at Los Alamos National Laboratory (LANL). Three more samples were collected in October around the northwest corner after elevated tritium levels were detected on an AIRNET station located north of pit 38 in May. Also, four soil samples were collected along a transect at various distances (48, 154, 244, and 282 m) from Area G, starting from the northeast corner and extending to the Pueblo de San Ildefonso fence line in a northeasterly direction (this is the main wind direction). Most samples were analyzed for radionuclides ( 3 H, 238 Pu, 239,240 Pu, 241 Am, 234 U, 235 U, and 238 U), inorganic elements (Al, Ba, Be, Ca, Cr, Co, Cu, Fe, Mg, Mn, Ni, K, Na, V, Hg, Zn, Sb, As, Cd, Pb, Se, Ag, and Tl) and polychlorinated biphenyl (PCB) concentrations. As in previous years, the highest levels of 3 H in soils (690 pCi/mL) were detected along the south portion of Area G near the 3 H shafts; whereas, the highest concentrations of 241 Am (1.2 pCi/g dry) and the Pu isotopes (1.9 pCi/g dry for 238 Pu and 5 pCi/g dry for 239,240 Pu) were detected along the northeastern portions near the transuranic waste pads. Concentrations of 3 H in three soil samples and 241 Am and Pu isotopes in one soil sample collected around the northwest corner in October increased over concentrations found in soils collected at the same locations earlier in the year. Almost all of the heavy metals, with the exception of Zn and Sb in one sample each, in soils around the perimeter of Area G were below regional statistical reference levels (mean plus three standard deviations) (RSRLs). Similarly, only one soil sample collected on the west side contained PCB concentrations--67 (micro)g/kg dry of aroclor-1254 and 94 (micro)g/kg dry of aroclor-1260. Radionuclide and inorganic element concentrations in soils collected along a transect from Area G to the

Availability of processed foods in the perimeter of public schools in urban areas.

Science.gov (United States)

Leite, Fernanda Helena Marrocos; Oliveira, Maria Aparecida de; Cremm, Elena Carvalho; Abreu, Débora Silva Costa de; Maron, Luana Rieffe; Martins, Paula Andrea

2012-07-01

To assess the availability of food in relation to their degree of industrial processing and the types of food stores in the perimeters of elementary schools. This is a cross-sectional study. 82 food stores located within a 500 m radius buffer of three public schools located in three distinct regions with different socioeconomic levels in the municipality of Santos, state of São Paulo, Brazil, were assessed. All streets within a 500-meter radius of the schools were covered, geographic coordinates were recorded and information about the stores and food items available were collected by direct observation and interview with store managers. Available food items were classified in relation to their degree of industrial processing as ultra-processed foods and minimally processed foods. Kernel's density maps were used to assess the degree of agglomeration of stores near the schools. The stores that offered mostly ultra-processed foods were significantly closer to schools than those who offered mostly minimally processed foods. There was a significant difference between the availability of processed food in different types of stores and between the three regions assessed. The data found by this work evidence that children who attend the three public schools assessed are exposed to an environment that encourages the consumption of ultra-processed foods through easier access of these products in the studied stores.

Data fusion concept in multispectral system for perimeter protection of stationary and moving objects

Science.gov (United States)

Ciurapiński, Wieslaw; Dulski, Rafal; Kastek, Mariusz; Szustakowski, Mieczyslaw; Bieszczad, Grzegorz; Życzkowski, Marek; Trzaskawka, Piotr; Piszczek, Marek

2009-09-01

The paper presents the concept of multispectral protection system for perimeter protection for stationary and moving objects. The system consists of active ground radar, thermal and visible cameras. The radar allows the system to locate potential intruders and to control an observation area for system cameras. The multisensor construction of the system ensures significant improvement of detection probability of intruder and reduction of false alarms. A final decision from system is worked out using image data. The method of data fusion used in the system has been presented. The system is working under control of FLIR Nexus system. The Nexus offers complete technology and components to create network-based, high-end integrated systems for security and surveillance applications. Based on unique "plug and play" architecture, system provides unmatched flexibility and simplistic integration of sensors and devices in TCP/IP networks. Using a graphical user interface it is possible to control sensors and monitor streaming video and other data over the network, visualize the results of data fusion process and obtain detailed information about detected intruders over a digital map. System provides high-level applications and operator workload reduction with features such as sensor to sensor cueing from detection devices, automatic e-mail notification and alarm triggering.

Airway basement membrane perimeter in human airways is not a constant; potential implications for airway remodeling in asthma.

Science.gov (United States)

McParland, Brent E; Paré, Peter D; Johnson, Peter R A; Armour, Carol L; Black, Judith L

2004-08-01

Many studies that demonstrate an increase in airway smooth muscle in asthmatic patients rely on the assumption that bronchial internal perimeter (P(i)) or basement membrane perimeter (P(bm)) is a constant, i.e., not affected by fixation pressure or the degree of smooth muscle shortening. Because it is the basement membrane that has been purported to be the indistensible structure, this study examines the assumption that P(bm) is not affected by fixation pressure. P(bm) was determined for the same human airway segment (n = 12) fixed at distending pressures of 0 cmH(2)O and 21 cmH(2)O in the absence of smooth muscle tone. P(bm) for the segment fixed at 0 cmH(2)O was determined morphometrically, and the P(bm) for the same segment, had the segment been fixed at 21 cmH(2)O, was predicted from knowing the luminal volume and length of the airway when distended to 21 cmH(2)O (organ bath-derived P(i)). To ensure an accurate transformation of the organ bath-derived P(i) value to a morphometry-derived P(bm) value, had the segment been fixed at 21 cmH(2)O, the relationship between organ bath-derived P(i) and morphometry-derived P(bm) was determined for five different bronchial segments distended to 21 cmH(2)O and fixed at 21 cmH(2)O (r(2) = 0.99, P < 0.0001). Mean P(bm) for bronchial segments fixed at 0 cmH(2)O was 9.4 +/- 0.4 mm, whereas mean predicted P(bm), had the segments been fixed at 21 cmH(2)O, was 14.1 +/- 0.5 mm (P < 0.0001). This indicates that P(bm) is not a constant when isolated airway segments without smooth muscle tone are fixed distended to 21 cmH(2)O. The implication of these results is that the increase in smooth muscle mass in asthma may have been overestimated in some previous studies. Therefore, further studies are required to examine the potential artifact using whole lungs with and without abolition of airway smooth muscle tone and/or inflation.

Mejoras de las Heurísticas Greedy empleadas en el secuenciamiento de los Sistemas de Producción Multi-modelo y Multi-nivel

Directory of Open Access Journals (Sweden)

Juan José Areal Alonso

2013-04-01

Full Text Available Resumen: El problema de secuenciamiento de los sistemas de producción multi-modelo y multi-nivel reside en el alisado de las tasas de producción de los productos finales y también de las tasas de consumo de los diversos subconjuntos y elementos empleados en las etapas previas de producción. Las secuencias deben construirse de acuerdo a las opciones de cada producto, que requieren diferentes recursos y tiempo de producción, siendo el objetivo evitar sobrepasar el potencial de la instalación y de los medios humanos. Este artículo se desarrolla a partir del método Goal-chasing, que es una heurística Greedy desarrollada por Toyota para resolver este problema y que es ampliamente utilizado en la industria del automóvil. El artículo propone una mejora de dicho método con la introducción de pesos diferentes para cada opción con el fin de mejorar el ordenamiento de la secuencia. Profundizando en esta vía, se aplica el método Nelder-Mead de optimización no lineal para obtener los pesos de opciones que minimizan el coste de la secuencia resultante. Los resultados obtenidos aplicando los algoritmos a sistemas de producción multi-modelo y multi-nivel se concretan en el mundo del automóvil para una secuencia inicial, se generalizan a un conjunto de 30 secuencias representativas del entorno industrial del automóvil y se contrastan con referencias clásicas de la literatura. Abstract: The Car Sequencing Problem consists in maintaining a certain order in the vehicles as they pass through the assembly line. Sequences have to be built according to each vehicle's options, each one requiring different resources and production time, with the objective of avoiding to exceed the maximum human and facility potential. In this paper, we use a Greedy heuristic, the Goal-chasing method developed by Toyota, to solve the Car Sequencing Problem. The concept of different weights for each option is introduced to improve the ordering of the sequence. Nelder

Uncertainties estimation in surveying measurands: application to lengths, perimeters and areas

Science.gov (United States)

Covián, E.; Puente, V.; Casero, M.

2017-10-01

The present paper develops a series of methods for the estimation of uncertainty when measuring certain measurands of interest in surveying practice, such as points elevation given a planimetric position within a triangle mesh, 2D and 3D lengths (including perimeters enclosures), 2D areas (horizontal surfaces) and 3D areas (natural surfaces). The basis for the proposed methodology is the law of propagation of variance-covariance, which, applied to the corresponding model for each measurand, allows calculating the resulting uncertainty from known measurement errors. The methods are tested first in a small example, with a limited number of measurement points, and then in two real-life measurements. In addition, the proposed methods have been incorporated to commercial software used in the field of surveying engineering and focused on the creation of digital terrain models. The aim of this evolution is, firstly, to comply with the guidelines of the BIPM (Bureau International des Poids et Mesures), as the international reference agency in the field of metrology, in relation to the determination and expression of uncertainty; and secondly, to improve the quality of the measurement by indicating the uncertainty associated with a given level of confidence. The conceptual and mathematical developments for the uncertainty estimation in the aforementioned cases were conducted by researchers from the AssIST group at the University of Oviedo, eventually resulting in several different mathematical algorithms implemented in the form of MATLAB code. Based on these prototypes, technicians incorporated the referred functionality to commercial software, developed in C++. As a result of this collaboration, in early 2016 a new version of this commercial software was made available, which will be the first, as far as the authors are aware, that incorporates the possibility of estimating the uncertainty for a given level of confidence when computing the aforementioned surveying

Physiological intracellular crowdedness is defined by perimeter to area ratio of subcellular compartments

Directory of Open Access Journals (Sweden)

Noriko eHiroi

2012-07-01

Full Text Available The intracellular environment is known to be a crowded and inhomogeneous space. Such an in vivo environment differs from a well-diluted, homogeneous environment for biochemical reactions. However, the effects of both crowdedness and the inhomogeneity of environment on the behavior of a mobile particle have not yet been investigated sufficiently. As described in this paper, we constructed artificial reaction spaces with fractal models, which are assumed to be non-reactive solid obstacles in a reaction space with crevices that function as operating ranges for mobile particles threading the space. Because of the homogeneity of the structures of artificial reaction spaces, the models succeeded in reproducing the physiological fractal dimension of solid structures with a smaller number of non-reactive obstacles than in the physiological condition. This incomplete compatibility was mitigated when we chose a suitable condition of a perimeter-to-area ratio of the operating range to our model. Our results also show that a simulation space is partitioned into convenient reaction compartments as an in vivo environment with the exact amount of solid structures estimated from TEM images. The characteristics of these compartments engender larger mean square displacement of a mobile particle than that of particles in smaller compartments. Subsequently, the particles start to show confined particle-like behavior. These results are compatible with our previously presented results, which predicted that a physiological environment would produce quick-response and slow-exhaustion reactions.

On local optima in learning bayesian networks

DEFF Research Database (Denmark)

Dalgaard, Jens; Kocka, Tomas; Pena, Jose

2003-01-01

This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that it allows a trade-off between greediness and randomness, thus exploring different good local optima. When greediness...... is set at maximum, KES corresponds to the greedy equivalence search algorithm (GES). When greediness is kept at minimum, we prove that under mild assumptions KES asymptotically returns any inclusion optimal BN with nonzero probability. Experimental results for both synthetic and real data are reported...

COMPARISON OF FAST PERIMETRIC STRATEGIES USING G2 PROGRAM ON OCTOPUS 101 PERIMETER

Directory of Open Access Journals (Sweden)

Jernej Pajek

2002-12-01

Full Text Available Background. The duration of the perimetric examination was significantly shortened by development of fast perimetric strategies. By analyzing the results of normal, dynamic and TOP strategy we studied the differences in determination of MD, LV, in determination of number of all points with a deficit and number of points with a significant deficit of p < 0.5%.Methods. 22 normal visual fields of 17 subjects (mean age 33 ± 15 years and 22 visual fields with defects of 17 patients (47 ± 16 years having different types and degrees of visual lesions were examined. All visual fields were examined once with each strategy in alternating order using Octopus 101 perimeter with the G2 program.Results. No statistically significant differences were measured in MD values. In abnormal visual fields group, TOP strategy showed 11 ± 14 dB2 lower LV values compared to dynamic strategy (p < 0.01 and 9.8 ± 16 dB2 lower LV values compared to normal strategy (p = 0.02. In the abnormal visual fields group the dynamic strategy measured in average 3 points with the deficit less compared to the other two strategies (p < 0.05. There were no significant differences between strategies in the number of points with a deficit of p < 0.5%.Conclusions. With the exception of lower LV values measured with TOP strategy, the differences between TOP, dynamic strategy results are small and the time sparing benefits are substantial. Therefore the usage of fast perimetric strategies is clinically justified.

Towards the abolition of gender discrimination in nationality laws

Directory of Open Access Journals (Sweden)

Zahra Albarazi

2014-05-01

Full Text Available The contribution of gender discrimination to generating and perpetuating statelessness is considerable, and there continues to be a need to address such discrimination in nationality laws.

A comparison of performance measures for online algorithms

DEFF Research Database (Denmark)

Boyar, Joan; Irani, Sandy; Larsen, Kim Skak

2009-01-01

is to balance greediness and adaptability. We examine how these measures evaluate the Greedy Algorithm and Lazy Double Coverage, commonly studied algorithms in the context of server problems. We examine Competitive Analysis, the Max/Max Ratio, the Random Order Ratio, Bijective Analysis and Relative Worst Order...... Analysis and determine how they compare the two algorithms. We find that by the Max/Max Ratio and Bijective Analysis, Greedy is the better algorithm. Under the other measures Lazy Double Coverage is better, though Relative Worst Order Analysis indicates that Greedy is sometimes better. Our results also...... provide the first proof of optimality of an algorithm under Relative Worst Order Analysis....

De facto stateless: the Meskhetian Turks

OpenAIRE

Gupta, Parikrama

2006-01-01

This paper proposes to examine the present sociopolitical conditions of the Meskhetian Turks living in the Krasnodar Territory of the Russian Federation. As an ethnic minority in a country that has seen a rise in levels of xenophobia and racism against "the other," the Meskhetian Turks have survived primarily as squatters, having been denied basic human rights in a land they have inhabited for years. By a description of their history, their unique link to the territories they occupy, and the ...

AFSC/ABL: Origins of sockeye and chum salmon seized from the F/V Ying Fa

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — Samples of chum (Oncorhynchus keta) and sockeye (O. nerka) salmon seized from the stateless fishing vessel Ying Fa were analyzed to determine their region of origin...

Codification of scan path parameters and development of perimeter scan strategies for 3D bowl-shaped laser forming

Science.gov (United States)

Tavakoli, A.; Naeini, H. Moslemi; Roohi, Amir H.; Gollo, M. Hoseinpour; Shahabad, Sh. Imani

2018-01-01

In the 3D laser forming process, developing an appropriate laser scan pattern for producing specimens with high quality and uniformity is critical. This study presents certain principles for developing scan paths. Seven scan path parameters are considered, including: (1) combined linear or curved path; (2) type of combined linear path; (3) order of scan sequences; (4) the position of the start point in each scan; (5) continuous or discontinuous scan path; (6) direction of scan path; and (7) angular arrangement of combined linear scan paths. Regarding these path parameters, ten combined linear scan patterns are presented. Numerical simulations show continuous hexagonal, scan pattern, scanning from outer to inner path, is the optimized. In addition, it is observed the position of the start point and the angular arrangement of scan paths is the most effective path parameters. Also, further experimentations show four sequences due to creat symmetric condition enhance the height of the bowl-shaped products and uniformity. Finally, the optimized hexagonal pattern was compared with the similar circular one. In the hexagonal scan path, distortion value and standard deviation rather to edge height of formed specimen is very low, and the edge height despite of decreasing length of scan path increases significantly compared to the circular scan path. As a result, four-sequence hexagonal scan pattern is proposed as the optimized perimeter scan path to produce bowl-shaped product.

Approximation algorithms for a genetic diagnostics problem.

Science.gov (United States)

Kosaraju, S R; Schäffer, A A; Biesecker, L G

1998-01-01

We define and study a combinatorial problem called WEIGHTED DIAGNOSTIC COVER (WDC) that models the use of a laboratory technique called genotyping in the diagnosis of an important class of chromosomal aberrations. An optimal solution to WDC would enable us to define a genetic assay that maximizes the diagnostic power for a specified cost of laboratory work. We develop approximation algorithms for WDC by making use of the well-known problem SET COVER for which the greedy heuristic has been extensively studied. We prove worst-case performance bounds on the greedy heuristic for WDC and for another heuristic we call directional greedy. We implemented both heuristics. We also implemented a local search heuristic that takes the solutions obtained by greedy and dir-greedy and applies swaps until they are locally optimal. We report their performance on a real data set that is representative of the options that a clinical geneticist faces for the real diagnostic problem. Many open problems related to WDC remain, both of theoretical interest and practical importance.

Redox-Active Star Molecules Incorporating the 4-Benzoylpyridinium Cation - Implications for the Charge Transfer Along Branches vs. Across the Perimeter in Dendrimer

Science.gov (United States)

Leventis, Nicholas; Yang, Jinua; Fabrizio,Even F.; Rawashdeh, Abdel-Monem M.; Oh, Woon Su; Sotiriou-Leventis, Chariklia

2004-01-01

Dendrimers are self-repeating globular branched star molecules, whose fractal structure continues to fascinate, challenge, and inspire. Functional dendrimers may incorporate redox centers, and potential applications include antennae molecules for light harvesting, sensors, mediators, and artificial biomolecules. We report the synthesis and redox properties of four star systems incorporating the 4-benzoyl-N-alkylpyridinium cation; the redox potential varies along the branches but remains constant at fixed radii. Bulk electrolysis shows that at a semi-infinite time scale all redox centers are electrochemically accessible. However, voltammetric analysis (cyclic voltammetry and differential pulse voltammetry) shows that on1y two of the three redox-active centers in the perimeter are electrochemically accessible during potential sweeps as slow as 20 mV/s and as fast as 10 V/s. On the contrary, both redox centers along branches are accessible electrochemically within the same time frame. These results are explained in terms of slow through-space charge transfer and the globular 3-D folding of the molecules and are discussed in terms of their implications on the design of efficient redox functional dendrimers.

Greedy subspace clustering.

Science.gov (United States)

2016-09-01

We consider the problem of subspace clustering: given points that lie on or near the union of many low-dimensional linear subspaces, recover the subspaces. To this end, one first identifies sets of points close to the same subspace and uses the sets ...

The Education Rights of Street-Involved Children

Directory of Open Access Journals (Sweden)

Sonja Grover

2010-05-01

Full Text Available This paper provides an overview of certain key aspects of the practical and legal situation of street-involved children globally. The inadequate protection of these children under both domestic and international law is addressed. The diversity of the population of street-involved children is considered as is the fact that this group is composed of both legally stateless and de facto stateless children. The relationship of street involvement to child labor, various health risks and victimization is discussed. The educational needs of older street-involved children are addressed including their right to participate in decision-making regarding aspects of educational service design and delivery. The overall objective of this paper is to encourage those who are involved in, or could impact upon educational policy to include street-involved children in their educational planning implementation and advocacy efforts.

Network Architecture: lessons from the past, vision for the future

CERN Multimedia

CERN. Geneva

2004-01-01

The Architectural Principles of the Internet have dominated the past decade. Orthogonal to the telecommunications industry principles, they dramatically changed the networking landscape because they relied on iconoclastic ideas. First, the Internet end-to-end principle, which stipulates that the network should intervene minimally on the end-to-end traffic, pushing the complexity to the end-systems. Second, the ban of centralized functions: all the Internet techniques (routing, DNS, management) are based on distributed, decentralized mechanisms. Third, the absolute domination of connectionless (stateless) protocols (as with IP, HTTTP). However, when facing new requirements: multimedia traffic, security, Grid applications, these principles appear sometimes as architectural barriers. Multimedia requires QoS guarantees, but stateless systems are not good at QoS. Security requires active, intelligent networks, but dumb routers or plain end-to-end mail systems are insufficient. Grid applications require...

On construction of partial association rules

KAUST Repository

Moshkov, Mikhail

2009-01-01

This paper is devoted to the study of approximate algorithms for minimization of partial association rule length. It is shown that under some natural assumptions on the class NP, a greedy algorithm is close to the best polynomial approximate algorithms for solving of this NP-hard problem. The paper contains various bounds on precision of the greedy algorithm, bounds on minimal length of rules based on an information obtained during greedy algorithm work, and results of the study of association rules for the most part of binary information systems. © 2009 Springer Berlin Heidelberg.

Switching dynamics of multi-agent learning

NARCIS (Netherlands)

Vrancx, P.; Tuyls, K.P.; Westra, R.

2008-01-01

This paper presents the dynamics of multi-agent reinforcement learning in multiple state problems. We extend previous work that formally modelled the relation between reinforcement learning agents and replicator dynamics in stateless multi-agent games. More precisely, in this work we use a

Putting Wings on SPHINCS

DEFF Research Database (Denmark)

Kölbl, Stefan

2018-01-01

SPHINCS is a recently proposed stateless hash-based signature scheme and promising candidate for a post-quantum secure digital signature scheme. In this work we provide a comparison of the performance when instantiating SPHINCS with different cryptographic hash functions on both recent Intel...

Sparse approximation with bases

CERN Document Server

2015-01-01

This book systematically presents recent fundamental results on greedy approximation with respect to bases. Motivated by numerous applications, the last decade has seen great successes in studying nonlinear sparse approximation. Recent findings have established that greedy-type algorithms are suitable methods of nonlinear approximation in both sparse approximation with respect to bases and sparse approximation with respect to redundant systems. These insights, combined with some previous fundamental results, form the basis for constructing the theory of greedy approximation. Taking into account the theoretical and practical demand for this kind of theory, the book systematically elaborates a theoretical framework for greedy approximation and its applications.  The book addresses the needs of researchers working in numerical mathematics, harmonic analysis, and functional analysis. It quickly takes the reader from classical results to the latest frontier, but is written at the level of a graduate course and do...

Stateless multicast switching in software defined networks

OpenAIRE

Reed, Martin J.; Al-Naday, Mays; Thomos, Nikolaos; Trossen, Dirk; Petropoulos, George; Spirou, Spiros

2016-01-01

Multicast data delivery can significantly reduce traffic in operators' networks, but has been limited in deployment due to concerns such as the scalability of state management. This paper shows how multicast can be implemented in contemporary software defined networking (SDN) switches, with less state than existing unicast switching strategies, by utilising a Bloom Filter (BF) based switching technique. Furthermore, the proposed mechanism uses only proactive rule insertion, and thus, is not l...

The Case for the Stateless Society: Law

Directory of Open Access Journals (Sweden)

Chamberlin Antón

2017-12-01

Full Text Available What is the argument against government? There are several. For one thing, there is automatic exit for failure: businesses that do not earn a profit go bankrupt, and their resources tend to migrate to other, more effective, managers. For another, entrepreneurs operate with their own funds, or those voluntarily entrusted to them. This does not apply to bureaucrats and politicians, in sharp contrast. Perhaps most important, in the case of each and every commercial interaction in the market, buying, selling, renting, lending, borrowing, there is mutual gain at least in the ex ante sense of anticipations, and usually ex post, after the trade, as well. This rarely occurs under statism, at least not with regard to its source of funds, taxation, since it is not voluntary. An exception would be the relatively unimportant cases in which a consumer purchases something from the government, such as a ticket to cross a bridge, or a producer sells something to this organization, such as an airplane. The present paper is an attempt to elaborate upon this considerations.

Stateless and stateful implementations of faithful execution

Science.gov (United States)

Pierson, Lyndon G; Witzke, Edward L; Tarman, Thomas D; Robertson, Perry J; Eldridge, John M; Campbell, Philip L

2014-12-16

A faithful execution system includes system memory, a target processor, and protection engine. The system memory stores a ciphertext including value fields and integrity fields. The value fields each include an encrypted executable instruction and the integrity fields each include an encrypted integrity value for determining whether a corresponding one of the value fields has been modified. The target processor executes plaintext instructions decoded from the ciphertext while the protection engine is coupled between the system memory and the target processor. The protection engine includes logic to retrieve the ciphertext from the system memory, decrypt the value fields into the plaintext instructions, perform an integrity check based on the integrity fields to determine whether any of the corresponding value fields have been modified, and provide the plaintext instructions to the target processor for execution.

Bius, parbaringen und paniaran : über Demokratie und Religion bei den Tobabatak Nordsumatras

NARCIS (Netherlands)

Angerler, Johann

2009-01-01

This investigation is an attempt to gain a better understanding of the religious and socio-political organization of pre-colonial Tobabatak society. In literature the traditionally stateless Tobabatak society is usually depicted as being organized principally along kinship lines and there is still a

Kenya: Current Conditions and the Challenges Ahead

Science.gov (United States)

2009-05-14

declared that “those alleging vote tampering may pursue legal remedies and should be able, consistent with respect for freedom of speech , to make...executive influence on the judiciary; disrespect for freedom of speech and of the press; internally displaced persons, refugees, and stateless

Sadhana | Indian Academy of Sciences

Indian Academy of Sciences (India)

Position based opportunistic routing (POR) is a stateless, robust, and reliable geographic routing protocol in Mobile AdHoc NETwork (MANET). The opportunistic routing embraces broadcast property of wireless channels and utilizes it for opportunistic forwarding. Both the malicious node behavior and the backupnodes' ...

A new efficient RLF-like algorithm for the vertex coloring problem

Directory of Open Access Journals (Sweden)

Adegbindin Mourchid

2016-01-01

Full Text Available The Recursive Largest First (RLF algorithm is one of the most popular greedy heuristics for the vertex coloring problem. It sequentially builds color classes on the basis of greedy choices. In particular, the first vertex placed in a color class C is one with a maximum number of uncolored neighbors, and the next vertices placed in C are chosen so that they have as many uncolored neighbors which cannot be placed in C. These greedy choices can have a significant impact on the performance of the algorithm, which explains why we propose alternative selection rules. Computational experiments on 63 difficult DIMACS instances show that the resulting new RLF-like algorithm, when compared with the standard RLF, allows to obtain a reduction of more than 50% of the gap between the number of colors used and the best known upper bound on the chromatic number. The new greedy algorithm even competes with basic metaheuristics for the vertex coloring problem.

A Distributed Routing Scheme for Energy Management in Solar Powered Sensor Networks

KAUST Repository

Dehwah, Ahmad H.

2017-10-11

Energy management is critical for solar-powered sensor networks. In this article, we consider data routing policies to optimize the energy in solar powered networks. Motivated by multipurpose sensor networks, the objective is to find the best network policy that maximizes the minimal energy among nodes in a sensor network, over a finite time horizon, given uncertain energy input forecasts. First, we derive the optimal policy in certain special cases using forward dynamic programming. We then introduce a greedy policy that is distributed and exhibits significantly lower complexity. When computationally feasible, we compare the performance of the optimal policy with the greedy policy. We also demonstrate the performance and computational complexity of the greedy policy over randomly simulated networks, and show that it yields results that are almost identical to the optimal policy, for greatly reduced worst-case computational costs and memory requirements. Finally, we demonstrate the implementation of the greedy policy on an experimental sensor network.

An Architectural Style for Ajax

NARCIS (Netherlands)

Mesbah, A.; Van Deursen, A.

2006-01-01

A new breed of web application, dubbed AJAX, is emerging in response to a limited degree of interactivity in large-grain stateless Web interactions. At the heart of this new approach lies a single page interaction model that facilitates rich interactivity. We have studied and experimented with

Mutable Conflicts

DEFF Research Database (Denmark)

Kublitz, Anja

The Arabic term al-Nakba literally means the catastrophe and is used in Palestinian national discourse to designate the outcome of the Arab-Israeli war of 1948, when the state of Israel was declared and more than 700,000 Palestinians became stateless. Among Palestinians in Denmark, though...

Citizenship, Nationalism, Human Rights and Democracy: A Tangling of Terms in the Kuwaiti Curriculum

Science.gov (United States)

Al-Nakib, Rania

2011-01-01

Background: Citizenship, nationalism, human rights and democracy are four terms and concepts that are inextricably linked. In Kuwait, the status of citizen is based on nationality, gender and age, with women, children, naturalised citizens, expatriates and "bidoon" (stateless people) denied many freedoms, rights and services. Citizenship…

Trigonometric bases for matrix weighted Lp-spaces

DEFF Research Database (Denmark)

Nielsen, Morten

2010-01-01

We give a complete characterization of 2π-periodic matrix weights W for which the vector-valued trigonometric system forms a Schauder basis for the matrix weighted space Lp(T;W). Then trigonometric quasi-greedy bases for Lp(T;W) are considered. Quasi-greedy bases are systems for which the simple...

SPIAR: an architectural style for single page internet applications

NARCIS (Netherlands)

A. Mesbah (Ali); K. Broenink; A. van Deursen (Arie)

2006-01-01

textabstractA new breed of Web application, dubbed AJAX, is emerging in response to a limited degree of interactivity in large-grain stateless Web interactions. At the heart of this new approach lies a single page interaction model that facilitates rich interactivity. In this paper, we examine the

Nationalist Narratives, Boundaries and Social Inclusion/Exclusion in Palestinian Camps in South Lebanon

Science.gov (United States)

Fincham, Kathleen

2012-01-01

This article explores how in the contexts of exile and statelessness and in the absence of Palestinian institutions, such as schools, Palestinian youth in south Lebanon construct their identities through nationalist narratives of shared history, kinship, culture and religion. Although these narratives help to construct shared notions of…

Compassion, Caring and Justice: Teachers' Strategies to Maintain Moral Integrity in the Face of National Hostility to the "Non-Citizen"

Science.gov (United States)

Arnot, Madeleine; Pinson, Halleli; Candappa, Mano

2009-01-01

Refugees commonly have just one remaining identity--that of being stateless and statusless. They represent the ultimate "other in our midst". The humanism of our teachers in helping the children of asylum-seekers and refugees is tested by the state, especially its immigration policy. This paper offers preliminary research findings on…

ARMed SPHINCS computing a 41KB signature in 16KB of RAM

NARCIS (Netherlands)

Hülsing, A.T.; Rijneveld, J.; Schwabe, P.; Cheng, C.-M.; Chung, K.-M.; Persiano, G.; Yang, B.-Y.

2016-01-01

This paper shows that it is feasible to implement the stateless hash-based signature scheme SPHINCS-256 on an embedded microprocessor with memory even smaller than a signature and limited computing power. We demonstrate that it is possible to generate and verify the 41KB signature on an ARM Cortex

A Component- and Push-based Architectural Style for Ajax Applications

NARCIS (Netherlands)

Mesbah, A.; Van Deursen, A.

2008-01-01

Preprint of article published in: Journal of Systems and Software (Elsevier), 81 (12), 2008; doi:10.1016/j.jss.2008.04.005 A new breed of web application, dubbed ajax, is emerging in response to a limited degree of interactivity in large-grain stateless Web interactions. At the heart of this new

ARMed SPHINCS : computing a 41KB signature in 16KB of RAM

NARCIS (Netherlands)

Hülsing, A.T.; Rijneveld, J.; Schwabe, P.

2015-01-01

This paper shows that it is feasible to implement the stateless hash-based signature scheme SPHINCS-256 on a "very small device" with memory even smaller than a signature and limited computing power. We demonstrate that it is possible to generate and verify the 41\\,KB signature on an ARM Cortex M3

Perímetro escrotal e idade à puberdade em ovinos Merino Australiano submetidos a diferentes regimes alimentares - DOI: 10.4025/actascianimsci.v27i4.1179 Scrotal perimeter and age of puberty in Australian Merino Sheep, submitted to different alimentary strategies - DOI: 10.4025/actascianimsci.v27i4.1179

Directory of Open Access Journals (Sweden)

Leonardo Franco Martins

2005-03-01

of different colors (orange, purple, black and green distributed among the treatments. Body score maintained the same relations that were observed on body weight. Animals with black earring presented smaller scrotal perimeter on the 132nd day, with larger scrotal growth, due to the nutritional improvement of those animals on specific periods. As a condition of corporal score, the scrotal perimeter maintained the same relationship among the groups observed for the body weight: the orange group presented the highest perimeter, followed by the purple, green and black group. Only 62.5% of the animals reached puberty until the end of the experiment. Animals reached puberty with the same score, scrotal perimeter and age, albirt they presented different weights

Mapping crop based on phenological characteristics using time-series NDVI of operational land imager data in Tadla irrigated perimeter, Morocco

Science.gov (United States)

Ouzemou, Jamal-eddine; El Harti, Abderrazak; EL Moujahid, Ali; Bouch, Naima; El Ouazzani, Rabii; Lhissou, Rachid; Bachaoui, El Mostafa

2015-10-01

Morocco is a primarily arid to semi-arid country. These climatic conditions make irrigation an imperative and inevitable technique. Especially, agriculture has a paramount importance for the national economy. Retrieving of crops and their location as well as their spatial extent is useful information for agricultural planning and better management of irrigation water resource. Remote sensing technology was often used in management and agricultural research. Indeed, it's allows crops extraction and mapping based on phenological characteristics, as well as yield estimation. The study area of this work is the Tadla irrigated perimeter which is characterized by heterogeneous areas and extremely small size fields. Our principal objectives are: (1) the delimitation of the major crops for a good water management, (2) the insulation of sugar beet parcels for modeling its yields. To achieve the traced goals, we have used Landsat-8 OLI (Operational Land Imager) data pan-sharpened to 15 m. Spectral Angle Mapper (SAM) and Support Vector Machine (SVM) classifications were applied to the Normalized Difference Vegetation Index (NDVI) time-series of 10 periods. Classifications were calculated for a site of more than 124000 ha. This site was divided into two parts: the first part for selecting, training datasets and the second one for validating the classification results. The SVM and SAM methods classified the principal crops with overall accuracies of 85.27% and 57.17% respectively, and kappa coefficient of 80% and 43% respectively. The study showed the potential of using time-series OLI NDVI data for mapping different crops in irrigated, heterogeneous and undersized parcels in arid and semi-arid environment.

A Simulation of Readiness-Based Sparing Policies

Science.gov (United States)

2017-06-01

variant of a greedy heuristic algorithm to set stock levels and estimate overall WS availability. Our discrete event simulation is then used to test the...variant of a greedy heuristic algorithm to set stock levels and estimate overall WS availability. Our discrete event simulation is then used to test the...WS Type with 22 Individual WS at a Representative Site.....................................................................................31

Arabism and Islam: Stateless Nations and Nationless States

National Research Council Canada - National Science Library

Helms, Christine M

1990-01-01

During the 1980s, Islamic activists in the Arab Middle East have challenged the definition of "legitimate authority" and provided the means and rationale for revolutionary change, hoping to pressure...

State Complexity of Testing Divisibility

Directory of Open Access Journals (Sweden)

Emilie Charlier

2010-08-01

Full Text Available Under some mild assumptions, we study the state complexity of the trim minimal automaton accepting the greedy representations of the multiples of m >= 2 for a wide class of linear numeration systems. As an example, the number of states of the trim minimal automaton accepting the greedy representations of the multiples of m in the Fibonacci system is exactly 2m^2.

Lessons learned: A comparative study of the integration experiences of Armenian and Palestinian refugees in Lebanon

Science.gov (United States)

2017-06-01

Figure 12. Socio-economic Satisfaction Items. ...........................................................68 Figure 13. Domains of Integration...religious authorities, provided assistance to the incoming refugees until the United Nations could secure financial and practical aid.186 The Palestinian...given to Lebanese workers in each respective country. In this case, the stateless Palestinian refugees cannot work in job sectors that are subject to

Structure-function relationship between the octopus perimeter cluster mean sensitivity and sector retinal nerve fiber layer thickness measured with the RTVue optical coherence tomography and scanning laser polarimetry.

Science.gov (United States)

Naghizadeh, Farzaneh; Garas, Anita; Vargha, Péter; Holló, Gábor

2014-01-01

To determine structure-function relationship between each of 16 Octopus perimeter G2 program clusters and the corresponding 16 peripapillary sector retinal nerve fiber layer thickness (RNFLT) values measured with the RTVue-100 Fourier-domain optical coherence tomography (RTVue OCT) and scanning laser polarimetry with variable corneal compensation (GDx-VCC) and enhanced corneal compensation (GDx-ECC) corneal compensation. One eye of 110 white patients (15 healthy, 20 ocular hypertensive, and 75 glaucoma eyes) were investigated. The Akaike information criterion and the F test were used to identify the best fitting model. Parabolic relationship with logarithmic cluster mean sensitivity and linear sector RNFLT values provided the best fit. For RTVue OCT, significant (P0.05) was found for the control eyes. Mean sensitivity of the Octopus visual field clusters showed significant parabolic relationship with the corresponding peripapillary RNFLT sectors. The relationship was more general with the RTVue OCT than GDx-VCC or GDx-ECC. The results show that visual field clusters of the Octopus G program can be applied for detailed structure-function research.

Impact of heuristics in clustering large biological networks.

Science.gov (United States)

Shafin, Md Kishwar; Kabir, Kazi Lutful; Ridwan, Iffatur; Anannya, Tasmiah Tamzid; Karim, Rashid Saadman; Hoque, Mohammad Mozammel; Rahman, M Sohel

2015-12-01

Traditional clustering algorithms often exhibit poor performance for large networks. On the contrary, greedy algorithms are found to be relatively efficient while uncovering functional modules from large biological networks. The quality of the clusters produced by these greedy techniques largely depends on the underlying heuristics employed. Different heuristics based on different attributes and properties perform differently in terms of the quality of the clusters produced. This motivates us to design new heuristics for clustering large networks. In this paper, we have proposed two new heuristics and analyzed the performance thereof after incorporating those with three different combinations in a recently celebrated greedy clustering algorithm named SPICi. We have extensively analyzed the effectiveness of these new variants. The results are found to be promising. Copyright © 2015 Elsevier Ltd. All rights reserved.

Fire Perimeters (2012)

Data.gov (United States)

Department of Homeland Security — The Geospatial Multi-Agency Coordination Group, or GeoMAC, is an internet-based mapping tool originally designed for fire managers to access online maps of current...

Transnationalism and Civic Engagement

DEFF Research Database (Denmark)

Farah, Abdulkadir Osman

2013-01-01

For more than two decades Somalia has lacked nationwide functioning bureaucratic Western inspired state institutions. Under such stateless circumstances, formally and informally organized social groups, have tried to fill the vacuum in providing social, economic, security and political services...... proposes tentative strategic ideas on how to overcome major societal obstacles that have so far confronted Somali civil society in contributing to security consolidation....

Greedy algorithms and Zipf laws

Science.gov (United States)

Moran, José; Bouchaud, Jean-Philippe

2018-04-01

We consider a simple model of firm/city/etc growth based on a multi-item criterion: whenever entity B fares better than entity A on a subset of M items out of K, the agent originally in A moves to B. We solve the model analytically in the cases K  =  1 and . The resulting stationary distribution of sizes is generically a Zipf-law provided M  >  K/2. When , no selection occurs and the size distribution remains thin-tailed. In the special case M  =  K, one needs to regularize the problem by introducing a small ‘default’ probability ϕ. We find that the stationary distribution has a power-law tail that becomes a Zipf-law when . The approach to the stationary state can also be characterized, with strong similarities with a simple ‘aging’ model considered by Barrat and Mézard.

Wrapper-based selection of genetic features in genome-wide association studies through fast matrix operations

Science.gov (United States)

2012-01-01

Background Through the wealth of information contained within them, genome-wide association studies (GWAS) have the potential to provide researchers with a systematic means of associating genetic variants with a wide variety of disease phenotypes. Due to the limitations of approaches that have analyzed single variants one at a time, it has been proposed that the genetic basis of these disorders could be determined through detailed analysis of the genetic variants themselves and in conjunction with one another. The construction of models that account for these subsets of variants requires methodologies that generate predictions based on the total risk of a particular group of polymorphisms. However, due to the excessive number of variants, constructing these types of models has so far been computationally infeasible. Results We have implemented an algorithm, known as greedy RLS, that we use to perform the first known wrapper-based feature selection on the genome-wide level. The running time of greedy RLS grows linearly in the number of training examples, the number of features in the original data set, and the number of selected features. This speed is achieved through computational short-cuts based on matrix calculus. Since the memory consumption in present-day computers can form an even tighter bottleneck than running time, we also developed a space efficient variation of greedy RLS which trades running time for memory. These approaches are then compared to traditional wrapper-based feature selection implementations based on support vector machines (SVM) to reveal the relative speed-up and to assess the feasibility of the new algorithm. As a proof of concept, we apply greedy RLS to the Hypertension – UK National Blood Service WTCCC dataset and select the most predictive variants using 3-fold external cross-validation in less than 26 minutes on a high-end desktop. On this dataset, we also show that greedy RLS has a better classification performance on independent

Probing properties of the interfacial perimeter sites in TiO x /Au/SiO 2 with 2-propanol decomposition

Energy Technology Data Exchange (ETDEWEB)

Wu, Yi Y.; Kung, Harold H. (NWU)

2017-11-01

The decomposition of 2-propanol was studied over SiO2, SiO2 with an overlayer of TiO2 (Ti/SiO2), Au/SiO2, and Au/SiO2 with an overlayer of TiO2 (Ti/[Au/SiO2]) at 170–190 °C. There was no reaction on SiO2. Propene was the only product on Ti/SiO2, and its rate of formation increased proportionally with the Ti content. Acetone was the major product (selectivity 65–99%) on all Au-containing catalysts. Its rate of formation also increased with Ti loading. In addition, small amounts of propene were also formed on Ti/[Au/SiO2] the rate of which increased with Ti loading. Characterization of the catalysts with N2 adsorption, STEM, DR-UV-vis spectroscopy, XPS, XANES and EXAFS suggested that the Ti formed an amorphous TiO2 overlayer on the catalyst. At high Ti loadings (4–5 wt.%), there were patches of thick porous TiO2 layer, and some microdomains of crystalline TiO2 could be detected. Au was present as 1–3 nm nanoparticles on all catalysts, before and after used in reaction. Only Lewis acid sites were detected based on results from pyridine adsorption, and their quantities increased with Ti loading. Based on the comparison of reaction rates, the dependence of the kinetics on 2-propanol partial pressure, the apparent activation energies, and the effect of co-feeding O2 among different catalysts, it was concluded that propene was formed on the TiO2 overlayer, acetone was formed primarily at the Au-TiO2 interfacial perimeter sites, and α-C-H bond breaking preceding acetone formation was more facile on Au at the interfacial site than other surface Au atoms. Implication of these results to the selective acetone formation in the oxidation of propane in the presence of a O2/H2 mixture was discussed.

Advanced use of World-Wide Web in the online system of DELPHI

International Nuclear Information System (INIS)

Doenszelmann, M.; Carvalho, D.; Du, S.; Tennebo, F.

1996-01-01

The World-Wide Web technologies used by the DELPHI experiment at CERN to provide easy access to information of the On-line System. WWW technology on both client and server side is used in five different projects. The World-Wide Web has its advantages concerning the network technology, the practical user interface and its scalability. It however also demands a stateless protocol and format negotiation. (author)

Minimization of Decision Tree Average Depth for Decision Tables with Many-valued Decisions

KAUST Repository

Azad, Mohammad

2014-09-13

The paper is devoted to the analysis of greedy algorithms for the minimization of average depth of decision trees for decision tables such that each row is labeled with a set of decisions. The goal is to find one decision from the set of decisions. When we compare with the optimal result obtained from dynamic programming algorithm, we found some greedy algorithms produces results which are close to the optimal result for the minimization of average depth of decision trees.

Learning Type Extension Trees for Metal Bonding State Prediction

DEFF Research Database (Denmark)

Frasconi, Paolo; Jaeger, Manfred; Passerini, Andrea

2008-01-01

Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities. They can be efficiently learned with a greedy search strategy driven by a generalized relational information gain and a discr......Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities. They can be efficiently learned with a greedy search strategy driven by a generalized relational information gain...

Minimization of Decision Tree Average Depth for Decision Tables with Many-valued Decisions

KAUST Repository

Azad, Mohammad; Moshkov, Mikhail

2014-01-01

The paper is devoted to the analysis of greedy algorithms for the minimization of average depth of decision trees for decision tables such that each row is labeled with a set of decisions. The goal is to find one decision from the set of decisions. When we compare with the optimal result obtained from dynamic programming algorithm, we found some greedy algorithms produces results which are close to the optimal result for the minimization of average depth of decision trees.

Classification and Optimization of Decision Trees for Inconsistent Decision Tables Represented as MVD Tables

KAUST Repository

Azad, Mohammad

2015-10-11

Decision tree is a widely used technique to discover patterns from consistent data set. But if the data set is inconsistent, where there are groups of examples (objects) with equal values of conditional attributes but different decisions (values of the decision attribute), then to discover the essential patterns or knowledge from the data set is challenging. We consider three approaches (generalized, most common and many-valued decision) to handle such inconsistency. We created different greedy algorithms using various types of impurity and uncertainty measures to construct decision trees. We compared the three approaches based on the decision tree properties of the depth, average depth and number of nodes. Based on the result of the comparison, we choose to work with the many-valued decision approach. Now to determine which greedy algorithms are efficient, we compared them based on the optimization and classification results. It was found that some greedy algorithms Mult\\\\_ws\\\\_entSort, and Mult\\\\_ws\\\\_entML are good for both optimization and classification.

Detection of Cheating by Decimation Algorithm

Science.gov (United States)

Yamanaka, Shogo; Ohzeki, Masayuki; Decelle, Aurélien

2015-02-01

We expand the item response theory to study the case of "cheating students" for a set of exams, trying to detect them by applying a greedy algorithm of inference. This extended model is closely related to the Boltzmann machine learning. In this paper we aim to infer the correct biases and interactions of our model by considering a relatively small number of sets of training data. Nevertheless, the greedy algorithm that we employed in the present study exhibits good performance with a few number of training data. The key point is the sparseness of the interactions in our problem in the context of the Boltzmann machine learning: the existence of cheating students is expected to be very rare (possibly even in real world). We compare a standard approach to infer the sparse interactions in the Boltzmann machine learning to our greedy algorithm and we find the latter to be superior in several aspects.

Classification and Optimization of Decision Trees for Inconsistent Decision Tables Represented as MVD Tables

KAUST Repository

Azad, Mohammad; Moshkov, Mikhail

2015-01-01

Decision tree is a widely used technique to discover patterns from consistent data set. But if the data set is inconsistent, where there are groups of examples (objects) with equal values of conditional attributes but different decisions (values of the decision attribute), then to discover the essential patterns or knowledge from the data set is challenging. We consider three approaches (generalized, most common and many-valued decision) to handle such inconsistency. We created different greedy algorithms using various types of impurity and uncertainty measures to construct decision trees. We compared the three approaches based on the decision tree properties of the depth, average depth and number of nodes. Based on the result of the comparison, we choose to work with the many-valued decision approach. Now to determine which greedy algorithms are efficient, we compared them based on the optimization and classification results. It was found that some greedy algorithms Mult\\_ws\\_entSort, and Mult\\_ws\\_entML are good for both optimization and classification.

State as a Service : Towards Stateful Cloud Services

OpenAIRE

Alnoor, Ahmadullah

2012-01-01

Cloud ERP or Enterprise Resource Planning (ERP) as a Cloud Service delivers value by reducing initial and long term operating costs since infrastructure, platform and (certain) application management tasks are delegated to a specialist provider. Questions present at intersection of the ERP challenge landscape and the Cloud Computing opportunity horizon include characterization of Cloud friendly ERP modules and adaptation of stateful (on-premises ERP) components to a stateless platform. Contri...

Speeding Up Maximal Causality Reduction with Static Dependency Analysis

OpenAIRE

Huang, Shiyou; Huang, Jeff

2017-01-01

Stateless Model Checking (SMC) offers a powerful approach to verifying multithreaded programs but suffers from the state-space explosion problem caused by the huge thread interleaving space. The pioneering reduction technique Partial Order Reduction (POR) mitigates this problem by pruning equivalent interleavings from the state space. However, limited by the happens-before relation, POR still explores redundant executions. The recent advance, Maximal Causality Reduction (MCR), shows a promisi...

Illicit networks targeting the nexus between terrorists, proliferators, and narcotraffickers

OpenAIRE

Dietz, Rebekah K.

2010-01-01

Approved for public release; distribution is unlimited Globalization and the liberal international marketplace have provided fertile ground for the rise of transnational and non-state actors. Unfortunately, while states and businesses have profited from the increased fluidity of borders and the rise of global commerce, so have the criminal organizations that threaten national and international security. These illicit networks are stateless; they conduct their business in failed or failing ...

Buffer Management of Multi-Queue QoS Switches with Class Segregation

OpenAIRE

Itoh, Toshiya; Yoshimoto, Seiji

2013-01-01

In this paper, we focus on buffer management of multi-queue QoS switches in which packets of different values are segregated in different queues. Our model consists of $m$ queues and $m$ packet values $0 < v_{1} < v_{2} < ... < v_{m}$. Recently, Al-Bawani and Souza [IPL 113(4), pp.145-150, 2013] presented an online algorithm GREEDY for buffer management of multi-queue QoS switches with class segregation and showed thatif $m$ queues have the same size, then the competitive ratio of GREEDY is $...

Frequency inverter and irrigation management in irrigated perimeter on Jaiba region - MG, Brazil; Uso de inversor de frequencia e do manejo da irrigacao em perimetro da regiao do Jaiba, MG

Energy Technology Data Exchange (ETDEWEB)

Moraes, Maria Joselma de; Oliveira Filho, Delly; Vieira, Gustavo H.S. [Universidade Federal de Vicosa (UFV), MG (Brazil). Dept. de Engenharia Agricola], Emails: maria.moraes@ufv.br, delly@ufv.br, ghsvieira@ifes.edu.br; Scarcelli, Ricardo de O.C. [Universidade Federal de Vicosa (UFV), MG (Brazil). Dept. de Engenharia Eletrica], E-mail: rocvenceslau@yahoo.com.br

2010-07-01

The electric energy expenditure and the irrigation depth for one irrigated perimeter on Jaiba region/MG, Brazil, for the cultures: pineapple, banana, guava, lemon, papaya, mango, passion fruit, cantaloupe, pine cone and grape. With the monthly irrigation depth data for an hypothetical area of 12 lots (10 ha each), it was simulated, with Galateia software, the head pressure for 4 combinations of cultures: first - papaya (12 lots); second - banana (8 lots), guava (1), papaya (1), mango (1) and passion fruit (1); third - papaya (8), guava (1), pineapple (1), (1) and lemon (1); and fourth - guava (8), mango (1), papaya (1), pine cone (1) and passion fruit (1). It was dimensioned the necessary power and the electrical energy expenses with TOU (green category tariff) for the biggest irrigation depth. The frequency inverter use and the management of the number of working hours were simulated for each combination, in order to maximize the motor's load and the pump-motor set performance. For the combinations 2, 3, and 4 occurred reduction on the electrical energy consumption of 6%, 8% and 20%, respectively in respect of the combination 1. (author)

The use of geological data from pilot holes for predicting FPI (full perimeter intersection) fractures

International Nuclear Information System (INIS)

Joutsen, A.

2012-02-01

Posiva Oy is responsible for preparation of final disposal of spent nuclear fuel in Olkiluoto. The knowledge about existing network of fractures is important for the safety and feasibility of the final repository. The bedrock properties essential for safety case are analyzed in investigations of Rock Suitability Criteria (RSC). One subtask in RSC is avoidance of large (long) fractures adjacent to disposal holes. The long fractures have been defined in tunnel mapping to indicate tunnel cross-cutting fractures (TCF) or full perimeter intersections (FPI). The purpose for this study was to evaluate the possibility of recognizing FPIs from drill cores by their geological properties. The study was carried out by correlating FPIs mapped from the ONKALO tunnel to the pilot holes logging data with a view of finding out which fracture in the pilot hole corresponds to the FPI in the tunnel. It was also estimated what kind of geological properties does FPIs commonly have in the tunnel and how does these properties differ from the FPI correlated pilot hole fractures. The data sources for this study are the pilot holes from ONK-PH8 to ONK-PH14 and the systematic geological mapping data. The FPIs used in this study usually follow the general trends of the fracturing in the Olkiluoto bedrock. The fracture surface profiles are principally undulating and a striation can be often seen on the fracture surfaces. The FPIs are frequently moderately to intensely altered with diverse filling mineralogy and thick fracture fillings in comparison to the regular fractures. The FPI correlated pilot hole fractures have slightly different properties in comparison to the FPIs. These fractures have wider range of different fracture surface profiles and are slightly less altered than the FPIs. Filling mineralogy follows the trends of the FPIs but filling thicknesses are thinner. These differences probably occur because of the variable uncertainties related to the correlation and to the fact that the

The use of geological data from pilot holes for predicting FPI (full perimeter intersection) fractures

Energy Technology Data Exchange (ETDEWEB)

Joutsen, A.

2012-02-15

Posiva Oy is responsible for preparation of final disposal of spent nuclear fuel in Olkiluoto. The knowledge about existing network of fractures is important for the safety and feasibility of the final repository. The bedrock properties essential for safety case are analyzed in investigations of Rock Suitability Criteria (RSC). One subtask in RSC is avoidance of large (long) fractures adjacent to disposal holes. The long fractures have been defined in tunnel mapping to indicate tunnel cross-cutting fractures (TCF) or full perimeter intersections (FPI). The purpose for this study was to evaluate the possibility of recognizing FPIs from drill cores by their geological properties. The study was carried out by correlating FPIs mapped from the ONKALO tunnel to the pilot holes logging data with a view of finding out which fracture in the pilot hole corresponds to the FPI in the tunnel. It was also estimated what kind of geological properties does FPIs commonly have in the tunnel and how does these properties differ from the FPI correlated pilot hole fractures. The data sources for this study are the pilot holes from ONK-PH8 to ONK-PH14 and the systematic geological mapping data. The FPIs used in this study usually follow the general trends of the fracturing in the Olkiluoto bedrock. The fracture surface profiles are principally undulating and a striation can be often seen on the fracture surfaces. The FPIs are frequently moderately to intensely altered with diverse filling mineralogy and thick fracture fillings in comparison to the regular fractures. The FPI correlated pilot hole fractures have slightly different properties in comparison to the FPIs. These fractures have wider range of different fracture surface profiles and are slightly less altered than the FPIs. Filling mineralogy follows the trends of the FPIs but filling thicknesses are thinner. These differences probably occur because of the variable uncertainties related to the correlation and to the fact that the

Presidential Edict No. 2145 "On Measures to Introduce Immigration Control" [16 December 1993].

Science.gov (United States)

1993-12-27

This Edict introduces immigration controls at the borders of the Russian Federation. The controls are under the Russian Federal Migration Service and have the following tasks: "a) control over the entry onto the country's territory of foreign citizens or stateless persons seeking asylum or in transit, their identification, registration, and recording; b) the implementation of measures to prevent uncontrolled migration and the organization of the deportation of foreigners in cases and within the procedure stipulated by acts of legislation; c) the examination of appeals for asylum from foreign citizens and stateless persons who have come to Russian territory." Further provisions of the Edict deal with determination of immigration control points and their opening hours, allocation of premises and equipment for the implementation of immigration control activities, financing, information communication systems, procedures for the temporary accommodation and residence of persons seeking asylum, immigration personnel, and the training of such personnel, among other things. In December 1993, the Council of Ministers of the Russian Federation issued a Decree to create a statewide automated system of registering the official identity documents of the population and calling for proposals on this system. See Foreign Broadcast Information Service, Document No. FBIS-SOV-93-246, 27 December 1993, p. 42.

Decision rules for decision tables with many-valued decisions

KAUST Repository

Chikalov, Igor

2011-01-01

In the paper, authors presents a greedy algorithm for construction of exact and partial decision rules for decision tables with many-valued decisions. Exact decision rules can be \\'over-fitted\\', so instead of exact decision rules with many attributes, it is more appropriate to work with partial decision rules with smaller number of attributes. Based on results for set cover problem authors study bounds on accuracy of greedy algorithm for exact and partial decision rule construction, and complexity of the problem of minimization of decision rule length. © 2011 Springer-Verlag.

Nuclear power plant security systems - The need for upgrades

International Nuclear Information System (INIS)

Murskyj, M.P.; Furlow, C.H.

1989-01-01

Most perimeter security systems for nuclear power plants were designed and installed in the late 1970s or early 1980s. This paper explores the need to regularly evaluate and possibly upgrade a security system in the area of perimeter intrusion detection and surveillance. this paper discusses US Nuclear Regulatory Commission audits and regulatory effectiveness reviews (RERs), which have raised issues regarding the performance of perimeter security systems. The audits and RERs identified various degrees of vulnerability in certain aspects of existing perimeter security systems. In addition to reviewing the regulatory concerns, this paper discusses other reasons to evaluate and/or upgrade a perimeter security system

KEDUDUKAN HUKUM ISLAM DALAM SISTEM HUKUM INDONESIA

Directory of Open Access Journals (Sweden)

M. Khoirul Huda

2013-05-01

Full Text Available State protects religion, adherent religion, even put tenets and the law profess Islamic in life be of noble birth and stateless. Islamic law is based on the teaching of Islamic and if judging by the terms of the materials it Islamic include the law of worship and law of muamalat. It Characterizes the law Islamic that is sourced from Islamic relating to the priest, and belief have two term shariah and fiqh.

Autonomy as State Prevention: The Palestinian Question after Camp David, 1979-1982

OpenAIRE

Anziska, S. E.

2017-01-01

The context of Israel’s post-1967 rule over the Palestinian territories, which began well after the end of empire, the mandates, and the major waves of decolonization, sheds new light on the relationship between late-twentieth-century occupation and the persistence of prolonged statelessness. This essay examines how a particular practice within the political and diplomatic repertoire of transformative occupation—the promotion of local autonomy—was successfully deployed in the Israeli-Palestin...

Gathering asychronous mobile robots with inaccurate compasses

OpenAIRE

Souissi, Samia; Defago, Xavier; Yamashita, Masafumi

2006-01-01

This paper considers a system of asynchronous autonomous mobile robots that can move freely in a twodimensional plane with no agreement on a common coordinate system. Starting from any initial configuration, the robots are required to eventually gather at a single point, not fixed in advance (gathering problem). Prior work has shown that gathering oblivious (i.e., stateless) robots cannot be achieved deterministically without additional assumptions. In particular, if robots can detect multipl...

Electromagnetic interference-aware transmission scheduling and power control for dynamic wireless access in hospital environments.

Science.gov (United States)

Phunchongharn, Phond; Hossain, Ekram; Camorlinga, Sergio

2011-11-01

We study the multiple access problem for e-Health applications (referred to as secondary users) coexisting with medical devices (referred to as primary or protected users) in a hospital environment. In particular, we focus on transmission scheduling and power control of secondary users in multiple spatial reuse time-division multiple access (STDMA) networks. The objective is to maximize the spectrum utilization of secondary users and minimize their power consumption subject to the electromagnetic interference (EMI) constraints for active and passive medical devices and minimum throughput guarantee for secondary users. The multiple access problem is formulated as a dual objective optimization problem which is shown to be NP-complete. We propose a joint scheduling and power control algorithm based on a greedy approach to solve the problem with much lower computational complexity. To this end, an enhanced greedy algorithm is proposed to improve the performance of the greedy algorithm by finding the optimal sequence of secondary users for scheduling. Using extensive simulations, the tradeoff in performance in terms of spectrum utilization, energy consumption, and computational complexity is evaluated for both the algorithms.

On Coverage and Capacity for Disaster Area Wireless Networks Using Mobile Relays

Directory of Open Access Journals (Sweden)

Guo Wenxuan

2009-01-01

Full Text Available Public safety organizations increasingly rely on wireless technology to provide effective communications during emergency and disaster response operations. This paper presents a comprehensive study on dynamic placement of relay nodes (RNs in a disaster area wireless network. It is based on our prior work of mobility model that characterizes the spatial movement of the first responders as mobile nodes (MNs during their operations. We first investigate the COverage-oriented Relay Placement (CORP problem that is to maximize the total number of MNs connected with the relays. Considering the network throughput, we then study the CApacity-oriented Relay Placement (CARP problem that is to maximize the aggregated data rate of all MNs. For both coverage and capacity studies, we provide each the optimal and the greedy algorithms with computational complexity analysis. Furthermore, simulation results are presented to compare the performance between the greedy and the optimal solutions for the CORP and CARP problems, respectively. It is shown that the greedy algorithms can achieve near optimal performance but at significantly lower computational complexity.

Gender on the growth of Criollo foals from birth to three years of age

Directory of Open Access Journals (Sweden)

Anelise Maria Hammes Pimentel

Full Text Available ABSTRACT: The objective of the present study was to evaluate the effect of gender on the growth of Criollo foals, in order to use this information as a reference for breeding as well as in future research. Body height, thoracic perimeter, and cannon bone perimeter of 75 foals were measured from two farms in Rio Grande do Sul, Brazil (Lat. 32°, 33′, 58″, Long. 53°, 22′, 33″ and from three generations over three years. In both farms, animals were kept under the same range and feeding conditions. Nonlinear regression models were applied to describe the growth curves for the three traits over the experimental period. Cannon bone perimeter was greater in males than in females (P<0.001 but the predicted curves for body height and thoracic perimeter did not differ between genders. For all traits, the highest rate of increase was achieved in the first year of life (body height = 74%, thoracic perimeter = 76%, and cannon bone perimeter = 63% for males and 83% for females. Results of this study indicated that changes in body height and thoracic perimeter can be predicted using nonlinear models in both male and female foals, until they reach three years of age; whereas, changes in cannon bone perimeter should be modeled separately for each gender.

Hybrid Feature Selection Approach Based on GRASP for Cancer Microarray Data

Directory of Open Access Journals (Sweden)

Arpita Nagpal

2017-01-01

Full Text Available Microarray data usually contain a large number of genes, but a small number of samples. Feature subset selection for microarray data aims at reducing the number of genes so that useful information can be extracted from the samples. Reducing the dimension of data sets further helps in improving the computational efficiency of the learning model. In this paper, we propose a modified algorithm based on the tabu search as local search procedures to a Greedy Randomized Adaptive Search Procedure (GRASP for high dimensional microarray data sets. The proposed Tabu based Greedy Randomized Adaptive Search Procedure algorithm is named as TGRASP. In TGRASP, a new parameter has been introduced named as Tabu Tenure and the existing parameters, NumIter and size have been modified. We observed that different parameter settings affect the quality of the optimum. The second proposed algorithm known as FFGRASP (Firefly Greedy Randomized Adaptive Search Procedure uses a firefly optimization algorithm in the local search optimzation phase of the greedy randomized adaptive search procedure (GRASP. Firefly algorithm is one of the powerful algorithms for optimization of multimodal applications. Experimental results show that the proposed TGRASP and FFGRASP algorithms are much better than existing algorithm with respect to three performance parameters viz. accuracy, run time, number of a selected subset of features. We have also compared both the approaches with a unified metric (Extended Adjusted Ratio of Ratios which has shown that TGRASP approach outperforms existing approach for six out of nine cancer microarray datasets and FFGRASP performs better on seven out of nine datasets.

Assignment of stock keeping units to parallel undirectional picking

Directory of Open Access Journals (Sweden)

Matthews, Jason

2015-05-01

Full Text Available An order picking system consisting of a number of parallel unidirectional picking lines is investigated. Stock keeping units (SKUs that are grouped by product type into distributions (DBNs are assigned daily to available picking lines. A mathematical programming formulation and its relaxations is presented. A greedy insertion and a greedy phased insertion are further introduced to obtain feasible results within usable computation times for all test cases. The walking distance of the pickers was shown to decrease by about 22 per cent compared with the current assignment approach. However, product handling and operational risk increases.

Minimization of decision tree depth for multi-label decision tables

KAUST Repository

Azad, Mohammad

2014-10-01

In this paper, we consider multi-label decision tables that have a set of decisions attached to each row. Our goal is to find one decision from the set of decisions for each row by using decision tree as our tool. Considering our target to minimize the depth of the decision tree, we devised various kinds of greedy algorithms as well as dynamic programming algorithm. When we compare with the optimal result obtained from dynamic programming algorithm, we found some greedy algorithms produces results which are close to the optimal result for the minimization of depth of decision trees.

Minimization of decision tree depth for multi-label decision tables

KAUST Repository

Azad, Mohammad; Moshkov, Mikhail

2014-01-01

In this paper, we consider multi-label decision tables that have a set of decisions attached to each row. Our goal is to find one decision from the set of decisions for each row by using decision tree as our tool. Considering our target to minimize the depth of the decision tree, we devised various kinds of greedy algorithms as well as dynamic programming algorithm. When we compare with the optimal result obtained from dynamic programming algorithm, we found some greedy algorithms produces results which are close to the optimal result for the minimization of depth of decision trees.

Fast algorithm of adaptive Fourier series

Science.gov (United States)

Gao, You; Ku, Min; Qian, Tao

2018-05-01

Adaptive Fourier decomposition (AFD, precisely 1-D AFD or Core-AFD) was originated for the goal of positive frequency representations of signals. It achieved the goal and at the same time offered fast decompositions of signals. There then arose several types of AFDs. AFD merged with the greedy algorithm idea, and in particular, motivated the so-called pre-orthogonal greedy algorithm (Pre-OGA) that was proven to be the most efficient greedy algorithm. The cost of the advantages of the AFD type decompositions is, however, the high computational complexity due to the involvement of maximal selections of the dictionary parameters. The present paper offers one formulation of the 1-D AFD algorithm by building the FFT algorithm into it. Accordingly, the algorithm complexity is reduced, from the original $\\mathcal{O}(M N^2)$ to $\\mathcal{O}(M N\\log_2 N)$, where $N$ denotes the number of the discretization points on the unit circle and $M$ denotes the number of points in $[0,1)$. This greatly enhances the applicability of AFD. Experiments are carried out to show the high efficiency of the proposed algorithm.

RMP: Reduced-set matching pursuit approach for efficient compressed sensing signal reconstruction

Directory of Open Access Journals (Sweden)

Michael M. Abdel-Sayed

2016-11-01

Full Text Available Compressed sensing enables the acquisition of sparse signals at a rate that is much lower than the Nyquist rate. Compressed sensing initially adopted ℓ1 minimization for signal reconstruction which is computationally expensive. Several greedy recovery algorithms have been recently proposed for signal reconstruction at a lower computational complexity compared to the optimal ℓ1 minimization, while maintaining a good reconstruction accuracy. In this paper, the Reduced-set Matching Pursuit (RMP greedy recovery algorithm is proposed for compressed sensing. Unlike existing approaches which either select too many or too few values per iteration, RMP aims at selecting the most sufficient number of correlation values per iteration, which improves both the reconstruction time and error. Furthermore, RMP prunes the estimated signal, and hence, excludes the incorrectly selected values. The RMP algorithm achieves a higher reconstruction accuracy at a significantly low computational complexity compared to existing greedy recovery algorithms. It is even superior to ℓ1 minimization in terms of the normalized time-error product, a new metric introduced to measure the trade-off between the reconstruction time and error. RMP superior performance is illustrated with both noiseless and noisy samples.

RMP: Reduced-set matching pursuit approach for efficient compressed sensing signal reconstruction.

Science.gov (United States)

Abdel-Sayed, Michael M; Khattab, Ahmed; Abu-Elyazeed, Mohamed F

2016-11-01

Compressed sensing enables the acquisition of sparse signals at a rate that is much lower than the Nyquist rate. Compressed sensing initially adopted [Formula: see text] minimization for signal reconstruction which is computationally expensive. Several greedy recovery algorithms have been recently proposed for signal reconstruction at a lower computational complexity compared to the optimal [Formula: see text] minimization, while maintaining a good reconstruction accuracy. In this paper, the Reduced-set Matching Pursuit (RMP) greedy recovery algorithm is proposed for compressed sensing. Unlike existing approaches which either select too many or too few values per iteration, RMP aims at selecting the most sufficient number of correlation values per iteration, which improves both the reconstruction time and error. Furthermore, RMP prunes the estimated signal, and hence, excludes the incorrectly selected values. The RMP algorithm achieves a higher reconstruction accuracy at a significantly low computational complexity compared to existing greedy recovery algorithms. It is even superior to [Formula: see text] minimization in terms of the normalized time-error product, a new metric introduced to measure the trade-off between the reconstruction time and error. RMP superior performance is illustrated with both noiseless and noisy samples.

THE EFFECT OF NON-ROUTINE GEOMETRY PROBLEM ON ELEMENTARY STUDENTS BELIEF IN MATHEMATICS: A CASE STUDY

Directory of Open Access Journals (Sweden)

Khoerul Umam

2018-03-01

Full Text Available Many learners hold traditional beliefs about perimeter and area that a shape with a larger area must have a larger perimeter while shape with the same perimeter must have the same area. To address this issue, non-routine geometry problem is given. This qualitative descriptive research used to reach the goal and to explore the effect of non-routine geometry problem on elementary student belief in mathematics. The instrument has been developed to accommodate intuitive student belief and student’s belief about the concept of perimeter. The results provide evidence that students’ intuitive belief about perimeter can be change through non-routine geometry problem which is required understanding and some mathematical analysis. Fortunately, the problem has helped the elementary students revise and correct their beliefs, thoughts, and understandings relating to the circumference of shape.

Usability evaluation of the South African National Accessibility Portal interactive voice response system

CSIR Research Space (South Africa)

Greeff, M

2008-10-01

Full Text Available , which contains a web container and an Enterprise JavaBean container (EJB container). • PostgreSQL as database. The database does not link into existing databases, but are custom-built. • The NAP Portal application consisting of EJB 3.0 com- pliant... components: Stateless Session Beans (SLSB), Stateful Session Beans (SFSB), Message-Driven Beans, and EJB 3.0 entities utilising a presentation technology known as JavaServer Faces, combined with a templat- ing framework. • These elements are glued...

Myanmar's Rohingya Refugees in Malaysia: Education and the Way Forward

OpenAIRE

Hema Letchamanan

2013-01-01

The Rohingya, a persecuted minority, has faced decades of harsh treatment and made stateless by the military government in Myanmar. To escape from this severe repression, most Rohingya flee to Bangladesh, Thailand or Malaysia. In Malaysia, this community has been living invisibly for more than three decades. Just like other refugees, the Rohingya are not allowed to work legally and do not have access to free healthcare and education in this country. Many of these refugee children learn in the...

A comparison of two IPv4/IPv6 transition mechanisms - OpenVPN and IVI

Science.gov (United States)

Vu, Cong Tuan; Tran, Quang Anh; Jiang, Frank

2012-09-01

This document presents a comparison of two IPv4/IPv6 transition mechanisms. They are OpenVPN and IVI. Meanwhile OpenVPN is based on tunneling technology, IVI is a stateless IPv4/IPv6 translation technique which is developed by China Education and Research Network (CERNET). This research focus on the quantitative and qualitative comparison of these two main mechanisms; how they are applied in practical situation by the Internet Service Providers, as well as their advantages and drawbacks.

Stability of the old mine workings in the Jeroným at Čistá, Sokolov District

Czech Academy of Sciences Publication Activity Database

Kukutsch, Radovan; Žůrek, P.; Kořínek, R.

2012-01-01

Roč. 135, č. 42 (2012), s. 67-74 ISSN 0324-9670 Institutional support: RVO:68145535 Keywords : Jeroným Mine in Čistá * stability * geomechanical monitoring * old mine workings Subject RIV: DH - Mining , incl. Coal Mining http://yadda.icm.edu.pl/baztech/element/bwmeta1.element.baztech-article-BPW6-0029-0005?q=bwmeta1.element.baztech-volume-0370-0798-prace_naukowe_instytutu_gornictwa_politechniki_wroclawskiej__studia_i_materialy-2012-vol__135_nr_42;4&qt=CHILDREN-STATELESS

Unconditionally Secure and Universally Composable Commitments from Physical Assumptions

DEFF Research Database (Denmark)

Damgård, Ivan Bjerre; Scafuro, Alessandra

2013-01-01

We present a constant-round unconditional black-box compiler that transforms any ideal (i.e., statistically-hiding and statistically-binding) straight-line extractable commitment scheme, into an extractable and equivocal commitment scheme, therefore yielding to UC-security [9]. We exemplify the u...... of unconditional UC-security with (malicious) PUFs and stateless tokens, our compiler can be instantiated with any ideal straight-line extractable commitment scheme, thus allowing the use of various setup assumptions which may better fit the application or the technology available....

Odor-baited trap trees: a novel management tool for plum curculio (Coleoptera: Curculionidae).

Science.gov (United States)

Leskey, Tracy C; Piñero, Jaime C; Prokopy, Ronald J

2008-08-01

The plum curculio, Conotrachelus nenuphar (Herbst) (Coleoptera: Curculionidae), one of the most important pests of apple (Malus spp.) in eastern and central North America, historically has been managed in New England apple orchards by three full block insecticide applications. Efforts to reduce insecticide inputs against plum curculio include perimeter row sprays, particularly after petal fall, to control immigrating adults. The odor-baited trap tree approach represents a new reduced input strategy for managing plum curculio based on the application of insecticides to a few perimeter-row trap trees rather than the entire perimeter row or full orchard block. Here, we compared the efficacy of a trap tree approach with perimeter row treatments to manage populations after petal fall in commercial apple orchards in 2005 and 2006. Injury was significantly greater in trap trees compared with unbaited perimeter row treated trees in both years of the study. In 2005, heavy rains prevented growers from applying insecticide applications at regular intervals resulting in high injury in nearly all blocks regardless of type of management strategy. In 2006, both the trap-tree and perimeter-row treatments prevented penetration by immigrating populations and resulted in economically acceptable levels of injury. The trap tree management strategy resulted in a reduction of approximately 70% total trees being treated with insecticide compared with perimeter row sprays and 93% compared with standard full block sprays.

Diferentes aferições do diâmetro abdominal sagital e do perímetro da cintura na predição do HOMA-IR Mediciones distintas del diámetro abdominal sagital y del perímetro de la cintura en la predicción del HOMA-IR Different measurements of the sagittal abdominal diameter and waist perimeter in the prediction of HOMA-IR

Directory of Open Access Journals (Sweden)

Ana Carolina Junqueira Vasques

2009-11-01

umbilical, menor cintura, inmediatamente superior a la cresta ilíaca y punto promedio entre la cresta ilíaca y la última costilla se calcularon en cuatro locales diferentes. La resistencia a la insulina se evaluó por el índice HOMA-IR. RESULTADOS: Todas las mediciones presentaron correlación intraclase de 0,986-0,999. Tanto el diámetro abdominal sagital calculado en la menor cintura (r=0,482 y AUC=0,739±0,049 como el perímetro de la cintura calculado en el punto promedio entre la última costilla y la cresta ilíaca (r=0,464 e AUC=0,746±0,05 presentaron mayores correlaciones con el HOMA-IR, así como un mejor poder discriminante para el HOMA-IR según el análisis ROC (pBACKGROUND: The correlation between the increase in visceral fat and insulin resistance makes the sagittal abdominal diameter and the waist perimeter as potential tools for the prediction of insulin resistance. OBJECTIVE: To assess the reproducibility of different measurements of the sagittal abdominal diameter and the waist perimeter and analyze the discriminating power of the measurements when predicting insulin resistance. METHODS: A total of 190 adult males were studied. The sagittal abdominal diameter (smallest girth, larger abdominal diameter, umbilical level and midpoint between the iliac crests and the waist perimeter (umbilical level, smallest girth, immediately above the iliac crest and midpoint between the iliac crest and the last rib were measured at four different sites. Insulin resistance was assessed by the homeostasis model of assessment-insulin resistance (HOMA-IR index. RESULTS: All measurements presented an intraclass correlation of 0.986-0.999. The sagittal abdominal diameter measured at the smallest girth (r=0.482 and AUC=0.739±0.049 and the waist perimeter measured at the midpoint between the last rib and the iliac crest (r=0.464 and AUC=0.746±0.05 presented the highest correlations with the HOMA-IR and the best discriminating power for HOMA-IR according to the ROC analysis

Neuropathies of the optic nerve and visual evoked potentials with special reference to color vision and differential light threshold measured with the computer perimeter OCTOPUS.

Science.gov (United States)

Wildberger, H

1984-10-31

The contrast evoked potentials (VEPs) to different check sizes were recorded in about 200 cases of discrete optic neuropathies (ON) of different origin. Differential light threshold (DLT) was tested with the computer perimeter OCTOPUS. Saturated and desaturated tests were applied to evaluate the degree of acquired color vision deficiency. Delayed VEP responses are not confined to optic neuritis (RBN) alone and the different latency times obtained from other ON are confluent. The delay may be due to demyelination, to an increasing dominance of paramacular VEP subcomponents or to an increasing dominance of the upper half-field responses. Recording with smaller check sizes has the advantage that discrete dysfunctions in the visual field (VF) center are more easily detected: a correlation between amplitudes and visual acuity is best in strabismic amblyopias, is less expressed in maculopathies of the retina and weak in ON. The absence or reduction of amplitudes to smaller check sizes, however, is an important indication of a disorder in the VF center of ON in an early or recovered stage. Acquired color vision defects of the tritan-like type are more confined to discrete ON, whereas the red/green type is reserved to more severe ON. The DLT of the VF center is reduced in a different, significant and non significant extent in discrete optic neuropathies and the correlation between DLT and visual acuity is weak. A careful numerical analysis is needed in types of discrete ON where the central DLT lies within normal statistical limits: a side difference of the DLT between the affected and the normal fellow eye is always present. Evaluation of visual fatigue effects and of the relative sensitivity loss of VF center and VF periphery may provide further diagnostic information.

Algoritmos rápidos de detecção de colisão broad phase utilizando KD-trees

OpenAIRE

Rocha, Rafael de Sousa

2010-01-01

Neste trabalho, três novos algoritmos rápidos de detecção de colisão broad phase, os quais utilizam a estrutura de particionamento espacial conhecida como KD-Tree, foram pro- postos e implementados: KDTreeSpace, DynamicKDTreeSpace e StatelessKDTreeSpace. Estes algoritmos foram integrados à biblioteca Open Dynamics Engine (ODE), responsável pelo cálculo do movimento dos objetos dinâmicos, como possíveis alternativas aos algoritmos de broad phase disponíveis nesta biblioteca. Os algori...

Improving multivariate Horner schemes with Monte Carlo tree search

Science.gov (United States)

Kuipers, J.; Plaat, A.; Vermaseren, J. A. M.; van den Herik, H. J.

2013-11-01

Optimizing the cost of evaluating a polynomial is a classic problem in computer science. For polynomials in one variable, Horner's method provides a scheme for producing a computationally efficient form. For multivariate polynomials it is possible to generalize Horner's method, but this leaves freedom in the order of the variables. Traditionally, greedy schemes like most-occurring variable first are used. This simple textbook algorithm has given remarkably efficient results. Finding better algorithms has proved difficult. In trying to improve upon the greedy scheme we have implemented Monte Carlo tree search, a recent search method from the field of artificial intelligence. This results in better Horner schemes and reduces the cost of evaluating polynomials, sometimes by factors up to two.

GEZGİN SATICI PROBLEMİNİ ÇÖZMEK İÇİN YENİ BİR HİBRİD SEZGİSEL ALGORİTMA

Directory of Open Access Journals (Sweden)

Gözde KIZILATEŞ

2015-05-01

Full Text Available The Traveling Salesman Problem (TS P is an important and well known combinatoriyal opti- mization problem. The goal of the problem is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. Although the definition of the travelling salesman problem is easy, it belongs to NP-Hard class. In this paper, a new hybrid heurist ic algorithm based on Nearest Neighbour (NN and Greedy heur istic algorithms is proposed for s olving the TSP. This proposed hybrid heuristic algorithm is compared with NN and Greedy heuristi cs. The experimental results show that the proposed algorithm is efficient

Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks.

Science.gov (United States)

Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

2016-07-14

Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle's position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption.

SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks

National Research Council Canada - National Science Library

He, Tian; Stankovic, John A; Lu, Chenyang; Abdelzaher, Tarek

2003-01-01

.... End-to-end soft real-time communication is achieved by maintaining a desired delivery speed across the sensor network through a novel combination of feedback control and non-deterministic geographic forwarding...

Stateless Income, State Aid and the (Which?) Arm’s Length Principle

NARCIS (Netherlands)

Wattel, P.J.

2016-01-01

The arm’s length principle has a new function. When used by the European Union (EU) Commission for State aid control purposes, it is aimed at protecting a level playing field for all economic operators in the internal market, i.e. at protecting free competition, rather than at tax base protection or

Defunctionalized Interpreters for Call-by-Need Evaluation

DEFF Research Database (Denmark)

Danvy, Olivier; Millikin, Kevin; Munk, Johan

2010-01-01

Starting from the standard call-by-need reduction for the λ-calculus that is common to Ariola, Felleisen, Maraist, Odersky, and Wadler, we inter-derive a series of hygienic semantic artifacts: a reduction-free stateless abstract machine, a continuation-passing evaluation function, and what appears...... and Felleisen. Overall, the semantic artifacts presented here are simpler than many other such artifacts that have been independently worked out, and which require ingenuity, skill, and independent soundness proofs on a case-by-case basis. They are also simpler to inter-derive because the inter...

Canadian institute honours Hawking

Science.gov (United States)

Durrani, Matin

2009-11-01

The Perimeter Institute for Theoretical Physics in Waterloo, Canada, has announced that a major new extension to its campus will be known as the Stephen Hawking Centre. The extension, which is currently being built, is due to open in 2011 and will double the size of the institute. It will also provide a home for the institute's Masters students, the first of whom joined the Perimeter Institute this autumn as part of its Perimeter Scholars international programme.

Combinatorial Algorithms for Computing Column Space Bases ThatHave Sparse Inverses

Energy Technology Data Exchange (ETDEWEB)

Pinar, Ali; Chow, Edmond; Pothen, Alex

2005-03-18

This paper presents a combinatorial study on the problem ofconstructing a sparse basis forthe null-space of a sparse, underdetermined, full rank matrix, A. Such a null-space is suitable forsolving solving many saddle point problems. Our approach is to form acolumn space basis of A that has a sparse inverse, by selecting suitablecolumns of A. This basis is then used to form a sparse null-space basisin fundamental form. We investigate three different algorithms forcomputing the column space basis: Two greedy approaches that rely onmatching, and a third employing a divide and conquer strategy implementedwith hypergraph partitioning followed by the greedy approach. We alsodiscuss the complexity of selecting a column basis when it is known thata block diagonal basis exists with a small given block size.

75 FR 39544 - Disease, Disability, and Injury Prevention and Control

Science.gov (United States)

2010-07-09

..., 2010 (Closed). Place: The W Atlanta Hotel-Perimeter, Perimeter Center West, Atlanta, Georgia 30346..., Management Analysis and Services Office, CDC, pursuant to Section 10(d) of Public Law 92-463. Matters To Be...

Bias due to sample selection in propensity score matching for a supportive housing program evaluation in New York City.

Directory of Open Access Journals (Sweden)

Sungwoo Lim

Full Text Available OBJECTIVES: Little is known about influences of sample selection on estimation in propensity score matching. The purpose of the study was to assess potential selection bias using one-to-one greedy matching versus optimal full matching as part of an evaluation of supportive housing in New York City (NYC. STUDY DESIGN AND SETTINGS: Data came from administrative data for 2 groups of applicants who were eligible for an NYC supportive housing program in 2007-09, including chronically homeless adults with a substance use disorder and young adults aging out of foster care. We evaluated the 2 matching methods in their ability to balance covariates and represent the original population, and in how those methods affected outcomes related to Medicaid expenditures. RESULTS: In the population with a substance use disorder, only optimal full matching performed well in balancing covariates, whereas both methods created representative populations. In the young adult population, both methods balanced covariates effectively, but only optimal full matching created representative populations. In the young adult population, the impact of the program on Medicaid expenditures was attenuated when one-to-one greedy matching was used, compared with optimal full matching. CONCLUSION: Given covariate balancing with both methods, attenuated program impacts in the young adult population indicated that one-to-one greedy matching introduced selection bias.

Adjoint current-based approaches to prostate brachytherapy optimization

International Nuclear Information System (INIS)

Roberts, J. A.; Henderson, D. L.

2009-01-01

This paper builds on previous work done at the Univ. of Wisconsin - Madison to employ the adjoint concept of nuclear reactor physics in the so-called greedy heuristic of brachytherapy optimization. Whereas that previous work focused on the adjoint flux, i.e. the importance, this work has included use of the adjoint current to increase the amount of information available in optimizing. Two current-based approaches were developed for 2-D problems, and each was compared to the most recent form of the flux-based methodology. The first method aimed to take a treatment plan from the flux-based greedy heuristic and adjust via application of the current-displacement, or a vector displacement based on a combination of tissue (adjoint) and seed (forward) currents acting as forces on a seed. This method showed promise in improving key urethral and rectal dosimetric quantities. The second method uses the normed current-displacement as the greedy criterion such that seeds are placed in regions of least force. This method, coupled with the dose-update scheme, generated treatment plans with better target irradiation and sparing of the urethra and normal tissues than the flux-based approach. Tables of these parameters are given for both approaches. In summary, these preliminary results indicate adjoint current methods are useful in optimization and further work in 3-D should be performed. (authors)

Efeitos da seleção para peso pós-desmame sobre medidas corporais e perímetro escrotal de machos Nelore de Sertãozinho (SP Effects of post-weaning weight selection on body measurements and scrotal perimeter in Nellore males of Sertãozinho (SP

Directory of Open Access Journals (Sweden)

Joslaine Noely dos Santos Gonçalves Cyrillo

2000-04-01

Full Text Available O objetivo deste estudo foi avaliar o efeito indireto da seleção para peso pós-desmame sobre medidas corporais e perímetro escrotal de 809 machos Nelore, pertencentes às populações selecionadas (NeS e NeT e controle (NeC, da Estação Experimental de Zootecnia de Sertãozinho. As análises estatísticas foram executadas usando-se modelos de touros, sendo que a fonte de variação aleatória, touro, foi aninhada dentro de rebanho. Os efeitos fixos considerados foram: rebanho, ano de realização da Prova de Ganho de Peso (PGP, idade de vaca em anos e idade do animal em dias como covariável. A mudança genética, obtida como a diferença dos rebanhos selecionados em relação ao rebanho controle, foi 40,2 e 44,3 kg, para peso aos 378 dias (P378, para os rebanhos NeS e NeT, respectivamente. As mudanças para as demais características, na mesma ordem, foram 4,5 e 4,5 cm para altura na garupa (ATPF; 6,2 e 7,0 cm para perímetro torácico (PTOR; 5,8 e 6,3 cm para comprimento do corpo (COM; 2,9 e 2,0 cm para comprimento do dorso (DOR; 1,7 e 2,4 cm para comprimento da garupa, (GAR; 1,0 e 1,3 cm para distância de ísquios (ISQ; 1,8 e 2,6 cm para distância de íleos (ILEO; e 1,3 e 2,2 cm para perímetro escrotal (PE. Os resultados deste estudo mostraram que a seleção direta para peso pós-desmame promoveu respostas positivas correlacionadas nas dimensões de regiões do corpo de machos Nelore.The objective of this study was to evaluate the indirect effects of selection for post-weaning weight on body measures and scrotal perimeter of 809 Nellore males from selected herds (NeS and NeT and control herd (NeC, of the Estação Experimental de Zootecnia de Sertãozinho. The statistical analyses were performed by using a sire mixed model where the random source of variation, sires, was nested within herds. The fixed effects were herds, year of performance test (PGP, age of cow and age of the animal as a covariate. The average genetic change for

Phylogenetic networks: A tool to display character conflict and ...

African Journals Online (AJOL)

Jane

2011-10-05

Oct 5, 2011 ... accumulated by high-throughput molecular technologies, .... which mutation combined with the population's diver- gence led to fixation of .... construction and greedy reduction, one simulation, and two case studies from ...

The Dynamics of the Discrete Ultimatum Game and the Role of the Expectation Level

Directory of Open Access Journals (Sweden)

Lili Deng

2016-01-01

Full Text Available We have studied evolutionary ultimatum game with spatially arranged players, who have choice between the two kinds of strategies (named greedy and altruist. The strategies in the ultimatum game here are described by p(i and a(i, that is, the probability of offering i to himself and the accepting probability when receiving i. By using computer simulations with C++ builder, we have provided the dynamics of the greedy and altruistic strategies and found that the proportion evolution of the “greedy” strategy for different initial cases is approximately 60%. Furthermore, the explanations for the interesting phenomenon are presented from different aspects. In addition, we illustrate that the factor of the expectation level (aspiration level in the updating rule plays an important role in the promotion of altruistic behaviors.

Minimizing size of decision trees for multi-label decision tables

KAUST Repository

Azad, Mohammad

2014-09-29

We used decision tree as a model to discover the knowledge from multi-label decision tables where each row has a set of decisions attached to it and our goal is to find out one arbitrary decision from the set of decisions attached to a row. The size of the decision tree can be small as well as very large. We study here different greedy as well as dynamic programming algorithms to minimize the size of the decision trees. When we compare the optimal result from dynamic programming algorithm, we found some greedy algorithms produce results which are close to the optimal result for the minimization of number of nodes (at most 18.92% difference), number of nonterminal nodes (at most 20.76% difference), and number of terminal nodes (at most 18.71% difference).

Minimizing size of decision trees for multi-label decision tables

KAUST Repository

Azad, Mohammad; Moshkov, Mikhail

2014-01-01

We used decision tree as a model to discover the knowledge from multi-label decision tables where each row has a set of decisions attached to it and our goal is to find out one arbitrary decision from the set of decisions attached to a row. The size of the decision tree can be small as well as very large. We study here different greedy as well as dynamic programming algorithms to minimize the size of the decision trees. When we compare the optimal result from dynamic programming algorithm, we found some greedy algorithms produce results which are close to the optimal result for the minimization of number of nodes (at most 18.92% difference), number of nonterminal nodes (at most 20.76% difference), and number of terminal nodes (at most 18.71% difference).

78 FR 63475 - Ocean Transportation Intermediary License Applicants

Science.gov (United States)

2013-10-24

... dba Fachel Shipping & Logistics (NVO & OFF), 6331 Belair Road, Baltimore, MD 21206, Officers: Chinyere W. Osasuyi, Chief Executive Manager (QI), Famous I. Osasuyi, Chief Executive Member. Application... Change. Perimeter International dba Perimeter Logistics (NVO & OFF), 2700 Story Road, Suite 150, Irving...

Idle reduction programs and potential benefits to schools

Science.gov (United States)

2010-11-01

School districts in Texas and many other states have, in recent years, increased the walk zones : surrounding schools to a 2-mile perimeter. Inside this perimeter, either no school bus service is : offered, or service is offered only with a fee...

THE EFFORTS TO TERMINATE THE SITUATION WITH NO-CITIZENSHIP AND HUMAN RIGHTS VIOLATION OF ROHINGYA ETHNIC

Directory of Open Access Journals (Sweden)

Sefriani

2015-01-01

Full Text Available The refusal to recognize citizenship of Rohingnya ethnic by Myanmar government caused this ethnic without national and international protection. Statelessness situation is also became the entry point of other violation of human right such as ethnic cleansing and genocide which caused this ethnic became refugee. Some solutions offered to end this situation are: cooperate with UNHCR provide temporary shelter for those people; urge UNHCR granted refugee status for Rohingya; urge ASEAN conducted humanitarian diplomacy pursued Myanmar recognized citizenship of Rohingnya ; applied R to P to end the gross violation on human right toward Rohingnya if the threshold were fulfilled.

Microstructured optical fibers for gas sensing systems

Science.gov (United States)

Challener, William Albert; Choudhury, Niloy; Palit, Sabarni

2017-10-17

Microstructured optical fiber (MOF) includes a cladding extending a length between first and second ends. The cladding includes an inner porous microstructure that at least partially surrounds a hollow core. A perimeter contour of the hollow core has a non-uniform radial distance from a center axis of the cladding such that first segments of the cladding along the perimeter contour have a shorter radial distance from the center axis relative to second segments of the cladding along the perimeter contour. The cladding receives and propagates light energy through the hollow core, and the inner porous microstructure substantially confines the light energy within the hollow core. The cladding defines at least one port hole that extends radially from an exterior surface of the cladding to the hollow core. Each port hole penetrates the perimeter contour of the hollow core through one of the second segments of the cladding.

Online learning algorithm for ensemble of decision rules

KAUST Repository

Chikalov, Igor; Moshkov, Mikhail; Zielosko, Beata

2011-01-01

We describe an online learning algorithm that builds a system of decision rules for a classification problem. Rules are constructed according to the minimum description length principle by a greedy algorithm or using the dynamic programming approach

77 FR 61582 - Privacy Act of 1974; System of Records

Science.gov (United States)

2012-10-10

... with ``Air Force Legal Operations Agency, Commercial Law and Litigation Directorate, 1500 W. Perimeter... Address: Delete entry and replace with ``Air Force Legal Operations Agency, Commercial Law and Litigation..., Commercial Law and Litigation Directorate, 1500 W. Perimeter Rd., Ste. 1780, Joint Base Andrews, MD 20742...

An evaluation of rapid methods for monitoring vegetation characteristics of wetland bird habitat

Science.gov (United States)

Tavernia, Brian G.; Lyons, James E.; Loges, Brian W.; Wilson, Andrew; Collazo, Jaime A.; Runge, Michael C.

2016-01-01

Wetland managers benefit from monitoring data of sufficient precision and accuracy to assess wildlife habitat conditions and to evaluate and learn from past management decisions. For large-scale monitoring programs focused on waterbirds (waterfowl, wading birds, secretive marsh birds, and shorebirds), precision and accuracy of habitat measurements must be balanced with fiscal and logistic constraints. We evaluated a set of protocols for rapid, visual estimates of key waterbird habitat characteristics made from the wetland perimeter against estimates from (1) plots sampled within wetlands, and (2) cover maps made from aerial photographs. Estimated percent cover of annuals and perennials using a perimeter-based protocol fell within 10 percent of plot-based estimates, and percent cover estimates for seven vegetation height classes were within 20 % of plot-based estimates. Perimeter-based estimates of total emergent vegetation cover did not differ significantly from cover map estimates. Post-hoc analyses revealed evidence for observer effects in estimates of annual and perennial covers and vegetation height. Median time required to complete perimeter-based methods was less than 7 percent of the time needed for intensive plot-based methods. Our results show that rapid, perimeter-based assessments, which increase sample size and efficiency, provide vegetation estimates comparable to more intensive methods.

Milking drylands : gender networks, pastoral markets and food security in stateless Somalia

NARCIS (Netherlands)

Nori, M.

2010-01-01

The Milking Drylands research initiative addresses the critical issues of food security, market integration, gender roles and governance matters in a peculiar area of the world, the Somali ecosystem. The research aims at exploring interesting dynamics of ongoing social change, in order to stimulate

A Blind Antenna Selection Scheme for Single-Cell Uplink Massive MIMO

KAUST Repository

Elkhalil, Khalil

2017-02-09

This paper considers the uplink of a single-cell large-scale multiple-input multiple output (MIMO) system in which m mono-antenna users communicate with a base station (BS) outfitted by n antennas. We assume that the number of antennas at the BS and that of users take large values, as envisioned by large-scale MIMO systems. This allows for high spectral efficiency gains but obviously comes at the cost of higher complexity, a fact that becomes all the more critical as the number of antennas grows large. To solve this issue is to choose a subset of the available n antennas. The subset must be carefully chosen to achieve the best performance. However, finding the optimal subset of antennas is usually a difficult task, requiring one to solve a high dimensional combinatorial optimization problem. In this paper, we approach this problem in two ways. The first one consists in solving a convex relaxation of the problem using standard convex optimization tools. The second technique solves the problem using a greedy approach. The main advantages of the greedy approach lies in its wider scope, in that, unlike the first approach, it can be applied irrespective of the considered performance criterion. As an outcome of this feature, we show that the greedy approach can be applied even when only the channel statistics are available at the BS, which provides blind way to perform antenna selection.

Algorithms for selecting informative marker panels for population assignment.

Science.gov (United States)

Rosenberg, Noah A

2005-11-01

Given a set of potential source populations, genotypes of an individual of unknown origin at a collection of markers can be used to predict the correct source population of the individual. For improved efficiency, informative markers can be chosen from a larger set of markers to maximize the accuracy of this prediction. However, selecting the loci that are individually most informative does not necessarily produce the optimal panel. Here, using genotypes from eight species--carp, cat, chicken, dog, fly, grayling, human, and maize--this univariate accumulation procedure is compared to new multivariate "greedy" and "maximin" algorithms for choosing marker panels. The procedures generally suggest similar panels, although the greedy method often recommends inclusion of loci that are not chosen by the other algorithms. In seven of the eight species, when applied to five or more markers, all methods achieve at least 94% assignment accuracy on simulated individuals, with one species--dog--producing this level of accuracy with only three markers, and the eighth species--human--requiring approximately 13-16 markers. The new algorithms produce substantial improvements over use of randomly selected markers; where differences among the methods are noticeable, the greedy algorithm leads to slightly higher probabilities of correct assignment. Although none of the approaches necessarily chooses the panel with optimal performance, the algorithms all likely select panels with performance near enough to the maximum that they all are suitable for practical use.

Airport Perimeter Security Advisor, Phase I

Data.gov (United States)

National Aeronautics and Space Administration — The aviation system of the United States of America is one of our national treasures. Very few elements of our culture capture the America spirit like aviation. Air...

Historical Fire Perimeters (2000 to 2011)

Data.gov (United States)

Department of Homeland Security — The Geospatial Multi-Agency Coordination Group, or GeoMAC, is an internet-based mapping tool originally designed for fire managers to access online maps of current...

Collective navigation of complex networks: Participatory greedy routing.

Science.gov (United States)

Kleineberg, Kaj-Kolja; Helbing, Dirk

2017-06-06

Many networks are used to transfer information or goods, in other words, they are navigated. The larger the network, the more difficult it is to navigate efficiently. Indeed, information routing in the Internet faces serious scalability problems due to its rapid growth, recently accelerated by the rise of the Internet of Things. Large networks like the Internet can be navigated efficiently if nodes, or agents, actively forward information based on hidden maps underlying these systems. However, in reality most agents will deny to forward messages, which has a cost, and navigation is impossible. Can we design appropriate incentives that lead to participation and global navigability? Here, we present an evolutionary game where agents share the value generated by successful delivery of information or goods. We show that global navigability can emerge, but its complete breakdown is possible as well. Furthermore, we show that the system tends to self-organize into local clusters of agents who participate in the navigation. This organizational principle can be exploited to favor the emergence of global navigability in the system.

Greedy algorithm with weights for decision tree construction

KAUST Repository

Moshkov, Mikhail

2010-01-01

An approximate algorithm for minimization of weighted depth of decision trees is considered. A bound on accuracy of this algorithm is obtained which is unimprovable in general case. Under some natural assumptions on the class NP, the considered algorithm is close (from the point of view of accuracy) to best polynomial approximate algorithms for minimization of weighted depth of decision trees.

Winning quick and dirty: the greedy random walk

International Nuclear Information System (INIS)

Ben-Naim, E; Redner, S

2004-01-01

As a strategy to complete games quickly, we investigate one-dimensional random walks where the step length increases deterministically upon each return to the origin. When the step length after the kth return equals k, the displacement of the walk x grows linearly in time. Asymptotically, the probability distribution of displacements is a purely exponentially decaying function of |x|/t. The probability E(t, L) for the walk to escape a bounded domain of size L at time t decays algebraically in the long-time limit, E(t, L) ∼ L/t 2 . Consequently, the mean escape time (t) ∼ Lln L, while (t n ) ∼ L 2n-1 for n > 1. Corresponding results are derived when the step length after the kth return scales as k α for α > 0

Greedy algorithm with weights for decision tree construction

KAUST Repository

Moshkov, Mikhail

2010-12-01

An approximate algorithm for minimization of weighted depth of decision trees is considered. A bound on accuracy of this algorithm is obtained which is unimprovable in general case. Under some natural assumptions on the class NP, the considered algorithm is close (from the point of view of accuracy) to best polynomial approximate algorithms for minimization of weighted depth of decision trees.

Safeguards considerations for uranium enrichment facilities, as applied to gas centrifuge and gaseous diffusion facilities

International Nuclear Information System (INIS)

1979-03-01

The goals and objectives of IAEA safeguards as they are understood by the authors based on published documents are reviewed. These goals are then used to derive safeguards concerns, diversion strategies, and potential safeguards measures for four base cases, the production of highly enriched uranium (HEU) at a diffusion plant, the diversion of low enriched uranium (LEU) at a diffusion plant, the diversion of HEU at a gas centrifuge plant, and the diversion of LEU at a gas centrifuge plant. Tables of estimated capabilities are given for each case, under the assumption that the inspector would have access: to the cascade perimeter at or after the start of operations, to the cascade perimeter throughout construction and operation, to the cascade perimeter during operation plus a one-time access to the cascade itself, to the cascade during construction but only its perimeter during operation, or to the cascade itself during construction and operation

Applications of image analysis in the characterization of Streptomyces olindensis in submerged culture

Directory of Open Access Journals (Sweden)

Pamboukian Celso R. Denser

2002-01-01

Full Text Available The morphology of Streptomyces olindensis (producer of retamycin, an antitumor antibiotic grown in submerged culture was assessed by image analysis. The morphology was differentiated into four classes: pellets, clumps (or entangled filaments, branched and unbranched free filaments. Four morphological parameters were initially considered (area, convex area, perimeter, and convex perimeter but only two parameters (perimeter and convex perimeter were chosen to automatically classify the cells into the four morphological classes, using histogram analysis. Each morphological class was evaluated during growth carried out in liquid media in fermenter or shaker. It was found that pellets and clumps dominated in early growth stages in fermenter (due to the inoculum coming from a shaker cultivation and that during cultivation, the breakage of pellets and clumps caused an increase in the percentage of free filaments. The criteria of morphological classification by image analysis proposed were useful to quantify the percentage of each morphological class during fermentations and may help to establish correlations between antibiotic production and microorganism morphology.

On construction of partial association rules

KAUST Repository

Moshkov, Mikhail; Piliszczuk, Marcin; Zielosko, Beata Marta

2009-01-01

This paper is devoted to the study of approximate algorithms for minimization of partial association rule length. It is shown that under some natural assumptions on the class NP, a greedy algorithm is close to the best polynomial approximate

A North Korean Social Revolution in the Democratic People’s Republic of Korea

Science.gov (United States)

2014-12-04

Lorber Films , 2009). 18 nutrition and poor food quality serves as a catalyst for...cunning warmongers…..and South Koreans as sneaky and greedy US puppets .”78 The Ministry of People’s Security (MPS) and State Security Department (SSD

Decision rules for decision tables with many-valued decisions

KAUST Repository

Chikalov, Igor; Zielosko, Beata

2011-01-01

In the paper, authors presents a greedy algorithm for construction of exact and partial decision rules for decision tables with many-valued decisions. Exact decision rules can be 'over-fitted', so instead of exact decision rules with many attributes

Support agnostic Bayesian matching pursuit for block sparse signals

KAUST Repository

Masood, Mudassir; Al-Naffouri, Tareq Y.

2013-01-01

priori knowledge of block partition and utilizes a greedy approach and order-recursive updates of its metrics to find the most dominant sparse supports to determine the approximate minimum mean square error (MMSE) estimate of the block-sparse signal

Online learning algorithm for ensemble of decision rules

KAUST Repository

Chikalov, Igor

2011-01-01

We describe an online learning algorithm that builds a system of decision rules for a classification problem. Rules are constructed according to the minimum description length principle by a greedy algorithm or using the dynamic programming approach. © 2011 Springer-Verlag.

Graph Sampling for Covariance Estimation

KAUST Repository

Chepuri, Sundeep Prabhakar; Leus, Geert

2017-01-01

specialize for undirected circulant graphs in that the graph nodes leading to the best compression rates are given by the so-called minimal sparse rulers. A near-optimal greedy algorithm is developed to design the subsampling scheme for the non

[The occipital sinus: a radioanatomic study].

Science.gov (United States)

Gaumont-Darcissac, M; Viart, L; Foulon, P; Le Gars, D; Havet, E; Peltier, J

2015-03-01

The aim of this study was to assess the presence of an occipital sinus in both children and adults, and to detail its main associated anatomical characteristics. One hundred of patients' MRI (3D T1 EG) between 0 and 86 years old were studied, in sagittal and axial sections, with the software DxMM. Occipital sinus length, perimeter, and cerebellar falx length measurements were performed with the software's tools. Forty-three percent of patients had an occipital sinus (average perimeter was 3.02 mm, average length was 19.85 mm), and 23.26% of these patients had a cerebellar falx, 30.23% of these patients had one vein or more draining into the occipital sinus. Sixty-two percent of children had an occipital sinus (average perimeter was 2.87 mm, average length was 21.63 mm), and 29.03% of them had a cerebellar falx. Twenty-four percent of adults had an occipital sinus (average perimeter was 3.4mm, average length was 15.28 mm), and 8.33% of them had a cerebellar falx. This work highlights a link between the age and the occipital sinus existence. The perimeter of this sinus seems to be superior for adults, but its length seems to be superior for children. A cerebellar falx with the occipital sinus was found more frequently for children. Copyright © 2015 Elsevier Masson SAS. All rights reserved.

Fast Solution in Sparse LDA for Binary Classification

Science.gov (United States)

Moghaddam, Baback

2010-01-01

An algorithm that performs sparse linear discriminant analysis (Sparse-LDA) finds near-optimal solutions in far less time than the prior art when specialized to binary classification (of 2 classes). Sparse-LDA is a type of feature- or variable- selection problem with numerous applications in statistics, machine learning, computer vision, computational finance, operations research, and bio-informatics. Because of its combinatorial nature, feature- or variable-selection problems are NP-hard or computationally intractable in cases involving more than 30 variables or features. Therefore, one typically seeks approximate solutions by means of greedy search algorithms. The prior Sparse-LDA algorithm was a greedy algorithm that considered the best variable or feature to add/ delete to/ from its subsets in order to maximally discriminate between multiple classes of data. The present algorithm is designed for the special but prevalent case of 2-class or binary classification (e.g. 1 vs. 0, functioning vs. malfunctioning, or change versus no change). The present algorithm provides near-optimal solutions on large real-world datasets having hundreds or even thousands of variables or features (e.g. selecting the fewest wavelength bands in a hyperspectral sensor to do terrain classification) and does so in typical computation times of minutes as compared to days or weeks as taken by the prior art. Sparse LDA requires solving generalized eigenvalue problems for a large number of variable subsets (represented by the submatrices of the input within-class and between-class covariance matrices). In the general (fullrank) case, the amount of computation scales at least cubically with the number of variables and thus the size of the problems that can be solved is limited accordingly. However, in binary classification, the principal eigenvalues can be found using a special analytic formula, without resorting to costly iterative techniques. The present algorithm exploits this analytic

Approximation Algorithms for Model-Based Diagnosis

NARCIS (Netherlands)

Feldman, A.B.

2010-01-01

Model-based diagnosis is an area of abductive inference that uses a system model, together with observations about system behavior, to isolate sets of faulty components (diagnoses) that explain the observed behavior, according to some minimality criterion. This thesis presents greedy approximation

Parallel machine scheduling to maximize the weighted number of ...

African Journals Online (AJOL)

in-time jobs was investigated. The problem was NP complete in the strong sense, for which finding an optimal solution had been considered very unlikely. The performances of 4 greedy heuristic algorithms (WO1, WO2, DO1 and DO2) ...

Li2b2-Façade: Simulation of i2b2 Data Warehouse Server and Client for Interaction with Other Systems.

Science.gov (United States)

Majeed, Raphael W; Xu, Tingyan; Stöhr, Mark R; Röhrig, Rainer

2017-01-01

Since its release in 2004, the i2b2 data warehouse software has become a valuable tool for clinical researchers. Physicians can use its browser-based query frontend intuitively without additional training or reading through documentation. While the i2b2 software describes it's API as "REST", it is neither stateless nor does it follow the common guidelines for RESTful APIs. Thus, interfacing other software with i2b2's custom RPC-style XML-API is a very cumbersome process. To overcome these issues, we developed a lightweight software abstraction layer "lightweight i2b2 façade" (li2b2-façade).

An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks

Science.gov (United States)

Lin, Geng; Guan, Jian; Feng, Huibin

2018-06-01

The positive influence dominating set problem is a variant of the minimum dominating set problem, and has lots of applications in social networks. It is NP-hard, and receives more and more attention. Various methods have been proposed to solve the positive influence dominating set problem. However, most of the existing work focused on greedy algorithms, and the solution quality needs to be improved. In this paper, we formulate the minimum positive influence dominating set problem as an integer linear programming (ILP), and propose an ILP based memetic algorithm (ILPMA) for solving the problem. The ILPMA integrates a greedy randomized adaptive construction procedure, a crossover operator, a repair operator, and a tabu search procedure. The performance of ILPMA is validated on nine real-world social networks with nodes up to 36,692. The results show that ILPMA significantly improves the solution quality, and is robust.

Hard Real-Time Task Scheduling in Cloud Computing Using an Adaptive Genetic Algorithm

Directory of Open Access Journals (Sweden)

Amjad Mahmood

2017-04-01

Full Text Available In the Infrastructure-as-a-Service cloud computing model, virtualized computing resources in the form of virtual machines are provided over the Internet. A user can rent an arbitrary number of computing resources to meet their requirements, making cloud computing an attractive choice for executing real-time tasks. Economical task allocation and scheduling on a set of leased virtual machines is an important problem in the cloud computing environment. This paper proposes a greedy and a genetic algorithm with an adaptive selection of suitable crossover and mutation operations (named as AGA to allocate and schedule real-time tasks with precedence constraint on heterogamous virtual machines. A comprehensive simulation study has been done to evaluate the performance of the proposed algorithms in terms of their solution quality and efficiency. The simulation results show that AGA outperforms the greedy algorithm and non-adaptive genetic algorithm in terms of solution quality.

No place to hide: when shame causes proselfs to cooperate.

Science.gov (United States)

Declerck, Carolyn Henriette; Boone, Christophe; Kiyonari, Toko

2014-01-01

Shame is considered a social emotion with action tendencies that elicit socially beneficial behavior. Yet, unlike other social emotions, prior experimental studies do not indicate that incidental shame boosts prosocial behavior. Based on the affect as information theory, we hypothesize that incidental feelings of shame can increase cooperation, but only for self-interested individuals, and only in a context where shame is relevant with regards to its action tendency. To test this hypothesis, cooperation levels are compared between a simultaneous prisoner's dilemma (where "defect" may result from multiple motives) and a sequential prisoner's dilemma (where "second player defect" is the result of intentional greediness). As hypothesized, shame positively affected proselfs in a sequential prisoner's dilemma. Hence ashamed proselfs become inclined to cooperate when they believe they have no way to hide their greediness, and not necessarily because they want to make up for earlier wrong-doing.

Minimal-delay traffic grooming for WDM star networks

Science.gov (United States)

Choi, Hongsik; Garg, Nikhil; Choi, Hyeong-Ah

2003-10-01

All-optical networks face the challenge of reducing slower opto-electronic conversions by managing assignment of traffic streams to wavelengths in an intelligent manner, while at the same time utilizing bandwidth resources to the maximum. This challenge becomes harder in networks closer to the end users that have insufficient data to saturate single wavelengths as well as traffic streams outnumbering the usable wavelengths, resulting in traffic grooming which requires costly traffic analysis at access nodes. We study the problem of traffic grooming that reduces the need to analyze traffic, for a class of network architecture most used by Metropolitan Area Networks; the star network. The problem being NP-complete, we provide an efficient twice-optimal-bound greedy heuristic for the same, that can be used to intelligently groom traffic at the LANs to reduce latency at the access nodes. Simulation results show that our greedy heuristic achieves a near-optimal solution.

Comparison of gap frame designs and materials for precision cathode strip chambers

International Nuclear Information System (INIS)

Horvath, J.A.; Pratuch, S.M.; Belser, F.C.

1993-01-01

Precision cathode strip chamber perimeter designs that incorporate either continuous or discrete-post gap frames are analyzed. The effects of ten design and material combinations on gravity sag, mass, stress, and deflected shape are evaluated. Procedures are recommended for minimizing mass in the chamber perimeter region while retaining structural integrity and electrical design latitude

Comparative Study on Feature Selection and Fusion Schemes for Emotion Recognition from Speech

Directory of Open Access Journals (Sweden)

Santiago Planet

2012-09-01

Full Text Available The automatic analysis of speech to detect affective states may improve the way users interact with electronic devices. However, the analysis only at the acoustic level could be not enough to determine the emotion of a user in a realistic scenario. In this paper we analyzed the spontaneous speech recordings of the FAU Aibo Corpus at the acoustic and linguistic levels to extract two sets of features. The acoustic set was reduced by a greedy procedure selecting the most relevant features to optimize the learning stage. We compared two versions of this greedy selection algorithm by performing the search of the relevant features forwards and backwards. We experimented with three classification approaches: Naïve-Bayes, a support vector machine and a logistic model tree, and two fusion schemes: decision-level fusion, merging the hard-decisions of the acoustic and linguistic classifiers by means of a decision tree; and feature-level fusion, concatenating both sets of features before the learning stage. Despite the low performance achieved by the linguistic data, a dramatic improvement was achieved after its combination with the acoustic information, improving the results achieved by this second modality on its own. The results achieved by the classifiers using the parameters merged at feature level outperformed the classification results of the decision-level fusion scheme, despite the simplicity of the scheme. Moreover, the extremely reduced set of acoustic features obtained by the greedy forward search selection algorithm improved the results provided by the full set.

Computer-based image studies on tumor nests mathematical features of breast cancer and their clinical prognostic value.

Science.gov (United States)

Wang, Lin-Wei; Qu, Ai-Ping; Yuan, Jing-Ping; Chen, Chuang; Sun, Sheng-Rong; Hu, Ming-Bai; Liu, Juan; Li, Yan

2013-01-01

The expending and invasive features of tumor nests could reflect the malignant biological behaviors of breast invasive ductal carcinoma. Useful information on cancer invasiveness hidden within tumor nests could be extracted and analyzed by computer image processing and big data analysis. Tissue microarrays from invasive ductal carcinoma (n = 202) were first stained with cytokeratin by immunohistochemical method to clearly demarcate the tumor nests. Then an expert-aided computer analysis system was developed to study the mathematical and geometrical features of the tumor nests. Computer recognition system and imaging analysis software extracted tumor nests information, and mathematical features of tumor nests were calculated. The relationship between tumor nests mathematical parameters and patients' 5-year disease free survival was studied. There were 8 mathematical parameters extracted by expert-aided computer analysis system. Three mathematical parameters (number, circularity and total perimeter) with area under curve >0.5 and 4 mathematical parameters (average area, average perimeter, total area/total perimeter, average (area/perimeter)) with area under curve nests could be a useful parameter to predict the prognosis of early stage breast invasive ductal carcinoma.

Dual-shaped offset reflector antenna designs from solutions of the geometrical optics first-order partial differential equations

Science.gov (United States)

Galindo-Israel, V.; Imbriale, W.; Shogen, K.; Mittra, R.

1990-01-01

In obtaining solutions to the first-order nonlinear partial differential equations (PDEs) for synthesizing offset dual-shaped reflectors, it is found that previously observed computational problems can be avoided if the integration of the PDEs is started from an inner projected perimeter and integrated outward rather than starting from an outer projected perimeter and integrating inward. This procedure, however, introduces a new parameter, the main reflector inner perimeter radius p(o), when given a subreflector inner angle 0(o). Furthermore, a desired outer projected perimeter (e.g., a circle) is no longer guaranteed. Stability of the integration is maintained if some of the initial parameters are determined first from an approximate solution to the PDEs. A one-, two-, or three-parameter optimization algorithm can then be used to obtain a best set of parameters yielding a close fit to the desired projected outer rim. Good low cross-polarization mapping functions are also obtained. These methods are illustrated by synthesis of a high-gain offset-shaped Cassegrainian antenna and a low-noise offset-shaped Gregorian antenna.

Exact generating function for 2-convex polygons

International Nuclear Information System (INIS)

James, W R G; Jensen, I; Guttmann, A J

2008-01-01

Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their 'concavity index', m. Such polygons are called m-convex polygons and are characterized by having up to m indentations in their perimeter. We first describe how we conjectured the (isotropic) generating function for the case m = 2 using a numerical procedure based on series expansions. We then proceed to prove this result for the more general case of the full anisotropic generating function, in which steps in the x and y directions are distinguished. In doing so, we develop tools that would allow for the case m > 2 to be studied

Spare parts inventory control under system availability constraints

NARCIS (Netherlands)

Houtum, van G.J.J.A.N.; Kranenburg, A.A.

2015-01-01

This book focuses on the tactical planning level for spare parts management. It describes a series of multi-item inventory models and presents exact and heuristic optimization methods, including greedy heuristics that work well for real, life-sized problems. The intended audience consists of

Spectral Compressive Sensing with Polar Interpolation

DEFF Research Database (Denmark)

Fyhn, Karsten; Dadkhahi, Hamid; F. Duarte, Marco

2013-01-01

. In this paper, we introduce a greedy recovery algorithm that leverages a band-exclusion function and a polar interpolation function to address these two issues in spectral compressive sensing. Our algorithm is geared towards line spectral estimation from compressive measurements and outperforms most existing...

little italy, big japan: patterns of continuity and displacement among ...

African Journals Online (AJOL)

User

migration from the south to the cities driving the “economic miracle” in the north. ... the 1950s and 1980s, during which time Japan captured the attention of the entire world ..... divided between the greedy and indiscriminate avidity of all that is ...

How hard is it to find extreme Nash equilibria in network congestion games?

NARCIS (Netherlands)

Gassner, E.; Hatzl, J.; Krumke, S.O.; Sperber, H.; Woeginger, G.J.; Papadimitriou, C.; Zhang, S.

2008-01-01

We study the complexity of finding extreme pure Nash equilibria in symmetric (unweighted) network congestion games. In our context best and worst equilibria are those with minimum respectively maximum makespan. On series-parallel graphs a worst Nash equilibrium can be found by a Greedy approach

Root-Crown Relations of Young Sugar Maple and Yellow Birch

Science.gov (United States)

Carl H. Tubbs

1977-01-01

Young forest-grown sugar maple and yellow birch (1 to 6 inches d.b.h.) crowns were mapped and roots excavated. Crown dimensions were compared. Sugar maple roots usually terminated within a few feet of the crown perimeter. Yellow birch roots frequently terminated well outside crown perimeters and roots of birch were more irregularly distributed than those of maple....

Further improvements in competitive guarantees for QoS buffering

NARCIS (Netherlands)

Bansal, N.; Fleischer, L.K.; Kimbrel, T.; Mahdian, M.; Schieber, B.; Sviridenko, M.; Diaz, J.; Karhumäki, J.; Lepistö, A.; Sannella, D.

2004-01-01

We study the behavior of algorithms for buffering packets weighted by different levels of Quality of Service (QoS) guarantees in a single queue. Buffer space is limited, and packet loss occurs when the buffer overflows. We describe a modification of the previously proposed ``preemptive greedy{''}

Architecture Synthesis for Cost-Constrained Fault-Tolerant Flow-based Biochips

DEFF Research Database (Denmark)

Eskesen, Morten Chabert; Pop, Paul; Potluri, Seetal

2016-01-01

. This increase in fabrication complexity has led to an increase in defect rates during the manufacturing, thereby motivating the need to improve the yield, by designing these biochips such that they are fault tolerant. We propose an approach based on a Greedy Randomized Adaptive Search Procedure (GRASP...

Knowledge Discovery using Least Squares Support Vector Machine Classifiers: a Direct Marketing Case

NARCIS (Netherlands)

Viaene, S.; Baesens, B.; Van Gestel, T.; Suykens, J.A.K.; Van den Poel, D.; Vanthienen, J.; De Moor, B.; Dedene, G.; Zighed, D.A.; Komorowsky, J.; Żytkow, J.

2000-01-01

The case involves the detection and qualification of the most relevant predictors for repeat-purchase modelling in a direct marketing setting. Analysis is based on a wrapped form of feature selection using a sensitivity based pruning heuristic to guide a greedy, step-wise and backward traversal of

Algorithms

Indian Academy of Sciences (India)

to as 'divide-and-conquer'. Although there has been a large effort in realizing efficient algorithms, there are not many universally accepted algorithm design paradigms. In this article, we illustrate algorithm design techniques such as balancing, greedy strategy, dynamic programming strategy, and backtracking or traversal of ...

Joint duplex mode selection, channel allocation, and power control for full-duplex cognitive femtocell networks

Directory of Open Access Journals (Sweden)

Mingjie Feng

2015-02-01

Full Text Available In this paper, we aim to maximize the sum rate of a full-duplex cognitive femtocell network (FDCFN as well as guaranteeing the quality of service (QoS of users in the form of a required signal to interference plus noise ratios (SINR. We first consider the case of a pair of channels, and develop optimum-achieving power control solutions. Then, for the case of multiple channels, we formulate joint duplex model selection, power control, and channel allocation as a mixed integer nonlinear problem (MINLP, and propose an iterative framework to solve it. The proposed iterative framework consists of a duplex mode selection scheme, a near-optimal distributed power control algorithm, and a greedy channel allocation algorithm. We prove the convergence of the proposed iterative framework as well as a lower bound for the greedy channel allocation algorithm. Numerical results show that the proposed schemes effectively improve the sum rate of FDCFNs.

Sniffer Channel Selection for Monitoring Wireless LANs

Science.gov (United States)

Song, Yuan; Chen, Xian; Kim, Yoo-Ah; Wang, Bing; Chen, Guanling

Wireless sniffers are often used to monitor APs in wireless LANs (WLANs) for network management, fault detection, traffic characterization, and optimizing deployment. It is cost effective to deploy single-radio sniffers that can monitor multiple nearby APs. However, since nearby APs often operate on orthogonal channels, a sniffer needs to switch among multiple channels to monitor its nearby APs. In this paper, we formulate and solve two optimization problems on sniffer channel selection. Both problems require that each AP be monitored by at least one sniffer. In addition, one optimization problem requires minimizing the maximum number of channels that a sniffer listens to, and the other requires minimizing the total number of channels that the sniffers listen to. We propose a novel LP-relaxation based algorithm, and two simple greedy heuristics for the above two optimization problems. Through simulation, we demonstrate that all the algorithms are effective in achieving their optimization goals, and the LP-based algorithm outperforms the greedy heuristics.

Ambiguity in the m-bonacci numeration system

Directory of Open Access Journals (Sweden)

Petra Kocábová

2007-05-01

Full Text Available We study the properties of the function R (m (n defined as the number of representations of an integer n as a sum of distinct m-Bonacci numbers F (m k, given by F i (m =2 i-1, for i∈ { 1, 2, …, m}, F k+m (m =F k+m-1 (m +F k+m-2 (m + ⋯ + F k (m, for k ≥ 1. We give a matrix formula for calculating R (m (n from the greedy expansion of n. We determine the maximum of R (m (n for n with greedy expansion of fixed length k, i.e. for F (m k ≤ n

The Social and Political Consequences of Another Stateless Generation in the Middle East

Science.gov (United States)

2016-05-26

44 James Minahan, Nations Without States: A Historical Dictionary of Contemporary National Movements (Westport, CT...refugee camp on the outskirts of Damascus in Syria, was home to 160,000 Palestinians. Prior to the start of the conflict, it was a “thriving pocket ...Modern Terrorism. New York: Cambridge University Press, 2013. Minahan, James. Nations Without States: A Historical Dictionary of Contemporary National

Design of a stateless low-latency router architecture for green software-defined networking

DEFF Research Database (Denmark)

Saldaña Cercos, Silvia; Ramos, Ramon M.; Eller, Ana C. Ewald

2015-01-01

Expanding software defined networking (SDN) to transport networks requires new strategies to deal with the large number of flows that future core networks will have to face. New south-bound protocols within SDN have been proposed to benefit from having control plane detached from the data plane...... offering a cost- and energy-efficient forwarding engine. This paper presents an overview of a new approach named KeyFlow to simultaneously reduce latency, jitter, and power consumption in core network nodes. Results on an emulation platform indicate that round trip time (RTT) can be reduced above 50...

Design of a stateless low-latency router architecture for green software-defined networking

Science.gov (United States)

Saldaña Cercós, Silvia; Ramos, Ramon M.; Ewald Eller, Ana C.; Martinello, Magnos; Ribeiro, Moisés. R. N.; Manolova Fagertun, Anna; Tafur Monroy, Idelfonso

2015-01-01

Expanding software defined networking (SDN) to transport networks requires new strategies to deal with the large number of flows that future core networks will have to face. New south-bound protocols within SDN have been proposed to benefit from having control plane detached from the data plane offering a cost- and energy-efficient forwarding engine. This paper presents an overview of a new approach named KeyFlow to simultaneously reduce latency, jitter, and power consumption in core network nodes. Results on an emulation platform indicate that round trip time (RTT) can be reduced above 50% compared to the reference protocol OpenFlow, specially when flow tables are densely populated. Jitter reduction has been demonstrated experimentally on a NetFPGA-based platform, and 57.3% power consumption reduction has been achieved.

On the Major Dramatic Conftict of Shakespeare's the Merchant of Venice

Institute of Scientific and Technical Information of China (English)

蒋文

2000-01-01

"The Merchant of Venice", a master piece with humanist idea by William Shakespeare, presents readers a dramatic conflict between friendship and greediness, love and cruelty.This essay illustrates briefly how this conflict is created, developed and dramatized. At the same time, the root causes for this conflict is analysed.

The limits of automatic summarisation according to ROUGE

DEFF Research Database (Denmark)

Schluter, Natalie

2017-01-01

This paper discusses some central caveats of summarisation, incurred in the use of the ROUGE metric for evaluation, with respect to optimal solutions. The task is NPhard, of which we give the first proof. Still, as we show empirically for three central benchmark datasets for the task, greedy algo...

Stateful load balancing for parallel stream processing

DEFF Research Database (Denmark)

Guo, Qingsong; Zhou, Yongluan

2018-01-01

-objective optimization problem, namely Minimum-Cost-Load-Balance (MCLB). We address MCLB with two approximate algorithms by a certain relaxation of the objectives: (1) a greedy algorithm ELB performs load balancing eagerly but relaxes the objective of load imbalance to a range; and (2) a periodic algorithm CLB aims...

The Inventor-Investor Conundrum

Science.gov (United States)

Hobbs, Francis

2006-01-01

The complexities of developing a business based on a novel product may appear insurmountable. Stereotypical convention suggests that there are two major players: polarized inventors and "greedy" investors. Surely there is a way of aligning the inventor-investor relationship into something positive for both parties? In this paper Francis…

State-set branching

DEFF Research Database (Denmark)

Jensen, Rune Møller; Veloso, Manuela M.; Bryant, Randal E.

2008-01-01

In this article, we present a framework called state-set branching that combines symbolic search based on reduced ordered Binary Decision Diagrams (BDDs) with best-first search, such as A* and greedy best-first search. The framework relies on an extension of these algorithms from expanding a sing...

Graph coarsening and clustering on the GPU

NARCIS (Netherlands)

Fagginger Auer, B.O.; Bisseling, R.H.

2013-01-01

Agglomerative clustering is an effective greedy way to quickly generate graph clusterings of high modularity in a small amount of time. In an effort to use the power offered by multi-core CPU and GPU hardware to solve the clustering problem, we introduce a fine-grained sharedmemory parallel graph

The triangle scheduling problem

NARCIS (Netherlands)

Dürr, Christoph; Hanzálek, Zdeněk; Konrad, Christian; Seddik, Yasmina; Sitters, R.A.; Vásquez, Óscar C.; Woeginger, Gerhard

2017-01-01

This paper introduces a novel scheduling problem, where jobs occupy a triangular shape on the time line. This problem is motivated by scheduling jobs with different criticality levels. A measure is introduced, namely the binary tree ratio. It is shown that the Greedy algorithm solves the problem to

A Metaheuristic Scheduler for Time Division Multiplexed Network-on-Chip

DEFF Research Database (Denmark)

Sørensen, Rasmus Bo; Sparsø, Jens; Pedersen, Mark Ruvald

that this is possible with only negligible impact on the schedule period. We evaluate the scheduler with seven different applications from the MCSL NOC benchmark suite. We observe that the metaheuristics perform better than the greedy solution. In the special case of all-to-all communication with equal bandwidths...

Bit-coded regular expression parsing

DEFF Research Database (Denmark)

Nielsen, Lasse; Henglein, Fritz

2011-01-01

the DFA-based parsing algorithm due to Dub ´e and Feeley to emit the bits of the bit representation without explicitly materializing the parse tree itself. We furthermore show that Frisch and Cardelli’s greedy regular expression parsing algorithm can be straightforwardly modified to produce bit codings...

Behavior of greedy sparse representation algorithms on nested supports

DEFF Research Database (Denmark)

Mailhé, Boris; Sturm, Bob L.; Plumbley, Mark

2013-01-01

is not locally nested: there is a dictionary and supports Γ ⊃ Γ′ such that OMP can recover all signals with support Γ, but not all signals with support Γ′. We also show that the support recovery optimality of OMP is globally nested: if OMP can recover all s-sparse signals, then it can recover all s...

Greedy vs. L1 convex optimization in sparse coding

DEFF Research Database (Denmark)

Ren, Huamin; Pan, Hong; Olsen, Søren Ingvor

2015-01-01

Sparse representation has been applied successfully in many image analysis applications, including abnormal event detection, in which a baseline is to learn a dictionary from the training data and detect anomalies from its sparse codes. During this procedure, sparse codes which can be achieved...... solutions. Considering the property of abnormal event detection, i.e., only normal videos are used as training data due to practical reasons, effective codes in classification application may not perform well in abnormality detection. Therefore, we compare the sparse codes and comprehensively evaluate...... their performance from various aspects to better understand their applicability, including computation time, reconstruction error, sparsity, detection...

Information-optimal genome assembly via sparse read-overlap graphs.

Science.gov (United States)

Shomorony, Ilan; Kim, Samuel H; Courtade, Thomas A; Tse, David N C

2016-09-01

In the context of third-generation long-read sequencing technologies, read-overlap-based approaches are expected to play a central role in the assembly step. A fundamental challenge in assembling from a read-overlap graph is that the true sequence corresponds to a Hamiltonian path on the graph, and, under most formulations, the assembly problem becomes NP-hard, restricting practical approaches to heuristics. In this work, we avoid this seemingly fundamental barrier by first setting the computational complexity issue aside, and seeking an algorithm that targets information limits In particular, we consider a basic feasibility question: when does the set of reads contain enough information to allow unambiguous reconstruction of the true sequence? Based on insights from this information feasibility question, we present an algorithm-the Not-So-Greedy algorithm-to construct a sparse read-overlap graph. Unlike most other assembly algorithms, Not-So-Greedy comes with a performance guarantee: whenever information feasibility conditions are satisfied, the algorithm reduces the assembly problem to an Eulerian path problem on the resulting graph, and can thus be solved in linear time. In practice, this theoretical guarantee translates into assemblies of higher quality. Evaluations on both simulated reads from real genomes and a PacBio Escherichia coli K12 dataset demonstrate that Not-So-Greedy compares favorably with standard string graph approaches in terms of accuracy of the resulting read-overlap graph and contig N50. Available at github.com/samhykim/nsg courtade@eecs.berkeley.edu or dntse@stanford.edu Supplementary data are available at Bioinformatics online. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Benchmarking Distance Control and Virtual Drilling for Lateral Skull Base Surgery.

Science.gov (United States)

Voormolen, Eduard H J; Diederen, Sander; van Stralen, Marijn; Woerdeman, Peter A; Noordmans, Herke Jan; Viergever, Max A; Regli, Luca; Robe, Pierre A; Berkelbach van der Sprenkel, Jan Willem

2018-01-01

Novel audiovisual feedback methods were developed to improve image guidance during skull base surgery by providing audiovisual warnings when the drill tip enters a protective perimeter set at a distance around anatomic structures ("distance control") and visualizing bone drilling ("virtual drilling"). To benchmark the drill damage risk reduction provided by distance control, to quantify the accuracy of virtual drilling, and to investigate whether the proposed feedback methods are clinically feasible. In a simulated surgical scenario using human cadavers, 12 unexperienced users (medical students) drilled 12 mastoidectomies. Users were divided into a control group using standard image guidance and 3 groups using distance control with protective perimeters of 1, 2, or 3 mm. Damage to critical structures (sigmoid sinus, semicircular canals, facial nerve) was assessed. Neurosurgeons performed another 6 mastoidectomy/trans-labyrinthine and retro-labyrinthine approaches. Virtual errors as compared with real postoperative drill cavities were calculated. In a clinical setting, 3 patients received lateral skull base surgery with the proposed feedback methods. Users drilling with distance control protective perimeters of 3 mm did not damage structures, whereas the groups using smaller protective perimeters and the control group injured structures. Virtual drilling maximum cavity underestimations and overestimations were 2.8 ± 0.1 and 3.3 ± 0.4 mm, respectively. Feedback methods functioned properly in the clinical setting. Distance control reduced the risks of drill damage proportional to the protective perimeter distance. Errors in virtual drilling reflect spatial errors of the image guidance system. These feedback methods are clinically feasible. Copyright © 2017 Elsevier Inc. All rights reserved.

Glaucoma Diagnostic Capabilities of Foveal Avascular Zone Parameters Using Optical Coherence Tomography Angiography According to Visual Field Defect Location.

Science.gov (United States)

Kwon, Junki; Choi, Jaewan; Shin, Joong Won; Lee, Jiyun; Kook, Michael S

2017-12-01

To assess the diagnostic ability of foveal avascular zone (FAZ) parameters to discriminate glaucomatous eyes with visual field defects (VFDs) in different locations (central vs. peripheral) from normal eyes. Totally, 125 participants were separated into 3 groups: normal (n=45), glaucoma with peripheral VFD (PVFD, n=45), and glaucoma with central VFD (CVFD, n=35). The FAZ area, perimeter, and circularity and parafoveal vessel density were calculated from optical coherence tomography angiography images. The diagnostic ability of the FAZ parameters and other structural parameters was determined according to glaucomatous VFD location. Associations between the FAZ parameters and central visual function were evaluated. A larger FAZ area and longer FAZ perimeter were observed in the CVFD group than in the PVFD and normal groups. The FAZ area, perimeter, and circularity were better in differentiating glaucomatous eyes with CVFDs from normal eyes [areas under the receiver operating characteristic curves (AUC), 0.78 to 0.88] than in differentiating PVFDs from normal eyes (AUC, 0.51 to 0.64). The FAZ perimeter had a similar AUC value to the circumpapillary retinal nerve fiber layer and macular ganglion cell-inner plexiform layer thickness for differentiating eyes with CVFDs from normal eyes (all P>0.05, the DeLong test). The FAZ area was significantly correlated with central visual function (β=-112.7, P=0.035, multivariate linear regression). The FAZ perimeter had good diagnostic capability in differentiating glaucomatous eyes with CVFDs from normal eyes, and may be a potential diagnostic biomarker for detecting glaucomatous patients with CVFDs.

Network perimeter security building defense in-depth

CERN Document Server

Riggs, Cliff

2003-01-01

PREFACEWho is this Book For?The Path to Network SecurityWho Should Read This Book?MANAGING NETWORK SECURITYThe Big Picture: Security Policies from A to ZAdministrative CountermeasuresPhysical CountermeasuresTechnological CountermeasuresCreating the Security Standards DocumentCreating the Configuration Guide DocumentPulling it All Together: Sample Security Policy CreationProteris Security Standards and ProceduresTHE NETWORK STACK AND SECURITYConnecting the NetworkProtocolsServers and HostsCRYPTOGRAPHY AND VPN TERMINOLOGYKeysCertificatesHashingDigital SignaturesCommon Encryption AlgorithmsSplit

24 CFR 3285.311 - Required perimeter supports.

Science.gov (United States)

2010-04-01

... HOUSING AND URBAN DEVELOPMENT MODEL MANUFACTURED HOME INSTALLATION STANDARDS Foundations § 3285.311... sides of side wall exterior doors (such as entry, patio, and sliding glass doors) and any other side wall openings of 48 inches or greater in width, and under load-bearing porch posts, factory installed...

Dilation volumes of sets of bounded perimeter

DEFF Research Database (Denmark)

Kiderlen, Markus; Rataj, Jan

, this derivative coincides up to sign with the directional derivative of the covariogram of A in direction u. By known results for the covariogram, this derivative can therefore be expressed by the cosine transform of the surface area measure of A. We extend this result to sets Q that are at most countable and use...... it to determine the derivative of the contact distribution function of a stationary random closed set at zero. A variant for uncountable Q is given, too. The proofs are based on approximation of the characteristic function of A by smooth functions of bounded variation and showing corresponding formulas for them....

cyclic π-perimeter hydrocarbon ruthenium complexes bearing ...

Indian Academy of Sciences (India)

on the basis of FT-IR and NMR spectroscopic data as well as by elemental analysis. Molecular structures of ... Experimental ... vent over dichloromethane solution of the cor- responding ... tion filtered to remove ammonium chloride and excess ammonium ...... UV-vis spectra of complexes were acquired in ace- tonitrile and ...

Learning Area and Perimeter with Virtual Manipulatives

Science.gov (United States)

Bouck, Emily; Flanagan, Sara; Bouck, Mary

2015-01-01

Manipulatives are considered a best practice for educating students with disabilities, but little research exists which examines virtual manipulatives as tool for supporting students in mathematics. This project investigated the use of a virtual manipulative through the National Library of Virtual Manipulatives--polynominoes (i.e., tiles)--as a…

De novo clustering methods outperform reference-based methods for assigning 16S rRNA gene sequences to operational taxonomic units

Directory of Open Access Journals (Sweden)

Sarah L. Westcott

2015-12-01

Full Text Available Background. 16S rRNA gene sequences are routinely assigned to operational taxonomic units (OTUs that are then used to analyze complex microbial communities. A number of methods have been employed to carry out the assignment of 16S rRNA gene sequences to OTUs leading to confusion over which method is optimal. A recent study suggested that a clustering method should be selected based on its ability to generate stable OTU assignments that do not change as additional sequences are added to the dataset. In contrast, we contend that the quality of the OTU assignments, the ability of the method to properly represent the distances between the sequences, is more important.Methods. Our analysis implemented six de novo clustering algorithms including the single linkage, complete linkage, average linkage, abundance-based greedy clustering, distance-based greedy clustering, and Swarm and the open and closed-reference methods. Using two previously published datasets we used the Matthew’s Correlation Coefficient (MCC to assess the stability and quality of OTU assignments.Results. The stability of OTU assignments did not reflect the quality of the assignments. Depending on the dataset being analyzed, the average linkage and the distance and abundance-based greedy clustering methods generated OTUs that were more likely to represent the actual distances between sequences than the open and closed-reference methods. We also demonstrated that for the greedy algorithms VSEARCH produced assignments that were comparable to those produced by USEARCH making VSEARCH a viable free and open source alternative to USEARCH. Further interrogation of the reference-based methods indicated that when USEARCH or VSEARCH were used to identify the closest reference, the OTU assignments were sensitive to the order of the reference sequences because the reference sequences can be identical over the region being considered. More troubling was the observation that while both USEARCH and

The use of computer blast simulations to improve blast quality

International Nuclear Information System (INIS)

Favreau, R.F.; Kuzzyk, G.W.; Babulic, P.J.; Morin, R.A.; Tienkamp, N.J.

1987-01-01

An underground research laboratory (URL) has been constructed as part of a comprehensive program to evaluate the concept of nuclear fuel waste disposal in deep crystalline rock formations. Careful blasting methods have been used to minimize damage to the excavation surfaces. This paper reviews the results of the program to develop controlled blasting for the full-face method, comparing the field observed results achieved with the simulated theoretical results. The simulated results indicate how the blasting may damage the excavation surface. Results suggest that the rock around the final wall is stressed more severely by the cushion holes than by the perimeter holes and that bootleg of the rock between the perimeter and cushion rows occurs when the burst-out velocity imparted to it by the explosive loads in the perimeter holes is inadequate

An Analysis of the Motivations of Oregon's Ranchers to Diversify into Agritourism

Science.gov (United States)

Fernanda de Vasconcellos Pêgas; Joanne F. Tynon

2004-01-01

Cattle ranches are unique American cultural icons. Unfortunately, ranching is also associated by some with the exploitation of natural resources and labeled an environmentally destructive activity motivated by greedy and neglectful livestock operators (Jacobs, 1991; Wuerthner, 1990). Some believe that livestock ranching is a major contributor to unsustainable land use...

Using a Card Trick to Teach Discrete Mathematics

Science.gov (United States)

Simonson, Shai; Holm, Tara S.

2003-01-01

We present a card trick that can be used to review or teach a variety of topics in discrete mathematics. We address many subjects, including permutations, combinations, functions, graphs, depth first search, the pigeonhole principle, greedy algorithms, and concepts from number theory. Moreover, the trick motivates the use of computers in…

Large-Scale Dynamic Observation Planning for Unmanned Surface Vessels

Science.gov (United States)

2007-06-01

programming language. In addition, the useful development software NetBeans IDE is free and makes the use of Java very user-friendly. 92...3. We implemented the greedy and 3PAA algorithms in Java using the NetBeans IDE version 5.5. 4. The test datasets were generated in MATLAB. 5

Preliminary dismantling for the decommissioning of nuclear licensed facilities at the CEA Centre in Fontenay aux Roses

International Nuclear Information System (INIS)

Estivie, D.; Bohar, M.P.; Jeanjacques, M.; Binet, C.

2008-01-01

Under the perimeter modification programme for the Nuclear Licensed Facilities (NLFs) of the French Atomic Energy Commission centre at Fontenay aux Roses (CEN-FAR), preliminary dismantling work proved necessary to decommission the buildings outside the nuclear perimeter and create interim storage areas for waste packages. This summary describes the dismantling of Buildings 07, 53 and 91/54, which are the most representative of the preliminary dismantling work. (author)

Forest cover of Champaign County, Illinois in 1993

Science.gov (United States)

Jesus Danilo Chinea; Louis R. Iverson

1997-01-01

The forest cover of Champaign County, in east-central Illinois, was mapped from 1993 aerial photography and entered in a geographical information system database. One hundred and six forest patches cover 3,380 ha. These patches have a mean area of 32 ha, a mean perimeter of 4,851 m, a mean perimeter to area ratio of 237, a fractal dimension of 1.59, and a mean nearest...

Inferring Stop-Locations from WiFi

DEFF Research Database (Denmark)

Wind, David Kofoed; Sapiezynski, Piotr; Furman, Magdalena Anna

2016-01-01

methods are based exclusively on WiFi data. We study two months of WiFi data collected every two minutes by a smartphone, and infer stop-locations in the form of labelled time-intervals. For this purpose, we investigate two algorithms, both of which scale to large datasets: a greedy approach to select...

Teaching with Children's Books: The "Wow" Factor

Science.gov (United States)

Von Drasek, Lisa

2006-01-01

No classroom teacher needs convincing of the benefits of using children's picture books in his or her math program. As Marilyn Burns, the creator and founder of Math Solutions Professional Development, and the author of "The Greedy Triangle" (Scholastic, 1996), says, "Evidence shows that teaching math through children's books motivates children to…

A CORPUS-BASED STYLISTIC ANALYSIS OF SELECTED RADIO ...

African Journals Online (AJOL)

NGOZI

from Pendants of Rhythm: A Selection of Radio Nigeria Network News ... social roles we have to fill in everyday life and where the meaning processes, or discourses .... Antonymy: Some words opposite in meaning are juxtaposed to underscore .... Hyperbole: The ignorant man is greedy and stuffs his mouth with food until his ...

Online evolution for multi-action adversarial games

DEFF Research Database (Denmark)

Justesen, Niels Orsleff; Mahlmann, Tobias; Togelius, Julian

2016-01-01

the combination of atomic actions that make up a single move, with a state evaluation function used for fitness. We implement Online Evolution for the turn-based multi-action game Hero Academy and compare it with a standard Monte Carlo Tree Search implementation as well as two types of greedy algorithms. Online...

Toward a New Trilateral Strategic Security Relationship: United States, Canada, and Mexico

Directory of Open Access Journals (Sweden)

Richard J. Kilroy, Jr.

2010-01-01

Full Text Available The term "perimeter defense" has come back into vogue recently, with regard to security strategies for North America. The United States' concern primarily with the terrorist threat to its homeland subsequent to September 11, 2001 (9/11 is generating this discussion with its immediate neighbors of Mexico and Canada (and to some extent some Caribbean nations—the "third border". The concept is simply that by pushing defenses out to the "perimeter" nations, then security will be enhanced, since the United States visions itself as more vulnerable to international terrorism than its neighbors. However, Canada and Mexico have not been very happy about the perimeter defined by Washington since 9/11. These nations have sought to define the trilateral relationship beyond just discussions of terrorism to include natural disasters and international organized crime as a component of a broader trilateral agenda. Eight years later these three nations continue to look for some convergence of security interests, although there remains a degree of tension and hesitancy towards achieving a "common security agenda" in the Western Hemisphere.This article examines the concept of "perimeter defense" within the context of the new security challenges that the United States, Mexico, and Canada face today. Questions to be addressed in the article include: Do all these nations share the same "threat" perception? Where exactly is the "perimeter?" What security arrangements have been tried in the past? What are the prospects for the future for increased security cooperation? The main focus of this article is at the sub-regional level in North America and whether a new "trilateral" strategic security relationship between the United States, Canada, and Mexico can emerge in North America.

Vision-based algorithms for high-accuracy measurements in an industrial bakery

Science.gov (United States)

Heleno, Paulo; Davies, Roger; Correia, Bento A. B.; Dinis, Joao

2002-02-01

This paper describes the machine vision algorithms developed for VIP3D, a measuring system used in an industrial bakery to monitor the dimensions and weight of loaves of bread (baguettes). The length and perimeter of more than 70 different varieties of baguette are measured with 1-mm accuracy, quickly, reliably and automatically. VIP3D uses a laser triangulation technique to measure the perimeter. The shape of the loaves is approximately cylindrical and the perimeter is defined as the convex hull of a cross-section perpendicular to the baguette axis at mid-length. A camera, mounted obliquely to the measuring plane, captures an image of a laser line projected onto the upper surface of the baguette. Three cameras are used to measure the baguette length, a solution adopted in order to minimize perspective-induced measurement errors. The paper describes in detail the machine vision algorithms developed to perform segmentation of the laser line and subsequent calculation of the perimeter of the baguette. The algorithms used to segment and measure the position of the ends of the baguette, to sub-pixel accuracy, are also described, as are the algorithms used to calibrate the measuring system and compensate for camera-induced image distortion.

Lead Thickness Measurements

International Nuclear Information System (INIS)

Rucinski, R.

1998-01-01

The preshower lead thickness applied to the outside of D-Zero's superconducting solenoid vacuum shell was measured at the time of application. This engineering documents those thickness measurements. The lead was ordered in sheets 0.09375-inch and 0.0625-inch thick. The tolerance on thickness was specified to be +/- 0.003-inch. The sheets all were within that thickness tolerance. The nomenclature for each sheet was designated 1T, 1B, 2T, 2B where the numeral designates it's location in the wrap and 'T' or 'B' is short for 'top' or 'bottom' half of the solenoid. Micrometer measurements were taken at six locations around the perimeter of each sheet. The width,length, and weight of each piece was then measured. Using an assumed pure lead density of 0.40974 lb/in 3 , an average sheet thickness was calculated and compared to the perimeter thickness measurements. In every case, the calculated average thickness was a few mils thinner than the perimeter measurements. The ratio was constant, 0.98. This discrepancy is likely due to the assumed pure lead density. It is not felt that the perimeter is thicker than the center regions. The data suggests that the physical thickness of the sheets is uniform to +/- 0.0015-inch.

A Comparative Classification of Wheat Grains for Artificial Neural Network and Extreme Learning Machine

OpenAIRE

ASLAN, Muhammet Fatih; SABANCI, Kadir; YİĞİT, Enes; KAYABAŞI, Ahmet; TOKTAŞ, Abdurrahim; DUYSAK, Hüseyin

2018-01-01

In this study, classification of two types of wheat grainsinto bread and durum was carried out. The species of wheat grains in thisdataset are bread and durum and these species have equal samples in the datasetas 100 instances. Seven features, including width, height, area, perimeter,roundness, width and perimeter/area were extracted from each wheat grains. Classificationwas separately conducted by Artificial Neural Network (ANN) and Extreme Learning Machine (ELM)artificial intelligence techn...

ScaffoldScaffolder: solving contig orientation via bidirected to directed graph reduction.

Science.gov (United States)

Bodily, Paul M; Fujimoto, M Stanley; Snell, Quinn; Ventura, Dan; Clement, Mark J

2016-01-01

The contig orientation problem, which we formally define as the MAX-DIR problem, has at times been addressed cursorily and at times using various heuristics. In setting forth a linear-time reduction from the MAX-CUT problem to the MAX-DIR problem, we prove the latter is NP-complete. We compare the relative performance of a novel greedy approach with several other heuristic solutions. Our results suggest that our greedy heuristic algorithm not only works well but also outperforms the other algorithms due to the nature of scaffold graphs. Our results also demonstrate a novel method for identifying inverted repeats and inversion variants, both of which contradict the basic single-orientation assumption. Such inversions have previously been noted as being difficult to detect and are directly involved in the genetic mechanisms of several diseases. http://bioresearch.byu.edu/scaffoldscaffolder. paulmbodily@gmail.com Supplementary data are available at Bioinformatics online. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

A Heuristic Task Scheduling Algorithm for Heterogeneous Virtual Clusters

Directory of Open Access Journals (Sweden)

Weiwei Lin

2016-01-01

Full Text Available Cloud computing provides on-demand computing and storage services with high performance and high scalability. However, the rising energy consumption of cloud data centers has become a prominent problem. In this paper, we first introduce an energy-aware framework for task scheduling in virtual clusters. The framework consists of a task resource requirements prediction module, an energy estimate module, and a scheduler with a task buffer. Secondly, based on this framework, we propose a virtual machine power efficiency-aware greedy scheduling algorithm (VPEGS. As a heuristic algorithm, VPEGS estimates task energy by considering factors including task resource demands, VM power efficiency, and server workload before scheduling tasks in a greedy manner. We simulated a heterogeneous VM cluster and conducted experiment to evaluate the effectiveness of VPEGS. Simulation results show that VPEGS effectively reduced total energy consumption by more than 20% without producing large scheduling overheads. With the similar heuristic ideology, it outperformed Min-Min and RASA with respect to energy saving by about 29% and 28%, respectively.

Anti-Romani Terrorism in Europe

Directory of Open Access Journals (Sweden)

Mareš Miroslav

2016-12-01

Full Text Available This article analyzes terrorism against the Roma in Europe. It identifies acts of terrorism in violence that targets the largest stateless nation on the continent and categorizes this terrorism according to current research methods. Focusing on events in both Western and Eastern Europe, the article analyses and compares the most significant terrorist acts against the Roma of recent years. It concludes that anti-Romani terrorism is heterogeneous in terms of tactics, strategies, and ideological justification, yet can usually be subsumed into the broadly conceived category of far-right terrorism. The variety of attacks suggests that terrorist acts are an offshoot of the broad spectrum of anti-Romani activity, and are influenced by contemporary trends in inter-ethnic violence.

La nostalgie des jours heureux contre le vent rude et glacial de l’exil, chez Jorge Semprun

Directory of Open Access Journals (Sweden)

Beatriz Coca Méndez

2013-11-01

Full Text Available Semprun recalled: "my only identity link was my own memory", link also nurtured by his poetic memory, from which it drew the words that give life to his stories. There are also narrative processes that Jorge Semprun used in Adieu, vive clarté…, in order to witness the devastated landscape of his soul: his exile, deportation and life underground. Indeed, for Semprun to cultivate the memory and the testimony is necessary to frame the moral of the resistance in the context of his experiences. In addition, it is through writing that Semprun found freedom and the dignity of human beings. If this was expressed in French this linguistic choice relates to bilingual stateless status which characterizes the author.

Iterating skeletons

DEFF Research Database (Denmark)

Dieterle, Mischa; Horstmeyer, Thomas; Berthold, Jost

2012-01-01

a particular skeleton ad-hoc for repeated execution turns out to be considerably complicated, and raises general questions about introducing state into a stateless parallel computation. In addition, one would strongly prefer an approach which leaves the original skeleton intact, and only uses it as a building...... block inside a bigger structure. In this work, we present a general framework for skeleton iteration and discuss requirements and variations of iteration control and iteration body. Skeleton iteration is expressed by synchronising a parallel iteration body skeleton with a (likewise parallel) state......Skeleton-based programming is an area of increasing relevance with upcoming highly parallel hardware, since it substantially facilitates parallel programming and separates concerns. When parallel algorithms expressed by skeletons involve iterations – applying the same algorithm repeatedly...

Guardians of the Threshold. The Minor Friars as guarantors of social perimeter (13th century Guardiani della soglia. I Frati Minori come garanti del perimetro sociale (XIII secolo

Directory of Open Access Journals (Sweden)

Giacomo Todeschini

2007-12-01

Full Text Available The contribution analyses Minor Friars’ role in pacifying the civitas. Minor Friars’ charisma appeared as an antidote to scandalum and a preliminary to the readmission of the townspeople inside the circuit of the fides. This particular disposition, which was used by Franciscan texts since the beginning to substantiate the fratres’ sanctity, is connected to their capacity to offer themselves as successful civic mediators, even though they were a religious group, then an Order, whose distinguishing feature consisted in their ecclesiological and social inferiority (minoritas. The reasons for such an attitude can be traced back to Minor Friars’ political ability to try out their closeness to the ecclesial and urban power connecting it to the experimentation of the perimeter of the civitas, which was patent even from the location of the first settlements: from the social viewpoint, this experimentation expressed itself in contact with the pauperes, the marginal and the wicked. Thus, Minor Friars became an element of composition of different social poles managing to mediate the relation between fama and infamia, between potentes and pauperes.

Il contributo indaga il ruolo dei Minori nella pacificazione della civitas. Il carisma dei frati minori si presentava come antidoto allo scandalum e premessa alla riammissione della cittadinanza all’interno del circuito della fides. Tale speciale attitudine, che sin dalle origini fu utilizzata dai testi francescani per comprovare la santità dei fratres, viene ricondotta alla loro capacità di proporsi come efficaci mediatori civici pur costituendo un gruppo religioso, poi un Ordine, il cui tratto di identificazione era dato dall’inferiorità ecclesiologica e sociale (minoritas. Le ragioni di un simile atteggiamento vengono

Burnout Conditions for Flow of Boiling Water in Vertical Rod Clusters

Energy Technology Data Exchange (ETDEWEB)

Becker, Kurt M

1962-05-15

This paper deals with a new concept for predicting burnout conditions for forced convection of boiling water in fuel elements of nuclear boiling reactors. The concept states the importance of considering the ratio of heated channel perimeter to total channel perimeter. The perimeter ratio concept was arrived at from an experimental study of burnout conditions in rod clusters consisting of three rods of 13 mm outside diameter and 970 mm heated length. Data were obtained for pressures between{sub 2}. 5 and 10 kg/cm, surface heat fluxes between 50 and 120 W/cm, mass flow rates between 0.03 and 0.33 kg/sec and steam qualities between 0.01 and 0.52. The rod distances for the experiment were 2 mm and 6 mm. The diameter of the channel was 41.3 mm. Additional runs were also performed after introducing unheated displacement rods in the channel. The rod distance in this case was 6 mm. In the ranges investigated the measured burnout steam qualities at the outlet of the channel decreases with increasing heat flux and decreasing pressure. Furthermore it has been found that the influence of rod distance is, in the range investigated, of small significance for engineering purposes. It has also been observed that the present burnout steam quality data for the rod clusters are much lower than those earlier obtained for round ducts. This may be explained physically by means of the perimeter ratio concept. It has also been found that the surface shear-stress distribution around the channel perimeter and especially the position of maximum shear-stress is of great importance for predicting burnout conditions for flow in channels. Finally the new method has helped us to understand and interpret experimental results which earlier may have seemed inconsistent.

Burnout Conditions for Flow of Boiling Water in Vertical Rod Clusters

International Nuclear Information System (INIS)

Becker, Kurt M.

1962-05-01

This paper deals with a new concept for predicting burnout conditions for forced convection of boiling water in fuel elements of nuclear boiling reactors. The concept states the importance of considering the ratio of heated channel perimeter to total channel perimeter. The perimeter ratio concept was arrived at from an experimental study of burnout conditions in rod clusters consisting of three rods of 13 mm outside diameter and 970 mm heated length. Data were obtained for pressures between 2 . 5 and 10 kg/cm, surface heat fluxes between 50 and 120 W/cm, mass flow rates between 0.03 and 0.33 kg/sec and steam qualities between 0.01 and 0.52. The rod distances for the experiment were 2 mm and 6 mm. The diameter of the channel was 41.3 mm. Additional runs were also performed after introducing unheated displacement rods in the channel. The rod distance in this case was 6 mm. In the ranges investigated the measured burnout steam qualities at the outlet of the channel decreases with increasing heat flux and decreasing pressure. Furthermore it has been found that the influence of rod distance is, in the range investigated, of small significance for engineering purposes. It has also been observed that the present burnout steam quality data for the rod clusters are much lower than those earlier obtained for round ducts. This may be explained physically by means of the perimeter ratio concept. It has also been found that the surface shear-stress distribution around the channel perimeter and especially the position of maximum shear-stress is of great importance for predicting burnout conditions for flow in channels. Finally the new method has helped us to understand and interpret experimental results which earlier may have seemed inconsistent

Study of the dam site shape effect on the behaviour of the perimeter joint of arockfill dam having a reinforced concrete face Исследование влияния формы створа на работу периметрального шва каменной плотины с железобетонным экраном

Directory of Open Access Journals (Sweden)

Sainov Mikhail Petrovich

2013-09-01

Full Text Available The article deals with the dam site shape effect produced on values of displacements in the perimeter joint of the 100 m high rockfill dam having a reinforced concrete face. Six alternative options of the dam site were considered: 3 sites having trapezoidal shape and 3 sites having triangular shape. The options also differ in slopes of rock sides (1:2, 1:5, 1:1. Displacements in a perimeter joint were identified based on the analyses of stress-strain states of rockfill dams, completed using the method of contact finite element to model the behaviour of joints. According to the author’s findings, displacements in the perimeter joint occur in three directions: the opening, the outline deflection of the face and the longitudinal displacement of the face. In the course of the modeling process, the perimeter joint opened in all six options, because horizontal displacements of the face (in the direction along the river channel turned to be approximately equal to its settlement. In case of narrow (triangular sites, the maximal opening of the joint occurs on the rock sides. In case of wide sites, opening at low levels increases to a considerable extent; large openings are observed not only on dam sides, but in the river channel, as well. An opening of the perimeter joint means reduction of values of tensile forces on the face. If the perimeter joint opens, the face is free to move in other directions. Deflections may reach large values, especially if the dam site is wide and has steep rock sides. Deflections reach maximum values in the points, where the reinforced concrete face demonstrates its maximum deflection. The studies prove that the width of the dam part in the river channel has the major effect on values of displacements in the perimeter joint.Приведен анализ влияния формы створа на величины перемещений в периметральном шве каменной плотины с �

Experiential learning for education on Earth Sciences

Science.gov (United States)

Marsili, Antonella; D'Addezio, Giuliana; Todaro, Riccardo; Scipilliti, Francesca

2015-04-01

The Laboratorio Divulgazione Scientifica e Attività Museali of the Istituto Nazionale di Geofisica e Vulcanologia (INGV's Laboratory for Outreach and Museum Activities) in Rome, organizes every year intense educational and outreach activities to convey scientific knowledge and to promote research on Earth Science, focusing on volcanic and seismic hazard. Focusing on kids, we designed and implemented the "greedy laboratory for children curious on science (Laboratorio goloso per bambini curiosi di scienza)", to intrigue children from primary schools and to attract their interest by addressing in a fun and unusual way topics regarding the Earth, seismicity and seismic risk. We performed the "greedy laboratory" using experiential teaching, an innovative method envisaging the use and handling commonly used substances. In particular, in the "greedy laboratory" we proposed the use of everyday life's elements, such as food, to engage, entertain and convey in a simple and interesting communication approach notions concerning Earth processes. We proposed the initiative to public during the "European Researchers Night" in Rome, on September 26, 2014. Children attending the "greedy laboratory", guided by researchers and technicians, had the opportunity to become familiar with scientific concepts, such as the composition of the Earth, the Plate tectonics, the earthquake generation, the propagation of seismic waves and their shaking effects on the anthropogenic environment. During the hand-on laboratory, each child used not harmful substances such as honey, chocolate, flour, barley, boiled eggs and biscuits. At the end, we administered a questionnaire rating the proposed activities, first evaluating the level of general satisfaction of the laboratory and then the various activities in which it was divided. This survey supplied our team with feedbacks, revealing some precious hints on appreciation and margins of improvement. We provided a semi-quantitative assessment with a

Designing a fractal antenna of 2400 MHz

International Nuclear Information System (INIS)

Miranda Hamburger, Fabio

2012-01-01

The design of a fractal antenna with 2400 MHz of frequency has been studied. The fractal used is described by Waclaw Spierpi.ski. The initial figure, also known as seed, is divided using equilateral triangles with the aim of obtaining a perimeter similar to a meaningful portion of wave length. The use of λ to establish an ideal perimeter has reduced the radiation resistance. The adequate number of iterations needed to design the antenna is calculated based on λ. (author) [es

Quasi-Maximum-Likelihood Detector Based on Geometrical Diversification Greedy Intensification

OpenAIRE

Nafkha , Amor; Boutillon , Emmanuel; Roland , Christian

2009-01-01

IEEE Transactions On Communications, vol. 57, n°4, pp. 926-929, April 2009.; International audience; The ML detection used in many communication applications reduces down to solving an integer least-squares problem, which minimizes an objective function. If the matrix is not orthogonal, this problem is NP-hard. An exhaustive search over all feasible solutions is thus only applicable when the dimension of the problem is low. In the literature, there are two main available classes of methods. T...

Wettability measurements of irregular shapes with Wilhelmy plate method

Science.gov (United States)

Park, Jaehyung; Pasaogullari, Ugur; Bonville, Leonard

2018-01-01

One of the most accurate methods for measuring the dynamic contact angle of liquids on solid surfaces is the Wilhelmy plate method. This method generally requires the use of rectangular samples having a constant perimeter in the liquid during advancing and receding cycles. A new formulation based on the Wilhelmy force balance equation to determine the contact angle for plate samples with irregular shapes has been developed. This method employs a profile plot obtained from an optical image to determine the perimeter (i.e. wetted length) of the sample as a function of the immersion depth. The raw force data measured by the force tensiometer is manipulated using the profile plot and the Wilhelmy equation to determine the wetting force and consequently advancing and the receding contact angle. This method is verified with both triangular and irregular PTFE samples in water, and measured contact angles are in good agreement with results from conventional regular shaped samples with a constant perimeter.

Metric inequalities for polygons

Directory of Open Access Journals (Sweden)

Adrian Dumitrescu

2013-07-01

Full Text Available Let A1,A2,…,An be the vertices of a polygon with unit perimeter, that is Σi |Ai Ai+1|=1. We derive various tight estimates on the minimum and maximum values of the sum of pairwise distances, and respectively sum of pairwise squared distances among its vertices. In most cases such estimates on these sums in the literature were known only for convex polygons.In the second part, we turn to a problem of Braß  regarding the maximum perimeter of a simplen-gon (n odd contained in a disk of unit radius. The problem was recently solved by Audet et al. 2009, who gave an exact formula. Here we present an alternative simpler proof of this formula. We then examine what happens if the simplicity condition is dropped, and obtain an exact formula for the maximum perimeter in this case as well.

To What Extent Should Public Corporations Be Consolidated? Considering the Effects on Public Deficit and Debt in Spanish Municipalities

Directory of Open Access Journals (Sweden)

Marta de VICENTE LAMA

2018-02-01

Full Text Available The consolidation perimeter of the public sector is the most important line between the micro and macro systems of government accounting. This paper focuses on the public sector boundary and assesses the potential impact on key reported figures – such as the ‘Maastricht’ deficit and debt ratios – that would result from moving public corporations inside the perimeter of the consolidated general government sector, public corporations that currently lie outside the general government sector. After examining 90 Spanish local governments with populations of over 50,000 during the 2010-2012 period, our results show that including public corporations within the general government sector perimeter leads to substantial differences in deficit and debt ratios, and that these differences significantly increase the number of municipalities in violation of fiscal limits imposed by the government. We also find that municipalities’ pre- and post-consolidation debt ratios are significantly different depending on the ruling party’s political ideology.   

Intrusion recognition for optic fiber vibration sensor based on the selective attention mechanism

Science.gov (United States)

Xu, Haiyan; Xie, Yingjuan; Li, Min; Zhang, Zhuo; Zhang, Xuewu

2017-11-01

Distributed fiber-optic vibration sensors receive extensive investigation and play a significant role in the sensor panorama. A fiber optic perimeter detection system based on all-fiber interferometric sensor is proposed, through the back-end analysis, processing and intelligent identification, which can distinguish effects of different intrusion activities. In this paper, an intrusion recognition based on the auditory selective attention mechanism is proposed. Firstly, considering the time-frequency of vibration, the spectrogram is calculated. Secondly, imitating the selective attention mechanism, the color, direction and brightness map of the spectrogram is computed. Based on these maps, the feature matrix is formed after normalization. The system could recognize the intrusion activities occurred along the perimeter sensors. Experiment results show that the proposed method for the perimeter is able to differentiate intrusion signals from ambient noises. What's more, the recognition rate of the system is improved while deduced the false alarm rate, the approach is proved by large practical experiment and project.

Length and coverage of inhibitory decision rules

KAUST Repository

Alsolami, Fawaz

2012-01-01

Authors present algorithms for optimization of inhibitory rules relative to the length and coverage. Inhibitory rules have a relation "attribute ≠ value" on the right-hand side. The considered algorithms are based on extensions of dynamic programming. Paper contains also comparison of length and coverage of inhibitory rules constructed by a greedy algorithm and by the dynamic programming algorithm. © 2012 Springer-Verlag.

The United States Army Battalion Surgeon: Frontline Requirement or Relic of a Bygone Era?

Science.gov (United States)

2009-12-11

Battalion Aid Station BN Battalion BS Battalion Surgeon CBMM Core Battalion Medical Mission DOW Died of Wounds FSO Full Spectrum Operations GMO ...General Medical Officers or GMOs . Young, motivated, and greedy for knowledge, GMOs propelled the field of military medicine forward during...peacetime through analysis, research, and innovation. Their treated populations were small and exceedingly healthy. GMOs had no mission to treat dependents

Combinatorial optimization networks and matroids

CERN Document Server

Lawler, Eugene

2011-01-01

Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics.

Large vehicle portal monitor for perimeter safeguards applications

International Nuclear Information System (INIS)

Caldwell, J.T.; Atwater, H.F.; Bernard, W.; Bieri, J.M.; Shunk, E.R.

1979-01-01

We have developed a class of vehicle portal monitors based on shielded 4π geometry neutron counting. we have derived and experimentally verified an analytical expression relating the detection sensitivity of the neutron tunnel vehicle portal monitor to four design parameters of the system. For a given number of neutron detectors, this design achieves one or more orders of magnitude improvement in nuclear materials detection sensitivity over previous vehicle portal monitors

Dental arch changes associated with rapid maxillary expansion: A retrospective model analysis study

Directory of Open Access Journals (Sweden)

Ivor M D′Souza

2015-01-01

Full Text Available Introduction: Transverse deficiency of the maxilla is a common clinical problem in orthodontics and dentofacial orthopedics. Transverse maxillary deficiency, isolated or associated with other dentofacial deformities, results in esthetic and functional impairment giving rise to several clinical manifestations such as asymmetrical facial growth, positional and functional mandibular deviations, altered dentofacial esthetics, adverse periodontal responses, unstable dental tipping, and other functional problems. Orthopedic maxillary expansion is the preferred treatment approach to increase the maxillary transverse dimension in young patients by splitting of the mid palatal suture. This orthopedic procedure has lately been subject of renewed interest in orthodontic treatment mechanics because of its potential for increasing arch perimeter to alleviate crowding in the maxillary arch without adversely affecting facial profile. Hence, the present investigation was conducted to establish a correlation between transverse expansion and changes in the arch perimeter, arch width and arch length. Methods: For this purpose, 10 subjects (five males, five females were selected who had been treated by rapid maxillary expansion (RME using hyrax rapid palatal expander followed by fixed mechanotherapy (PEA. Pretreatment (T1, postexpansion (T2, and posttreatment (T3 dental models were compared for dental changes brought about by RME treatment and its stability at the end of fixed mechanotherapy. After model measurements were made, the changes between T1-T2, T2-T3 and T1-T3 were determined for each patient. The mean difference between T1-T2, T2-T3 and T1-T3 were compared to assess the effects of RME on dental arch measurements. Results are expressed as mean ± standard deviation and are compared by repeated measures analysis of variance followed by a post-hoc test. Arch perimeter changes are correlated with changes in arch widths at the canine, premolar and molar

Ablation characteristics of boding liver according to cool-tip temperature of RFA equipment

Energy Technology Data Exchange (ETDEWEB)

Choi, Young Jae [Dept. of Radiology, Seoul National University Hospital, Seoul (Korea, Republic of); Kim, Jeong Koo [Dept. of Radiological Science, Hanseo University, Seosan (Korea, Republic of)

2015-06-15

This study confirmed the correlation between the change of the cooling water in internal cooling system and the size of the ablation site of bovine liver in RF heat treatment equipment. The bovine liver was resection with 4 x 4 x 4 cm{sup 3} in 2 cm cool-tip and with 6 x 6 x 6 cm{sup 3} in 3 cm cool-tip for the experiments. Area and perimeter of the ablation site for bovine liver were measured by Freehand techniques of MRI. It showed area and perimeter decreased during cool-tip temperature rises 6 and 12 minutes ablation using a 2 cm and 3 cm cool-tip. The correlation of cool-tip temperature and area and perimeter was statistically significant the result are shown (p=.000). The measurements of area and perimeter were more accurate with MRI in actual measurements and MRI for ablation range. The statistical results using Paired sample T-test was also significant (p=.038). The ablation range of bovine liver decreased according as cooling water temperature increases in RF heat treatment equipment for reason of carbonization occurred due to does not accurately pass the RF energy. Therefore, it is considered the effect of RF heat treatment would be increased if the temperature of the cooling water consistently maintain the low temperature in order to reduce the generation of carbide at RF heat treatment and RF energy is delivered accurately.

Ablation characteristics of boding liver according to cool-tip temperature of RFA equipment

International Nuclear Information System (INIS)

Choi, Young Jae; Kim, Jeong Koo

2015-01-01

This study confirmed the correlation between the change of the cooling water in internal cooling system and the size of the ablation site of bovine liver in RF heat treatment equipment. The bovine liver was resection with 4 x 4 x 4 cm"3 in 2 cm cool-tip and with 6 x 6 x 6 cm"3 in 3 cm cool-tip for the experiments. Area and perimeter of the ablation site for bovine liver were measured by Freehand techniques of MRI. It showed area and perimeter decreased during cool-tip temperature rises 6 and 12 minutes ablation using a 2 cm and 3 cm cool-tip. The correlation of cool-tip temperature and area and perimeter was statistically significant the result are shown (p=.000). The measurements of area and perimeter were more accurate with MRI in actual measurements and MRI for ablation range. The statistical results using Paired sample T-test was also significant (p=.038). The ablation range of bovine liver decreased according as cooling water temperature increases in RF heat treatment equipment for reason of carbonization occurred due to does not accurately pass the RF energy. Therefore, it is considered the effect of RF heat treatment would be increased if the temperature of the cooling water consistently maintain the low temperature in order to reduce the generation of carbide at RF heat treatment and RF energy is delivered accurately

Foreign citizens with the right to work in the Republic of Moldova with no status of immigrant workers who do not fall under the provisions of the Law

Directory of Open Access Journals (Sweden)

Nicolae ROMANDAȘ,

2016-12-01

Full Text Available Among foreigners (foreign citizens or stateless persons, who legally reside on the territory of Republic of Moldova for work purposes, there are several categories of such persons who, in reality benefit of a special legal status being regulated by other legal acts than those regulating labour migration. In the Law of Moldova no. 180 on labour migration, there are identified 12 categories of foreigners who do not fall under this law and therefore cannot be treated as migrant workers. In our paper, we classified these categories of foreigners in four blocks as follows: a based on a particular profession, activity; b according to a profession and a determined period of activity in the Republic of Moldova; c depending on the conditions of the international treaty and d depending on other circumstances.

Russians, Jews, and Poles: Russification and Antisemitism 1881-1914

Directory of Open Access Journals (Sweden)

Theodor R. Weeks

2012-07-01

Full Text Available Relations between Poles and Jews deteriorated significantly in the three decades leading up to World War I. Many reasons for this phenomenon can be given, for example: economic competition, a general atmosphere of acute nationalism, increased migration, perceived threats to traditional forms of life and religion. Exacerbating all of these factors, however, was the fact of Polish statelessness and the extreme sensitivity of Poles to perceived threats to their culture and nation. In particular within the Russian Empire, Poles perceived the very future of their nation at risk. In such circumstances the continued existence of Jewish cultural difference combined with the development of specifically Jewish forms of national awakening (e.g., the Bund and Zionism were understood by many in Polish society as ingratitude and collaboration with the Russian occupier

Algebraic Meta-Theory of Processes with Data

Directory of Open Access Journals (Sweden)

Daniel Gebler

2013-07-01

Full Text Available There exists a rich literature of rule formats guaranteeing different algebraic properties for formalisms with a Structural Operational Semantics. Moreover, there exist a few approaches for automatically deriving axiomatizations characterizing strong bisimilarity of processes. To our knowledge, this literature has never been extended to the setting with data (e.g. to model storage and memory. We show how the rule formats for algebraic properties can be exploited in a generic manner in the setting with data. Moreover, we introduce a new approach for deriving sound and ground-complete axiom schemata for a notion of bisimilarity with data, called stateless bisimilarity, based on intuitive auxiliary function symbols for handling the store component. We do restrict, however, the axiomatization to the setting where the store component is only given in terms of constants.

On Crimes and Punishments in the Utopias of Sixteenth Century

Directory of Open Access Journals (Sweden)

Philippe Oliveira de Almeida

2015-12-01

Full Text Available The goal of this study is to analyse the crimes and punishments in the utopian literature of the sixteenth century. Initialy, it is necessary to desconstruct the idea that utopia is a platonizing archaism. As the political writings of Machiavelli, the utopian literature is an attempt to intervene in legal and social issues of their time. It must also refute the argument that utopia is a disciplinary society, an ancestor of modern totalitarian regimes. Authors such as Morus and Rabelais have become seasoned defenders of the freedoms of civil society against arbitrary interference of State power. But it is also necessary to question the myth that utopia would be a model of stateless community. Morus, Campanella and Shakespeare recognize the importance of criminal sanctions for the preservation of political order.

Influencing Busy People in a Social Network.

Science.gov (United States)

Sarkar, Kaushik; Sundaram, Hari

2016-01-01

We identify influential early adopters in a social network, where individuals are resource constrained, to maximize the spread of multiple, costly behaviors. A solution to this problem is especially important for viral marketing. The problem of maximizing influence in a social network is challenging since it is computationally intractable. We make three contributions. First, we propose a new model of collective behavior that incorporates individual intent, knowledge of neighbors actions and resource constraints. Second, we show that the multiple behavior influence maximization is NP-hard. Furthermore, we show that the problem is submodular, implying the existence of a greedy solution that approximates the optimal solution to within a constant. However, since the greedy algorithm is expensive for large networks, we propose efficient heuristics to identify the influential individuals, including heuristics to assign behaviors to the different early adopters. We test our approach on synthetic and real-world topologies with excellent results. We evaluate the effectiveness under three metrics: unique number of participants, total number of active behaviors and network resource utilization. Our heuristics produce 15-51% increase in expected resource utilization over the naïve approach.

Aveiro method in reproducing kernel Hilbert spaces under complete dictionary

Science.gov (United States)

Mai, Weixiong; Qian, Tao

2017-12-01

Aveiro Method is a sparse representation method in reproducing kernel Hilbert spaces (RKHS) that gives orthogonal projections in linear combinations of reproducing kernels over uniqueness sets. It, however, suffers from determination of uniqueness sets in the underlying RKHS. In fact, in general spaces, uniqueness sets are not easy to be identified, let alone the convergence speed aspect with Aveiro Method. To avoid those difficulties we propose an anew Aveiro Method based on a dictionary and the matching pursuit idea. What we do, in fact, are more: The new Aveiro method will be in relation to the recently proposed, the so called Pre-Orthogonal Greedy Algorithm (P-OGA) involving completion of a given dictionary. The new method is called Aveiro Method Under Complete Dictionary (AMUCD). The complete dictionary consists of all directional derivatives of the underlying reproducing kernels. We show that, under the boundary vanishing condition, bring available for the classical Hardy and Paley-Wiener spaces, the complete dictionary enables an efficient expansion of any given element in the Hilbert space. The proposed method reveals new and advanced aspects in both the Aveiro Method and the greedy algorithm.

Deployment of check-in nodes in complex networks

Science.gov (United States)

Jiang, Zhong-Yuan; Ma, Jian-Feng

2017-01-01

In many real complex networks such as the city road networks and highway networks, vehicles often have to pass through some specially functioned nodes to receive check-in like services such as gas supplement at gas stations. Based on existing network structures, to guarantee every shortest path including at least a check-in node, the location selection of all check-in nodes is very essential and important to make vehicles to easily visit these check-in nodes, and it is still remains an open problem in complex network studies. In this work, we aim to find possible solutions for this problem. We first convert it into a set cover problem which is NP-complete and propose to employ the greedy algorithm to achieve an approximate result. Inspired by heuristic information of network structure, we discuss other four check-in node location deployment methods including high betweenness first (HBF), high degree first (HDF), random and low degree first (LDF). Finally, we compose extensive simulations in classical scale-free networks, random networks and real network models, and the results can well confirm the effectiveness of the greedy algorithm. This work has potential applications into many real networks.

Influencing Busy People in a Social Network

Science.gov (United States)

Sarkar, Kaushik; Sundaram, Hari

2016-01-01

We identify influential early adopters in a social network, where individuals are resource constrained, to maximize the spread of multiple, costly behaviors. A solution to this problem is especially important for viral marketing. The problem of maximizing influence in a social network is challenging since it is computationally intractable. We make three contributions. First, we propose a new model of collective behavior that incorporates individual intent, knowledge of neighbors actions and resource constraints. Second, we show that the multiple behavior influence maximization is NP-hard. Furthermore, we show that the problem is submodular, implying the existence of a greedy solution that approximates the optimal solution to within a constant. However, since the greedy algorithm is expensive for large networks, we propose efficient heuristics to identify the influential individuals, including heuristics to assign behaviors to the different early adopters. We test our approach on synthetic and real-world topologies with excellent results. We evaluate the effectiveness under three metrics: unique number of participants, total number of active behaviors and network resource utilization. Our heuristics produce 15-51% increase in expected resource utilization over the naïve approach. PMID:27711127

Insiders and Insider Threats

DEFF Research Database (Denmark)

Hunker, Jeffrey; Probst, Christian W.

2011-01-01

Threats from the inside of an organization’s perimeters are a significant problem, since it is difficult to distinguish them from benign activity. In this overview article we discuss defining properties of insiders and insider threats. After presenting definitions of these terms, we go on to disc......Threats from the inside of an organization’s perimeters are a significant problem, since it is difficult to distinguish them from benign activity. In this overview article we discuss defining properties of insiders and insider threats. After presenting definitions of these terms, we go...

Distribution of sizes of erased loops for loop-erased random walks

OpenAIRE

Dhar, Deepak; Dhar, Abhishek

1997-01-01

We study the distribution of sizes of erased loops for loop-erased random walks on regular and fractal lattices. We show that for arbitrary graphs the probability $P(l)$ of generating a loop of perimeter $l$ is expressible in terms of the probability $P_{st}(l)$ of forming a loop of perimeter $l$ when a bond is added to a random spanning tree on the same graph by the simple relation $P(l)=P_{st}(l)/l$. On $d$-dimensional hypercubical lattices, $P(l)$ varies as $l^{-\\sigma}$ for large $l$, whe...

Optimal Achievable Encoding for Brain Machine Interface

Science.gov (United States)

2017-12-22

dictionary-based encoding approach to translate a visual image into sequential patterns of electrical stimulation in real time , in a manner that...including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and...networks, and by applying linear decoding to complete recorded populations of retinal ganglion cells for the first time . Third, we developed a greedy

BiCluE - Exact and heuristic algorithms for weighted bi-cluster editing of biomedical data

DEFF Research Database (Denmark)

Sun, Peng; Guo, Jiong; Baumbach, Jan

2013-01-01

to solve the weighted bi-cluster editing problem. It implements (1) an exact algorithm based on fixed-parameter tractability and (2) a polynomial-time greedy heuristics based on solving the hardest part, edge deletions, first. We evaluated its performance on artificial graphs. Afterwards we exemplarily...... problem. BiCluE as well as the supplementary results are available online at http://biclue.mpi-inf.mpg.de webcite....

Scaling Up Coordinate Descent Algorithms for Large ℓ1 Regularization Problems

Energy Technology Data Exchange (ETDEWEB)

Scherrer, Chad; Halappanavar, Mahantesh; Tewari, Ambuj; Haglin, David J.

2012-07-03

We present a generic framework for parallel coordinate descent (CD) algorithms that has as special cases the original sequential algorithms of Cyclic CD and Stochastic CD, as well as the recent parallel Shotgun algorithm of Bradley et al. We introduce two novel parallel algorithms that are also special cases---Thread-Greedy CD and Coloring-Based CD---and give performance measurements for an OpenMP implementation of these.

Multimodal Hierarchical Dirichlet Process-Based Active Perception by a Robot

Directory of Open Access Journals (Sweden)

Tadahiro Taniguchi

2018-05-01

Full Text Available In this paper, we propose an active perception method for recognizing object categories based on the multimodal hierarchical Dirichlet process (MHDP. The MHDP enables a robot to form object categories using multimodal information, e.g., visual, auditory, and haptic information, which can be observed by performing actions on an object. However, performing many actions on a target object requires a long time. In a real-time scenario, i.e., when the time is limited, the robot has to determine the set of actions that is most effective for recognizing a target object. We propose an active perception for MHDP method that uses the information gain (IG maximization criterion and lazy greedy algorithm. We show that the IG maximization criterion is optimal in the sense that the criterion is equivalent to a minimization of the expected Kullback–Leibler divergence between a final recognition state and the recognition state after the next set of actions. However, a straightforward calculation of IG is practically impossible. Therefore, we derive a Monte Carlo approximation method for IG by making use of a property of the MHDP. We also show that the IG has submodular and non-decreasing properties as a set function because of the structure of the graphical model of the MHDP. Therefore, the IG maximization problem is reduced to a submodular maximization problem. This means that greedy and lazy greedy algorithms are effective and have a theoretical justification for their performance. We conducted an experiment using an upper-torso humanoid robot and a second one using synthetic data. The experimental results show that the method enables the robot to select a set of actions that allow it to recognize target objects quickly and accurately. The numerical experiment using the synthetic data shows that the proposed method can work appropriately even when the number of actions is large and a set of target objects involves objects categorized into multiple classes

Environmental monitoring at the Savannah River Plant. Annual report, 1979

International Nuclear Information System (INIS)

Ashley, C.; Zeigler, C.C.; Culp, P.A.; Smith, D.L.

1982-11-01

An extensive surveillance program has been maintained since 1951 to determine the concentrations of radionuclides in a 1200 square mile area in the environs of the plant and the radiation exposure of the population resulting from SRP operations. This document summarizes the 1979 results. The radiation dose at the plant perimeter and the population dose in the region from SRP operations are very small relative to the dose recieved from naturally occurring radiation. The annual average dose in 1979 from atmospheric releases of radioactive materials was 0.71 mrem at the perimeter (1% of natural background). The maximum dose at the plant perimeter was 0.97 mrem. Air and water are the major dispersal media for radioactive emissions. Samples representing most segments of the environment were monitored. Releases of radioactivity from SRP had a very small effect on living plants and animals and were too minute to be detectable, and with a few exceptions, concentrations outside the plant boundary were too low to distinguish from the natural radioactive background and continuing worldwide fallout from nuclear weapons tests. 40 figures, 60 tables. (MF)

Influence of the gate edge on the reverse leakage current of AlGaN/GaN HEMTs

Directory of Open Access Journals (Sweden)

YongHe Chen

2015-09-01

Full Text Available By comparing the Schottky diodes of different area and perimeter, reverse gate leakage current of AlGaN/GaN high mobility transistors (HEMT at gate bias beyond threshold voltage is studied. It is revealed that reverse current consists of area-related and perimeter-related current. An analytical model of electric field calculation is proposed to obtain the average electric field around the gate edge at high revers bias and estimate the effective range of edge leakage current. When the reverse bias increases, the increment of electric field is around the gate edge of a distance of ΔL, and perimeter-related gate edge current keeps increasing. By using the calculated electric field and the temperature-dependent current-voltage measurements, the edge gate leakage current mechanism is found to be Fowler-Nordheim tunneling at gate bias bellows -15V caused by the lateral extended depletion region induced barrier thinning. Effective range of edge current of Schottky diodes is about hundred to several hundred nano-meters, and is different in different shapes of Schottky diodes.

[New visual field testing possibilities (a preliminary report)].

Science.gov (United States)

Erichev, V P; Ermolaev, A P; Antonov, A A; Grigoryan, G L; Kosova, D V

2018-01-01

There are currently no portable mobile perimeters that allow visual field testing outside ophthalmologist's examination rooms. To develop a mobile perimetry technique based on use of a virtual reality headset (VR). The study involved 26 patients (30 eyes) with II-III stage primary open-angle glaucoma (POAG) with compensated IOP. Perimetry was performed for each patient twice - on Humphrey analyzer (test 30-2, 76 points) and employing similar strategy on a perimeter integrated into VR headset (Total Vision, Russia). Visual field testing was performed with an interval from 1 hour to 3 days. The results were comparatively analyzed. Patients tolerated the examination well. Comparative analysis of preliminary perimetry results obtained with both methods showed high degree of identity, so the results were concluded to be comparable. By visually isolating the wearer, VR headset achieves elimination of distractions and stable light conditions for visual field testing. The headset-perimeter is compact, mobile, easily transportable, can be used in the work of visiting medical teams and for examination at home.

Simulation of the measure of the microparticle size distribution in two dimensions

International Nuclear Information System (INIS)

Lameiras, F.S.; Pinheiro, P.

1987-01-01

Different size distributions of plane figures were generated in a computer as a simply connected network. These size distributions were measured by the Saltykov method for two dimensions. The comparison between the generated and measured distributions showed that the Saltkov method tends to measure larger scattering than the real one and to move the maximum of the real distribution to larger diameters. These erros were determined by means of the ratio of the perimeter of the figures per unit area directly measured and the perimeter calculated from the size distribution obtained by using the SaltyKov method. (Author) [pt

Quarterly environmental radiological survey summary: First quarter 1995 100, 200, 300, and 600 Areas

International Nuclear Information System (INIS)

McKinney, S.M.

1995-04-01

This report provides a summary of the radiological surveys performed in support of the operational environmental monitoring program at the Hanford Site. The surveys included in this program consist of inactive waste sites; outdoor radiological control areas; tank farm perimeters and associated diversion boxes, lift stations, and vent stations; perimeters of active or uncovered waste sites such as burial grounds, retention basins, ponds, process trenches, and ditches; and road and rail surfaces. This report provides a summary of the radiological surveys performed during the First Quarter of 1995. The status of corrective actions required from current and past reports are also discussed

Multi-modal Social Networks: A MRF Learning Approach

Science.gov (United States)

2016-06-20

Network forensics: random infection vs spreading epidemic , Proceedings of ACM Sigmetrics. 11-JUN-12, London, UK. : , TOTAL: 4 06/09/2016 Received Paper...Multi-modal Social Networks A MRF Learning Approach The work primarily focused on two lines of research. 1. We propose new greedy algorithms...Box 12211 Research Triangle Park, NC 27709-2211 social networks , learning and inference REPORT DOCUMENTATION PAGE 11. SPONSOR/MONITOR’S REPORT

Multi-Target Tracking via Mixed Integer Optimization

Science.gov (United States)

2016-05-13

an easily interpretable global objective function. Furthermore, we propose a greedy heuristic which quickly finds good solutions. We extend both the... heuristic and the MIO model to scenarios with missed detections and false alarms. Index Terms—optimization; multi-target tracking; data asso- ciation...energy in [14] and then again as a minimization of discrete-continuous energy in [15]. These algorithms aim to more accurately represent the nature of the

A Family of Bipartite |Cardinality Matching Problems Solvable in O(n\\^2) Time

DEFF Research Database (Denmark)

Clausen, Jens; Krarup, J.

1995-01-01

For a given, unweighted bipartite graph G with 2n non isolated vertices, we consider the so called bipartite cardinality matching problem (BCMP) for which the time complexity of the fastest exact algorithm available is O(n/sup 5/2/ ). We devise a greedy algorithm which either finds a perfect...... matching in O(n/sup 2/ ) time or identifies cycle of length 4 in the complement G of G...

Leadership in the African context

OpenAIRE

M. Masango

2002-01-01

The Western world has always viewed the African continent as plagued by corruption; dictatorship; military coups; rebellious leaders; greediness; misuse of power; and incompetent, politically unstable leaders - in effect, suspicious leaders who undermine their own democracies. This paper analyzes African leadership and its impact by concentrating on three historical eras, namely; the African Religious era; the Christian era, and the era of Globalization. These affected African leadership. In ...

Efficient Mobile Client Caching Supporting Transaction Semantics

Directory of Open Access Journals (Sweden)

IlYoung Chung

2000-05-01

Full Text Available In mobile client-server database systems, caching of frequently accessed data is an important technique that will reduce the contention on the narrow bandwidth wireless channel. As the server in mobile environments may not have any information about the state of its clients' cache(stateless server, using broadcasting approach to transmit the updated data lists to numerous concurrent mobile clients is an attractive approach. In this paper, a caching policy is proposed to maintain cache consistency for mobile computers. The proposed protocol adopts asynchronous(non-periodic broadcasting as the cache invalidation scheme, and supports transaction semantics in mobile environments. With the asynchronous broadcasting approach, the proposed protocol can improve the throughput by reducing the abortion of transactions with low communication costs. We study the performance of the protocol by means of simulation experiments.

Scalable and fail-safe deployment of the ATLAS Distributed Data Management system Rucio

Science.gov (United States)

Lassnig, M.; Vigne, R.; Beermann, T.; Barisits, M.; Garonne, V.; Serfon, C.

2015-12-01

This contribution details the deployment of Rucio, the ATLAS Distributed Data Management system. The main complication is that Rucio interacts with a wide variety of external services, and connects globally distributed data centres under different technological and administrative control, at an unprecedented data volume. It is therefore not possible to create a duplicate instance of Rucio for testing or integration. Every software upgrade or configuration change is thus potentially disruptive and requires fail-safe software and automatic error recovery. Rucio uses a three-layer scaling and mitigation strategy based on quasi-realtime monitoring. This strategy mainly employs independent stateless services, automatic failover, and service migration. The technologies used for deployment and mitigation include OpenStack, Puppet, Graphite, HAProxy and Apache. In this contribution, the interplay between these components, their deployment, software mitigation, and the monitoring strategy are discussed.

Automated Testing of Event-Driven Applications

DEFF Research Database (Denmark)

Jensen, Casper Svenning

may be tested by selecting an interesting input (i.e. a sequence of events), and deciding if a failure occurs when the selected input is applied to the event-driven application under test. Automated testing promises to reduce the workload for developers by automatically selecting interesting inputs...... and detect failures. However, it is non-trivial to conduct automated testing of event-driven applications because of, for example, infinite input spaces and the absence of specifications of correct application behavior. In this PhD dissertation, we identify a number of specific challenges when conducting...... automated testing of event-driven applications, and we present novel techniques for solving these challenges. First, we present an algorithm for stateless model-checking of event-driven applications with partial-order reduction, and we show how this algorithm may be used to systematically test web...

Security Concerns and Countermeasures in Network Coding Based Communications Systems

DEFF Research Database (Denmark)

Talooki, Vahid; Bassoli, Riccardo; Roetter, Daniel Enrique Lucani

2015-01-01

key protocol types, namely, state-aware and stateless protocols, specifying the benefits and disadvantages of each one of them. We also present the key security assumptions of network coding (NC) systems as well as a detailed analysis of the security goals and threats, both passive and active......This survey paper shows the state of the art in security mechanisms, where a deep review of the current research and the status of this topic is carried out. We start by introducing network coding and its variety applications in enhancing current traditional networks. In particular, we analyze two....... This paper also presents a detailed taxonomy and a timeline of the different NC security mechanisms and schemes reported in the literature. Current proposed security mechanisms and schemes for NC in the literature are classified later. Finally a timeline of these mechanism and schemes is presented....

Scalable and fail-safe deployment of the ATLAS Distributed Data Management system Rucio

CERN Document Server

Lassnig, Mario; The ATLAS collaboration; Beermann, Thomas Alfons; Barisits, Martin-Stefan; Garonne, Vincent; Serfon, Cedric

2015-01-01

This contribution details the deployment of Rucio, the ATLAS Distributed Data Management system. The main complication is that Rucio interacts with a wide variety of external services, and connects globally distributed data centres under different technological and administrative control, at an unprecedented data volume. It is therefore not possibly to create a duplicate instance of Rucio for testing or integration. Every software upgrade or configuration change is thus potentially disruptive and requires fail-safe software and automatic error recovery. Rucio uses a three-layer scaling and mitigation strategy based on quasi-realtime monitoring. This strategy mainly employs independent stateless services, automatic failover, and service migration. The technologies used for deployment and mitigation include OpenStack, Puppet, Graphite, HAProxy and Apache. In this contribution, the interplay between these component, their deployment, software mitigation, and the monitoring strategy are discussed.

Rethinking Sovereignty. Independence-lite, devolutionmax and national accommodation

Directory of Open Access Journals (Sweden)

Michael Keating

2012-10-01

Full Text Available National self-determination does not necessarily entail independence. Many nationality movements in Europe have historically called for a continued association with the host state. Non-nationalist parties, in turn, have often embraced various forms of devolution. This has opened up a middle ground, in the form of ‘independence-lite’ or ‘devolution max’, which would givenations control of most domestic policy. Proposals on these lines have been put forward in Quebec, Catalonia, the Basque Country and Scotland. These would allow stateless nations to strike distinct social and economic compromises. They would not give them control over the levers of macro-economic policy. They would entail a bilateral relationship with the state. Such proposals have not found favour with state majorities, and recent debates have been characterized by rather traditional assertions of sovereignty at oddswith our interdependent world.

Automated Detection of Client-State Manipulation Vulnerabilities

DEFF Research Database (Denmark)

Møller, Anders; Schwarz, Mathias

2012-01-01

automated tools that can assist the programmers in the application development process by detecting weaknesses. Many vulnerabilities are related to web application code that stores references to application state in the generated HTML documents to work around the statelessness of the HTTP protocol....... In this paper, we show that such client-state manipulation vulnerabilities are amenable to tool supported detection. We present a static analysis for the widely used frameworks Java Servlets, JSP, and Struts. Given a web application archive as input, the analysis identifies occurrences of client state...... and infers the information flow between the client state and the shared application state on the server. This makes it possible to check how client-state manipulation performed by malicious users may affect the shared application state and cause leakage or modifications of sensitive information. The warnings...

A greedy construction heuristic for the liner service network design problem

DEFF Research Database (Denmark)

Brouer, Berit Dangaard

is challenging due to the size of a global liner shipping operation and due to the hub-and-spoke network design, where a high percentage of the total cargo is transshipped. We present the first construction heuristic for large scale instances of the LSN-DP. The heuristic is able to find a solution for a real...

Greedy Sparse Approaches for Homological Coverage in Location Unaware Sensor Networks

Science.gov (United States)

2017-12-08

problems (e.g., coverage hole detection, coverage verification , hole local- ization, and so on; see Section 2 for more details). The sparse coverage...10,17,20–25 2. detection or verification of coverage (i.e., ensuring there is no coverage gap or hole),11,12,26–29 3 Approved for public release...v))) = 0 then Broadcast self as candidate for collapse to neighbors if All neighboring nodes broadcast themselves as non-candidates then v not needed

Channel Asymmetry in Cellular OFDMA-TDD Networks

Directory of Open Access Journals (Sweden)

Agyapong Patrick

2008-01-01

Full Text Available Abstract This paper studies time division duplex- (TDD- specific interference issues in orthogonal frequency division multiple access- (OFDMA- TDD cellular networks arising from various uplink (UL/downlink (DL traffic asymmetries, considering both line-of-sight (LOS and non-LOS (NLOS conditions among base stations (BSs. The study explores aspects both of channel allocation and user scheduling. In particular, a comparison is drawn between the fixed slot allocation (FSA technique and a dynamic channel allocation (DCA technique for different UL/DL loads. For the latter, random time slot opposing (RTSO is assumed due to its simplicity and its low signaling overhead. Both channel allocation techniques do not obviate the need for user scheduling algorithms, therefore, a greedy and a fair scheduling approach are applied to both the RTSO and the FSA. The systems are evaluated based on spectral efficiency, subcarrier utilization, and user outage. The results show that RTSO networks with DL-favored traffic asymmetries outperform FSA networks for all considered metrics and are robust to LOS between BSs. In addition, it is demonstrated that the greedy scheduling algorithm only offers a marginal increase in spectral efficiency as compared to the fair scheduling algorithm, while the latter exhibits up to 20% lower outage.

Continuous grasp algorithm applied to economic dispatch problem of thermal units

Energy Technology Data Exchange (ETDEWEB)

Vianna Neto, Julio Xavier [Pontifical Catholic University of Parana - PUCPR, Curitiba, PR (Brazil). Undergraduate Program at Mechatronics Engineering; Bernert, Diego Luis de Andrade; Coelho, Leandro dos Santos [Pontifical Catholic University of Parana - PUCPR, Curitiba, PR (Brazil). Industrial and Systems Engineering Graduate Program, LAS/PPGEPS], e-mail: leandro.coelho@pucpr.br

2010-07-01

The economic dispatch problem (EDP) is one of the fundamental issues in power systems to obtain benefits with the stability, reliability and security. Its objective is to allocate the power demand among committed generators in the most economical manner, while all physical and operational constraints are satisfied. The cost of power generation, particularly in fossil fuel plants, is very high and economic dispatch helps in saving a significant amount of revenue. Recently, as an alternative to the conventional mathematical approaches, modern heuristic optimization techniques such as simulated annealing, evolutionary algorithms, neural networks, ant colony, and tabu search have been given much attention by many researchers due to their ability to find an almost global optimal solution in EDPs. On other hand, continuous GRASP (C-GRASP) is a stochastic local search meta-heuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints. Like a greedy randomized adaptive search procedure (GRASP), a C-GRASP is a multi-start procedure where a starting solution for local improvement is constructed in a greedy randomized fashion. The C-GRASP algorithm is validated for a test system consisting of fifteen units, test system that takes into account spinning reserve and prohibited operating zones constrains. (author)

Initialization and Restart in Stochastic Local Search: Computing a Most Probable Explanation in Bayesian Networks

Science.gov (United States)

Mengshoel, Ole J.; Wilkins, David C.; Roth, Dan

2010-01-01

For hard computational problems, stochastic local search has proven to be a competitive approach to finding optimal or approximately optimal problem solutions. Two key research questions for stochastic local search algorithms are: Which algorithms are effective for initialization? When should the search process be restarted? In the present work we investigate these research questions in the context of approximate computation of most probable explanations (MPEs) in Bayesian networks (BNs). We introduce a novel approach, based on the Viterbi algorithm, to explanation initialization in BNs. While the Viterbi algorithm works on sequences and trees, our approach works on BNs with arbitrary topologies. We also give a novel formalization of stochastic local search, with focus on initialization and restart, using probability theory and mixture models. Experimentally, we apply our methods to the problem of MPE computation, using a stochastic local search algorithm known as Stochastic Greedy Search. By carefully optimizing both initialization and restart, we reduce the MPE search time for application BNs by several orders of magnitude compared to using uniform at random initialization without restart. On several BNs from applications, the performance of Stochastic Greedy Search is competitive with clique tree clustering, a state-of-the-art exact algorithm used for MPE computation in BNs.

Dispositional greed.

Science.gov (United States)

Seuntjens, Terri G; Zeelenberg, Marcel; van de Ven, Niels; Breugelmans, Seger M

2015-06-01

Greed is an important motive: it is seen as both productive (a source of ambition; the motor of the economy) and destructive (undermining social relationships; the cause of the late 2000s financial crisis). However, relatively little is known about what greed is and does. This article reports on 5 studies that develop and test the 7-item Dispositional Greed Scale (DGS). Study 1 (including 4 separate samples from 2 different countries, total N = 6092) provides evidence for the construct and discriminant validity of the DGS in terms of positive correlations with maximization, self-interest, envy, materialism, and impulsiveness, and negative correlations with self-control and life satisfaction. Study 2 (N = 290) presents further evidence for discriminant validity, finding that the DGS predicts greedy behavioral tendencies over and above materialism. Furthermore, the DGS predicts economic behavior: greedy people allocate more money to themselves in dictator games (Study 3, N = 300) and ultimatum games (Study 4, N = 603), and take more in a resource dilemma (Study 5, N = 305). These findings shed light on what greed is and does, how people differ in greed, and how greed can be measured. In addition, they show the importance of greed in economic behavior and provide directions for future studies. (c) 2015 APA, all rights reserved).

A Robotic Swarm for Spill Finding and Perimeter Formation

National Research Council Canada - National Science Library

Bruemmer, David J; Dudenhoeffer, Donald D; McKay, Mark D; Anderson, Matthew O

2002-01-01

... intelligence as seen in a colony of ants or swarm of bees. A suite of C2 tools, AgentTools, has been developed to enable an operator to inject high-level domain knowledge and guidance into the behavior of the otherwise autonomous robots...

Coeficientes de proporcionalidade nas valvas atrioventriculares: estudo anatômico dos segmentos valvares em indivíduos normais Coefficients of proportions of the atrioventricular valves: an anatomical study of valvar segments of normal individuals

Directory of Open Access Journals (Sweden)

Natália Martins Magacho de Andrade

2005-09-01

Full Text Available OBJETIVO: Descrever as relações anatômicas existentes entre as estruturas das valvas cardíacas, levando em consideração os segmentos dos anéis fibrosos e o volume ventricular esquerdo. MÉTODO: Analisaram-se fotografias digitais de 41 corações oriundos de necropsias feitas pelo Núcleo de Perícias Médico Legais. As fotos foram processadas em software em ambiente MATLAB®, que forneceu as medidas de perímetro e área valvares e o volume ventricular esquerdo. RESULTADOS: A média de idade dos indivíduos necropsiados foi de 33 anos, com 17 anos de desvio-padrão. Testaram-se diversas correlações envolvendo as valvas tricúspide e mitral, sendo encontradas correlações fortemente significativas entre a distância intercomissural (DIt e o perímetro do anel anterior (PA na valva tricúspide (r = 0,72 com pABSTRACT OBJECTIVE: To describe the anatomical relationships that exist between the heart valve structures taking into account the segments of the fibrous annuli and the left ventricular volume METHOD: Digital photographs of 41 hearts from autopsies performed by a coroner's office were analyzed. The photographs were processed using MATLAB® software, which supplies measurements of the valvar perimeter and area and the left ventricular volume. RESULTS: The average age of the corpses studied was 33 years old (standard deviation ± 17 years. Several ratios involving the tricuspid and mitral valves were tested, with strongly significant correlations found between the inter-commissural distance (ItD and the perimeter of the anterior annulus (PA of the tricuspid valve (r = 0.72; p-value < 0.05 and between the inter-commissural distance (ImD and the perimeter of the posterior annulus (PP of the mitral valve (r = 0.63; p-value < 0.05. The proportions between these parameters were PA/ItD = 1.36 ± 0.24 and PP/ImD = 1.38 ± 0.16. CONCLUSION: The proportions between the perimeter of the anterior annulus (tricuspid and the perimeter of the

Sexual dimorphism of the human corpus callosum: Digital morphometric study

Directory of Open Access Journals (Sweden)

Spasojević Goran

2006-01-01

Full Text Available Background/Aim. Changes in the morphology and the size of the corpus callosum, are related to various pathological conditions. An analysis of these changes requires data about sexual dimorphism of the corpus callosum, which we tried to obtain in our study. We also investigated the method of digital morphometry and compared the obtained results with the results of other authors obtained by magnetic resonance imaging or by planimetry. Methods. A morphological research included 34 human brains (cadavers of both sexes − 19 female and 15 male aged 26−72 years. By digital morphometry using an AutoCAD software we performed measurements in the corpus callosum: the length (L, width in the half of its length (WW’, length of its cortical margin (LCM, area and perimeter of the anterior and posterior callosal segments, as well as the area and perimeter of the corpus callosum section area. The investigated parameters were analyzed and compared between the females and males. Results. There was not a statistically significant difference between the males and females in the investigated parameters of the corpus callosum (t test; p > 0.05, including the mean values of the two most important parameters, the surface of its midsagittal section area (males 654.11 mm2; females 677.40 mm2 and of its perimeter (males 19.61 cm; females 19.72 cm. The results obtained by digital morphometry were in the range of the results of other authors obtained by magnetic resonance and by planimetry. However, the value of Pearson coefficient of linear correlation between the section surface area and perimeter of the corpus callosum in the males was highly significant (rxy = 0.6943, p < 0.01, while in the females this value was statistically insignificant. Conclusion. Digital morphometry is accurate method in encephalometric investigations. Our results suggest that the problem of sexual dimorphism of the corpus callosum is very complex, because the identical variables (section

PROPOSAL HOW TO RECONSTRUCT THE ROŠKA MULTI-STOREY

Directory of Open Access Journals (Sweden)

Blaž Vogelnik

2013-01-01

Full Text Available We have known for years that the residential towers on Roška Street are absolutely the most problematic buildings in Ljubljana in terms of their seismic safety. We decided to propose the rehabilitation of these structures in line with a "new philosophy" according to which the building interiors are left unaffected, and all the necessary reinforcements are implemented externally. During rehabilitation works, the building is not deprived of its habitational function. We developed the "nothing within – all without" philosophy back in 1981 for the rehabilitation of a big hotel near Makarska (we also took out a patent for it then. It is also essential to note that, apart from adequate seismic reinforcement, we gain new residential floor areas which generally cover all rehabilitation costs. In the case of the residential towers on Roška Street, we envisaged additional reinforced concrete walls for the entire perimeter of the towers. These walls are "stabilised" with a 3 m wide console slab running all around each floor, thus adding approximately 65 sqm of additional floor area to every apartment, which amounts to a little more than the net apartment floor area. Before setting up the new additional perimeter walls, we place 15 cm of insulation in between which considerably reduces the use of heating energy and eliminates all "thermal bridges". The old perimeter walls are connected to the new ones by Ø 22 mm inox steel treenails (with weak thermal conductivity. Since the existing structures are no longer settling, all of the new perimeter walls will be founded on Jet-Grouted columns.

Combined in-situ and ex-situ bioremediation of petroleum hydrocarbon contaminated soils by closed-loop soil vapor extraction and air injection

International Nuclear Information System (INIS)

Hu, S.S.; Buckler, M.J.

1993-01-01

Treatment and restoration of petroleum hydrocarbon contaminated soils at a bulk petroleum above-ground storage tank (AST) site in Michigan is being conducted through in-situ and ex-situ closed-loop soil vapor extraction (SVE), soil vapor treatment, and treated air injection (AI) processes. The soil vapor extraction process applies a vacuum through the petroleum hydrocarbon affected soils in the ex-situ bio-remediation pile (bio-pile) and along the perimeter of excavated area (in-situ area) to remove the volatile or light petroleum hydrocarbons. This process also draws ambient air into the ex-situ bio-pile and in-situ vadose zone soil along the perimeter of excavated area to enhance biodegradation of light and heavy petroleum hydrocarbons in the soil. The extracted soil vapor is treated using a custom-designed air bio-remediation filter (bio-filter) to degrade the petroleum hydrocarbon compounds in the soil vapor extraction air streams. The treated air is then injected into a flush grade soil bed in the backfill area to perform final polishing of the air stream, and to form a closed-loop air flow with the soil vapor extraction perforated pipes along the perimeter of the excavated area

2-D Fractal Carpet Antenna Design and Performance

Science.gov (United States)

Barton, C. C.; Tebbens, S. F.; Ewing, J. J.; Peterman, D. J.; Rizki, M. M.

2017-12-01

A 2-D fractal carpet antenna uses a fractal (self-similar) pattern to increase its perimeter by iteration and can receive or transmit electromagnetic radiation within its perimeter-bounded surface area. 2-D fractals are shapes that, at their mathematical limit (infinite iterations) have an infinite perimeter bounding a finite surface area. The fractal dimension describes the degree of space filling and lacunarity which quantifies the size and spatial distribution of open space bounded by a fractal shape. A key aspect of fractal antennas lies in iteration (repetition) of a fractal pattern over a range of length scales. Iteration produces fractal antennas that are very compact, wideband and multiband. As the number of iterations increases, the antenna operates at higher and higher frequencies. Manifestly different from traditional antenna designs, a fractal antenna can operate at multiple frequencies simultaneously. We have created a MATLAB code to generate deterministic and stochastic modes of Sierpinski carpet fractal antennas with a range of fractal dimensions between 1 and 2. Variation in fractal dimension, stochasticity, number of iterations, and lacunarities have been computationally tested using COMSOL Multiphysics software to determine their effect on antenna performance

Fractal dimension analysis of malignant and benign endobronchial ultrasound nodes

International Nuclear Information System (INIS)

Fiz, José Antonio; Monte-Moreno, Enrique; Andreo, Felipe; Auteri, Santiago José; Sanz-Santos, José; Serra, Pere; Bonet, Gloria; Castellà, Eva; Manzano, Juan Ruiz

2014-01-01

Endobronchial ultrasonography (EBUS) has been applied as a routine procedure for the diagnostic of hiliar and mediastinal nodes. The authors assessed the relationship between the echographic appearance of mediastinal nodes, based on endobronchial ultrasound images, and the likelihood of malignancy. The images of twelve malignant and eleven benign nodes were evaluated. A previous processing method was applied to improve the quality of the images and to enhance the details. Texture and morphology parameters analyzed were: the image texture of the echographies and a fractal dimension that expressed the relationship between area and perimeter of the structures that appear in the image, and characterizes the convoluted inner structure of the hiliar and mediastinal nodes. Processed images showed that relationship between log perimeter and log area of hilar nodes was lineal (i.e. perimeter vs. area follow a power law). Fractal dimension was lower in the malignant nodes compared with non-malignant nodes (1.47(0.09), 1.53(0.10) mean(SD), Mann–Whitney U test p < 0.05)). Fractal dimension of ultrasonographic images of mediastinal nodes obtained through endobronchial ultrasound differ in malignant nodes from non-malignant. This parameter could differentiate malignat and non-malignat mediastinic and hiliar nodes

Equilibrium states and ground state of two-dimensional fluid foams

International Nuclear Information System (INIS)

Graner, F.; Jiang, Y.; Janiaud, E.; Flament, C.

2001-01-01

We study the equilibrium energies of two-dimensional (2D) noncoarsening fluid foams, which consist of bubbles with fixed areas. The equilibrium states correspond to local minima of the total perimeter. We present a theoretical derivation of energy minima; experiments with ferrofluid foams, which can be either highly distorted, locally relaxed, or globally annealed; and Monte Carlo simulations using the extended large-Q Potts model. For a dry foam with small size variance we develop physical insight and an electrostatic analogy, which enables us to (i) find an approximate value of the global minimum perimeter, accounting for (small) area disorder, the topological distribution, and physical boundary conditions; (ii) conjecture the corresponding pattern and topology: small bubbles sort inward and large bubbles sort outward, topological charges of the same signs ''repel'' while charges of the opposite signs ''attract;'' (iii) define local and global markers to determine directly from an image how far a foam is from its ground state; (iv) conjecture that, in a local perimeter minimum at prescribed topology, the pressure distribution and thus the edge curvature are unique. Some results also apply to 3D foams

Effect of interference of capillary length on evaporation at meniscus

Science.gov (United States)

Soma, Shu; Kunugi, Tomoaki; Yokomine, Takehiko; Kawara, Zensaku

2017-11-01

In this study, the experimental results on the evaporation characteristics of meniscus in various geometrical configurations which enable to vary a perimeter of liquid-vapor interface and a meniscus curvature were obtained, and the main factor in evaporation process was clarified. As the experimental conditions, the perimeter was adjusted from 1mm to 100mm order, and the curvature from the inverse of capillary length, κ( 0.4mm-1) , to about 10mm-1 . Measuring devices for evaporation rate, which consisted of a test section on an electric balance, was set to a reduced pressure environment for making the purified water in the test section evaporate. There is no heater in the test section and system was set to be isolated from outside environment. It was found that the evaporation rate and flux could be organized by the perimeter if the curvature is constant at κ. On the other hand, when the curvature is larger than κ, it was found that the curvature is the dominant factor in the evaporation process. It can be considered that an interference of capillary length is a key to understand these results.

Anisotropic rectangular metric for polygonal surface remeshing

KAUST Repository

Pellenard, Bertrand

2013-06-18

We propose a new method for anisotropic polygonal surface remeshing. Our algorithm takes as input a surface triangle mesh. An anisotropic rectangular metric, defined at each triangle facet of the input mesh, is derived from both a user-specified normal-based tolerance error and the requirement to favor rectangle-shaped polygons. Our algorithm uses a greedy optimization procedure that adds, deletes and relocates generators so as to match two criteria related to partitioning and conformity.

On Coding of Scheduling Information in OFDM

OpenAIRE

Gunnarsson, Fredrik; Moosavi, Reza; Eriksson, Jonas; Larsson, Erik G.; Wiberg, Niklas; Frenger, Pål

2009-01-01

Control signaling strategies for scheduling information in cellular OFDM systems are studied. A single-cell multiuser system model is formulated that provides system capacity estimates accounting for the signaling overhead. Different scheduling granularities are considered, including the one used in the specifications for the 3G Long Term Evolution (LTE). A greedy scheduling method is assumed, where each resource is assigned to the user for which it can support the highest number of bits. The...

Anisotropic rectangular metric for polygonal surface remeshing

KAUST Repository

Pellenard, Bertrand; Morvan, Jean-Marie; Alliez, Pierre

2013-01-01

We propose a new method for anisotropic polygonal surface remeshing. Our algorithm takes as input a surface triangle mesh. An anisotropic rectangular metric, defined at each triangle facet of the input mesh, is derived from both a user-specified normal-based tolerance error and the requirement to favor rectangle-shaped polygons. Our algorithm uses a greedy optimization procedure that adds, deletes and relocates generators so as to match two criteria related to partitioning and conformity.

Puzzles, paradoxes, and problem solving an introduction to mathematical thinking

CERN Document Server

Reba, Marilyn A

2014-01-01

Graphs: Puzzles and Optimization Graphical Representation and Search Greedy Algorithms and Dynamic Programming Shortest Paths, DNA Sequences, and GPS Systems Routing Problems and Optimal Circuits Traveling Salesmen and Optimal Orderings Vertex Colorings and Edge Matchings Logic: Rational Inference and Computer Circuits Inductive and Deductive Arguments Deductive Arguments and Truth-Tables Deductive Arguments and Derivations Deductive Logic and Equivalence Modeling Using Deductive Logic Probability: Predictions and Expectations Probability and Counting Counting and Unordered Outcomes Independen

A hybrid heuristic algorithm for the open-pit-mining operational planning problem.

OpenAIRE

Souza, Marcone Jamilson Freitas; Coelho, Igor Machado; Ribas, Sabir; Santos, Haroldo Gambini; Merschmann, Luiz Henrique de Campos

2010-01-01

This paper deals with the Open-Pit-Mining Operational Planning problem with dynamic truck allocation. The objective is to optimize mineral extraction in the mines by minimizing the number of mining trucks used to meet production goals and quality requirements. According to the literature, this problem is NPhard, so a heuristic strategy is justified. We present a hybrid algorithm that combines characteristics of two metaheuristics: Greedy Randomized Adaptive Search Procedures and General Varia...

Measuring political sentiment on Twitter: factor-optimal design for multinomial inverse regression

OpenAIRE

Taddy, Matt

2012-01-01

This article presents a short case study in text analysis: the scoring of Twitter posts for positive, negative, or neutral sentiment directed towards particular US politicians. The study requires selection of a sub-sample of representative posts for sentiment scoring, a common and costly aspect of sentiment mining. As a general contribution, our application is preceded by a proposed algorithm for maximizing sampling efficiency. In particular, we outline and illustrate greedy selection of docu...

Heuristics for NP-hard optimization problems - simpler is better!?

Directory of Open Access Journals (Sweden)

Žerovnik Janez

2015-11-01

Full Text Available We provide several examples showing that local search, the most basic metaheuristics, may be a very competitive choice for solving computationally hard optimization problems. In addition, generation of starting solutions by greedy heuristics should be at least considered as one of very natural possibilities. In this critical survey, selected examples discussed include the traveling salesman, the resource-constrained project scheduling, the channel assignment, and computation of bounds for the Shannon capacity.

Core shroud corner joints

Science.gov (United States)

Gilmore, Charles B.; Forsyth, David R.

2013-09-10

A core shroud is provided, which includes a number of planar members, a number of unitary corners, and a number of subassemblies each comprising a combination of the planar members and the unitary corners. Each unitary corner comprises a unitary extrusion including a first planar portion and a second planar portion disposed perpendicularly with respect to the first planar portion. At least one of the subassemblies comprises a plurality of the unitary corners disposed side-by-side in an alternating opposing relationship. A plurality of the subassemblies can be combined to form a quarter perimeter segment of the core shroud. Four quarter perimeter segments join together to form the core shroud.

IMPACT OF SMOKING HABITS ON THE STATE OF CHROMATIN AND MORPHOLOGY OF BUCCAL EPITHELIAL CELLS AMONG MEDICAL STUDENTS.

Science.gov (United States)

Volkova, O; Ryabokon, E; Magda, I; Shckorbatov, Y

2017-01-01

The cells of buccal epithelium were investigated in groups of smoking and non-smoking students. Cell samples were collected by scraping with blunt sterile spatula, stained with orcein and photographed. The smoking of cigarettes and hookah induces significant decrease in nuclear and cell perimeter and cell area in cells of buccal epithelium. Smoking of hookah induces, besides, the heterochromatization in cell nuclei and the decrease of nuclear area. The data obtained indicate stress reaction in cells (heterochromatinization) and apoptosis-related changes in cells (decrease of nuclear and cell perimeter and cell area). These data show unfavorable effects of smoking cigarettes and even more harmful effect of hookah smoking.

Comparison of heuristic optimization techniques for the enrichment and gadolinia distribution in BWR fuel lattices and decision analysis

International Nuclear Information System (INIS)

Castillo, Alejandro; Martín-del-Campo, Cecilia; Montes-Tadeo, José-Luis; François, Juan-Luis; Ortiz-Servin, Juan-José; Perusquía-del-Cueto, Raúl

2014-01-01

Highlights: • Different metaheuristic optimization techniques were compared. • The optimal enrichment and gadolinia distribution in a BWR fuel lattice was studied. • A decision making tool based on the Position Vector of Minimum Regret was applied. • Similar results were found for the different optimization techniques. - Abstract: In the present study a comparison of the performance of five heuristic techniques for optimization of combinatorial problems is shown. The techniques are: Ant Colony System, Artificial Neural Networks, Genetic Algorithms, Greedy Search and a hybrid of Path Relinking and Scatter Search. They were applied to obtain an “optimal” enrichment and gadolinia distribution in a fuel lattice of a boiling water reactor. All techniques used the same objective function for qualifying the different distributions created during the optimization process as well as the same initial conditions and restrictions. The parameters included in the objective function are the k-infinite multiplication factor, the maximum local power peaking factor, the average enrichment and the average gadolinia concentration of the lattice. The CASMO-4 code was used to obtain the neutronic parameters. The criteria for qualifying the optimization techniques include also the evaluation of the best lattice with burnup and the number of evaluations of the objective function needed to obtain the best solution. In conclusion all techniques obtain similar results, but there are methods that found better solutions faster than others. A decision analysis tool based on the Position Vector of Minimum Regret was applied to aggregate the criteria in order to rank the solutions according to three functions: neutronic grade at 0 burnup, neutronic grade with burnup and global cost which aggregates the computing time in the decision. According to the results Greedy Search found the best lattice in terms of the neutronic grade at 0 burnup and also with burnup. However, Greedy Search is

Fragments of Nations and Nationalisms: Towards a Typology of the 21st Century Nationalisms

Directory of Open Access Journals (Sweden)

Şahan Savaş KARATAŞLI

2012-01-01

Full Text Available This paper attempts to provide a typology of state-seeking nationalisms of the 21stcentury. We collected data using James Minahan's (2002 Encyclopedia ofStateless Nations and from the major newspaper sources with internationalcoverage using Proquest newspaper database from 2000-2010. Based on thesedata we identified over 300 nations, which demand a state for their own, whichhave a well-defined territory,has a flag of their own and an organization whichdemand independence and/or autonomy. This paper examines 174 of these nationswhich have populations over 1 million. These nations are highly different fromeach other in terms of their level of mobilization level of militancy, organizationalcapacity, demands and grievances. Taking these differences into consideration, weestablished a typology of 21st century state-seeking nationalisms. Our typology,which is inspired by Miroslav Hroch's three phases, is not only descriptive incharacter but also suggests how nationalist movements evolve and transform intime.

Direitos humanos e dignidade política da cidadania em Hannah Arendt

Directory of Open Access Journals (Sweden)

Cesar Augusto Ramos

2011-06-01

Full Text Available This article aims at addressing the issue of human rights and citizenship from the perspective of Hannah Arendt’s political philosophy. Firstly, the article explores the human rights foundational illusion upon the situation of stateless persons and refugees, a situation which leads the author to formulate the concept of citizenship as the right to have rights. Further, it analyses the elements of her political theory, such as: freedom, action, diversity and public space, which, interconnected to each other, allows the creation of a concept of citizenship based on real participation of the citizens in the political organization of a community, in contrast to a merely formal concept of citizenship. Finally, it addresses the system council where citizenship is understood as action experienced in public space, thus favoring the possibility of realization of human rights, exercised as the political dignity of citizens.

Myanmar's Rohingya Refugees in Malaysia: Education and the Way Forward

Directory of Open Access Journals (Sweden)

Hema Letchamanan

2013-10-01

Full Text Available The Rohingya, a persecuted minority, has faced decades of harsh treatment and made stateless by the military government in Myanmar. To escape from this severe repression, most Rohingya flee to Bangladesh, Thailand or Malaysia. In Malaysia, this community has been living invisibly for more than three decades. Just like other refugees, the Rohingya are not allowed to work legally and do not have access to free healthcare and education in this country. Many of these refugee children learn in the learning centres run by the community with the help of UNHCR and local NGOs and in madrasah1 after school hours. Nevertheless there is a huge gap in education for these children, especially for girls and boys over 15 years old. This paper addresses the gap, discusses the teaching and learning provided in the refugee learning centres and the future of these refugee children in Malaysia.

The Work of Inscription: Antenatal Care, Birth Documents, and Shan Migrant Women in Chiang Mai.

Science.gov (United States)

Seo, Bo Kyeong

2017-12-01

For transnational migrant populations, securing birth documents of newly born children has crucial importance in avoiding statelessness for new generations. Drawing on discussions of sovereignty and political subjectivization, I ask how the fact of birth is constituted in the context of transnational migration. Based on ethnographic data collected from an antenatal clinic in Thailand, this article describes how Shan migrant women from Myanmar (also known as Burma) utilize reproductive health services as a way of assuring a safe birth while acquiring identification documents. Paying close attention to technologies of inscription adopted for maternal care and birth registration, I argue that enacting bureaucratic documents offers a chance for migrant women to bridge the interstice between human and citizen. Birth certificates for migrant children, while embodying legal ambiguity and uncertainty, epitomize non-citizen subjects' assertion of their political relationship with the state. © 2016 by the American Anthropological Association.

Scalable and fail-safe deployment of the ATLAS Distributed Data Management system Rucio

CERN Document Server

Lassnig, Mario; The ATLAS collaboration; Barisits, Martin-Stefan; Beermann, Thomas Alfons; Serfon, Cedric; Garonne, Vincent

2015-01-01

This contribution details the deployment of Rucio, the ATLAS Distributed Data Management system. The main complication is that Rucio interacts with a wide variety of external services, and connects globally distributed data centres under different technological and administrative control, at an unprecedented data volume. It is therefore not possibly to create a duplicate instance of Rucio for testing or integration. Every software upgrade or configuration change is thus potentially disruptive and requires fail-safe software and automatic error recovery. Rucio uses a three-layer scaling and mitigation strategy based on quasi-realtime monitoring. This strategy mainly employs independent stateless services, automatic failover, and service migration. The technologies used for deployment and mitigation include OpenStack, Puppet, Graphite, HAProxy, Apache, and nginx. In this contribution, the reasons and design decisions for the deployment, the actual implementation, and an evaluation of all involved services and c...

MeshTree: A Delay optimised Overlay Multicast Tree Building Protocol

OpenAIRE

Tan, Su-Wei; Waters, A. Gill; Crawford, John

2005-01-01

We study decentralised low delay degree-constrained overlay multicast tree construction for single source real-time applications. This optimisation problem is NP-hard even if computed centrally. We identify two problems in traditional distributed solutions, namely the greedy problem and delay-cost trade-off. By offering solutions to these problems, we propose a new self-organising distributed tree building protocol called MeshTree. The main idea is to embed the delivery tree in a degree-bound...

Designing Feature and Data Parallel Stochastic Coordinate Descent Method forMatrix and Tensor Factorization

Science.gov (United States)

2016-05-11

REPORT NUMBER 9. SPONSORING/ MONITORING AGENCY NAME(S) AND ADDRESS(ES) AOARD UNIT 45002 APO AP 96338-5002 10. SPONSOR/MONITOR’S ACRONYM(S) AFRL/AFOSR IOA...orders of magnitude less memory than our competitors . We implemented our methods on MAPREDUCE with two widely-applicable optimization techniques...local disk caching and greedy row assignment. They speeded up our methods up to 98.2x and also the competitors up to 5.9x. 15. SUBJECT TERMS 16

Concurrent bandits and cognitive radio networks

OpenAIRE

Avner, Orly; Mannor, Shie

2014-01-01

We consider the problem of multiple users targeting the arms of a single multi-armed stochastic bandit. The motivation for this problem comes from cognitive radio networks, where selfish users need to coexist without any side communication between them, implicit cooperation or common control. Even the number of users may be unknown and can vary as users join or leave the network. We propose an algorithm that combines an $\\epsilon$-greedy learning rule with a collision avoidance mechanism. We ...

Sensor Selection from Independence Graphs using Submodularity

Science.gov (United States)

2017-02-01

derive near-optimal so- lutions for combinatorial problems. We can select buoys based on target state that significantly improve the probability of...solutions to combinatorial problems. ACKNOWLEDGMENT This work was funded by the U.S. Office of Naval Research, Contract Number N00014-12-G-0078, Delivery...greedy algorithm,” Mathematical Programming, vol. 1, no. 1, pp. 127–136, 1971. [8] G. Calinescu, C. Chekuri, M. Pál, and J. Vondrák, “Maximizing a

An Aircraft Service Staff Rostering using a Hybrid GRASP Algorithm

OpenAIRE

Cho, Vincent; Wu, Gene Pak Kit; Ip, W.H.

2009-01-01

The aircraft ground service company is responsible for carrying out the regular tasks to aircraft maintenace between their arrival at and departure from the airport. This paper presents the application of a hybrid approach based upon greedy randomized adaptive search procedure (GRASP) for rostering technical staff such that they are assigned predefined shift patterns. The rostering of staff is posed as an optimization problem with an aim of minimizing the violations of hard and soft constrain...

Scylla or Charybdis? Historical Reflections on Two Basic Problems of Corporate Governance

OpenAIRE

Naomi R. Lamoreaux

2009-01-01

Shareholders in corporations face two very different types of governance problems: expropriation by controlling shareholders or managers; and expropriation by greedy rulers or, more generally, by the state. The problem is that the more successful investors are in protecting their capital from the grabbing hand of the state, the less they are able to call upon the state to protect it from the grabbing hand of corporate insiders. Conversely, the more investors are able to call upon government t...

Analysis of Block OMP using Block RIP

OpenAIRE

Wang, Jun; Li, Gang; Zhang, Hao; Wang, Xiqin

2011-01-01

Orthogonal matching pursuit (OMP) is a canonical greedy algorithm for sparse signal reconstruction. When the signal of interest is block sparse, i.e., it has nonzero coefficients occurring in clusters, the block version of OMP algorithm (i.e., Block OMP) outperforms the conventional OMP. In this paper, we demonstrate that a new notion of block restricted isometry property (Block RIP), which is less stringent than standard restricted isometry property (RIP), can be used for a very straightforw...

Environmental monitoring in the vicinity of the Savannah River Plant. Annual report, 1977

International Nuclear Information System (INIS)

1977-01-01

The concentration of radioactivity added by the Savannah River Plant operations to the environs during 1977 was, for the most part, too small to be distinguished from natural background radiation and fallout from worldwide nuclear weapon tests. Beta activity in particulate air filters was about two times the 1976 level and was due entirely to global fallout. Tritium oxide in air at the plant perimeter was greater than in air at more distant locations; the average concentration at the plant perimeter (65 pCi/m 3 ) was 0.03% of the Concentration Guide (CG). Tritium, 137 Cs, and 90 Sr were the only radionuclides of plant origin detectable in Savannah River water by routine analyses. None of these had an average concentration exceeding 0.2% of the CG in river water sampled 8 mi downstream from the plant. The tritium concentration in river water immediately downstream of the plant (4.8 pCi/ml, including 0.5 pCi/ml background river contribution) represented the highest CG percentage (0.16) of the three radionuclides measured in river water. Special research programs using ultra-low-level techniques may detect trace quantities of other radionuclides of plant origin. Radioactive materials in river fish also continued very low (0.2 pCi/g 137 Cs maximum). Annual analyses of plant perimeter soil samples 0-5 cm deep) showed deposition of 137 Cs (52 mCi/km 2 ) and 239 Pu (1.2 mCi/km 2 ) within the range normally found in global fallout. 238 Pu in all soil samples was near the sensitivity of the analysis (approximately 0.1 mCi/km 2 ). For 1977, the calculated annual average dose from atmospheric releases of radioactive materials from SRP was 0.8 millirem (mrem) at the plant perimeter

The use of computer blast simulations to improve blast quality

International Nuclear Information System (INIS)

Favreau, R.F.; Kuzyk, G.W.; Babulic, P.J.; Tienkamp, N.J.

1989-01-01

Atomic Energy of Canada Limited is constructing an Underground Research Laboratory (URL) as part of a comprehensive program to evaluate the concept of nuclear fuel waste disposal deep in crystalline rock formations. Careful blasting methods have been used to minimize damage to the excavation surfaces. Good wall quality is desirable in any excavation. In excavations required for nuclear waste disposal, the objective will be to minimize blast-induced fractures which may complicate the sealing requirements necessary to control subsequent movement of groundwater around a sealed disposal vault. The construction of the URL has provided an opportunity for the development of controlled blasting methods, especially for drilling accuracy and optimization of explosive loads in the perimeter and cushion holes. The work has been assisted by the use of blast simulations with the mathematical model Blaspa. This paper reviews the results of a recent project to develop a controlled method of full-face blasting, and compares the observed field results with the results of a blast simulator called Blaspa. Good agreement is found between the two, and the Blaspa results indicate quantitatively how the blasting may induce damage in the final excavation surface. In particular, the rock in the final wall may be stressed more severely by the cushion holes than by the perimeter holes. Bootleg of the rock between the perimeter and cushion rows occurs when the burst-out velocity imparted to it by the explosive loads in the perimeter holes is inadequate. In practice, these findings indicate that quantitative rock stress and rock burst-out velocity criteria can be established to minimize wall damage and bootleg. Thus, blast simulations become an efficient way to design controlled blasting and to optimize quality of the excavation surface

Environmental monitoring in the vicinity of the Savannah River Plant. Annual report for 1978

International Nuclear Information System (INIS)

1979-01-01

The radiation dose at the plant perimeter or the population dose in the region from SRP operations is very small relative to the dose received from naturally occurring radiation. The annual average dose in 1978 from atmospheric releases of radioactive materials from SRP was 0.76 millirem (mrem) at the plant perimeter (approximately 1% of natural background). The maximum dose at the plant perimeter was 1.05 mrems, which is 0.2% of the Department of Energy limit for offsite exposures. The total radiation exposure at the plant perimeter from SRP releases and natural background radiation (98 mrems) was substantially less than the exposure of a person living in Columbia, SC (111 mrems), or Atlanta, GA (124 mrems). These differences are due to variation in natural radiation. The population dose to people living within 80 km (50 mi) of the center of SRP (population: 465,000) was 110 man-rems. During 1978, this same population received a radiation dose of 54,400 man-rems from natural radiation and an additional dose of 47,000 man-rems from medical x rays. An individual consuming river water downstream from SRP would receive a maximum calculated dose of 0.32 mrem. Air and water are the major dispersal media for radioactive emissions. Samples representing most segments of the environment that may conceivably be affected by these emissions were monitored to ensure a safe environment. Releases of radioactivity from SRP had very small effect on living plants and animals and were too minute to be detectable, and with a few exceptions, concentrations outside the plant boundary were too low to distinguish from the natural radioactive background and continuing worldwide fallout from nuclear weapons tests

STEREOLOGICAL STUDIES ON FETAL VASCULAR DEVELOPMENT IN HUMAN PLACENTAL VILLI

Directory of Open Access Journals (Sweden)

Terry M Mayhew

2011-05-01

Full Text Available In human pregnancy, fetal well-being depends on the development of placental villi and the creation and maintenance of fetal microvessels within them. The aim of this study was to define stereological measures of the growth, capillarization and maturation of villi and of fetoplacental angiogenesis and capillary remodelling. Placentas were collected at 12-41 weeks of gestation and assigned to six age groups spanning equal age ranges. Tissue samples were randomised for position and orientation. Overall growth of peripheral (intermediate and terminal villi and their capillaries was evaluated using total volumes, surface areas and lengths. Measures of villous capillarization comprised capillary volume, surface and length densities and capillary:villus surface and length ratios. Size and shape remodelling of villi and capillaries was assessed using mean cross-sectional areas, perimeters and shape coefficients (perimeter2/area. Group comparisons were drawn by analysis of variance. Villous and capillary volumes, surfaces and lengths increased significantly throughout gestation. Villous maturation involved phasic (capillary:villus surface and length ratios or progressive (volume, surface and length densities increases in indices of villous capillarization. It also involved isomorphic thinning (cross-sectional areas and perimeters declined but shape coefficients did not alter. In contrast, growth of capillaries did not involve changes in luminal areas or perimeters. The results show that villous growth and fetal angiogenesis involve increases in overall length rather than calibre and that villous differentiation involves increased capillarization. Although they do not distinguish between increases in the lengths versus numbers of capillary segments, other studies have shown that capillaries switch from branching to non-branching angiogenesis during gestation. Combined with maintenance of capillary calibres, these processes will contribute to the reduced

Development of on-chip multi-imaging flow cytometry for identification of imaging biomarkers of clustered circulating tumor cells.

Directory of Open Access Journals (Sweden)

Hyonchol Kim

Full Text Available An on-chip multi-imaging flow cytometry system has been developed to obtain morphometric parameters of cell clusters such as cell number, perimeter, total cross-sectional area, number of nuclei and size of clusters as "imaging biomarkers", with simultaneous acquisition and analysis of both bright-field (BF and fluorescent (FL images at 200 frames per second (fps; by using this system, we examined the effectiveness of using imaging biomarkers for the identification of clustered circulating tumor cells (CTCs. Sample blood of rats in which a prostate cancer cell line (MAT-LyLu had been pre-implanted was applied to a microchannel on a disposable microchip after staining the nuclei using fluorescent dye for their visualization, and the acquired images were measured and compared with those of healthy rats. In terms of the results, clustered cells having (1 cell area larger than 200 µm2 and (2 nucleus area larger than 90 µm2 were specifically observed in cancer cell-implanted blood, but were not observed in healthy rats. In addition, (3 clusters having more than 3 nuclei were specific for cancer-implanted blood and (4 a ratio between the actual perimeter and the perimeter calculated from the obtained area, which reflects a shape distorted from ideal roundness, of less than 0.90 was specific for all clusters having more than 3 nuclei and was also specific for cancer-implanted blood. The collected clusters larger than 300 µm2 were examined by quantitative gene copy number assay, and were identified as being CTCs. These results indicate the usefulness of the imaging biomarkers for characterizing clusters, and all of the four examined imaging biomarkers-cluster area, nuclei area, nuclei number, and ratio of perimeter-can identify clustered CTCs in blood with the same level of preciseness using multi-imaging cytometry.

Uncontacted Waorani in the Yasuní Biosphere Reserve: Geographical Validation of the Zona Intangible Tagaeri Taromenane (ZITT)

Science.gov (United States)

Pappalardo, Salvatore Eugenio; De Marchi, Massimo; Ferrarese, Francesco

2013-01-01

The Tagaeri Taromenane People are two indigenous groups belonging to the Waorani first nation living in voluntary isolation within the Napo region of the western Amazon rainforest. To protect their territory the Ecuadorean State has declared and geographically defined, by Decrees, the Zona Intangible Tagaeri Taromenane (ZITT). This zone is located within the UNESCO Yasuní Biosphere Reserve (1989), one of the most biodiverse areas in the world. Due to several hydrocarbon reserve exploitation projects running in the area and the advancing of a large-scale deforestation front, the survival of these groups is presently at risk. The general aim was to validate the ZITT boundary using the geographical references included in the Decree 2187 (2007) by analyzing the geomorphological characteristics of the area. Remote sensing data such as Digital Elevation Models (DEM), Landsat imagery, topographic cartography of IGM-Ecuador, and fieldwork geographical data have been integrated and processed by Geographical Information System (GIS). The ZITT presents two levels of geographic inconsistencies. The first dimension is about the serious cartographical weaknesses in the perimeter delimitation related to the impossibility of linking two rivers belonging to different basins while the second deals with the perimeter line not respecting the hydrographic network. The GIS analysis results clearly show that ZITT boundary is cartographically nonsense due to the impossibility of mapping out the perimeter. Furthermore, GIS analysis of anthropological data shows presence of Tagaeri Taromenane clans outside the ZITT perimeter, within oil production areas and in nearby farmer settlements, reflecting the limits of protection policies for non-contacted indigenous territory. The delimitation of the ZITT followed a traditional pattern of geometric boundary not taking into account the nomadic characteristic of Tagaeri Taromenane: it is necessary to adopt geographical approaches to recognize the

Intermediate flow mixing nonsupport grid for BWR fuel assembly

International Nuclear Information System (INIS)

Taleyarkhan, R.P.

1987-01-01

An intermediate flow mixing nonsupport grid is described for use in a nuclear reactor fuel assembly containing an array of elongated fuel rods. The grid comprises: (a) interleaved inner straps arranged in an egg-crate configuration to define inner cell openings for receiving respective ones of the fuel rods. The inner straps have outer terminal end portions; (b) an outer peripheral strap attached to the respective terminal end portions of the inner straps to define perimeter cell openings for receiving other ones of the fuel rods. The inner straps and outer strap together have opposite upstream and downstream sides; (c) a first group of mixing vanes disposed at the downstream side and being attached on portions of the outer strap and on respective portions of the inner straps. Together with the outer strap portions, they define the perimeter cell openings. Each of the mixing vanes of the first group extend generally in a downstream direction and inwardly toward the perimeter cell openings for deflecting coolant flowing; and (d) a second group of mixing vanes disposed at the downstream side and being attached on other portions of the inner straps. Together with the respective portions, they define the inner cell openings. Each of the mixing vanes of the second group extend generally in a downstream direction and inwardly toward the inner cell openings for deflecting coolant flowing therethrough; (e) the mixing vanes of the second group are substantially smaller in size than the mixing vanes of the first group so as to generate substantially less turbulence in the portions of the coolant flowing through the inner cell openings than in the portions of the coolant flowing through the perimeter cell openings

40 CFR 180.501 - Hydroprene; tolerances for residues.

Science.gov (United States)

2010-07-01

... prescribed conditions: (1) Application shall be limited to spot, crack and crevice, perimeter and ultra low..., food service, manufacturing, and processing establishments such as restaurants, cafeterias...

A method for the quantitative metallographic analysis of nuclear fuels (Programme QMA)

International Nuclear Information System (INIS)

Moreno, A.; Sari, C.

1978-01-01

A method is described for the quantitative analysis of features such as voids, cracks, phases, inclusions and grains distributed on random plane sections of fuel materials. An electronic image analyzer, Quantimet, attached to a MM6 Leitz microscope was used to measure size, area, perimeter and shape of features dispersed in a matrix. The apparatus is driven by a computer which calculates the size, area and perimeter distribution, form factors and orientation of the features as well as the inclusion content of the matrix expressed in weight per cent. A computer programme, QMA, executes the spatial correction of the measured two-dimensional sections and delivers the true distribution of feature sizes in a three-dimensional system

Groundwater quality monitoring well installation for waste area grouping 7 and solid waste storage area 1, Oak Ridge, Tennessee

International Nuclear Information System (INIS)

Mortimore, J.A.; Ebers, M.L.

1994-09-01

The purpose of this report is to document the drilling and installation of the groundwater quality monitoring (GQM) wells on the perimeter of Waste Area Grouping (WAG) 7 and at Solid Waste Storage Area (SWSA) 1, which is a part of WAG 1. Installation of GQM wells was required at Oak Ridge National Laboratory (ORNL) for regulatory compliance. Data obtained from these wells will be used to characterize and assess groundwater quality at the perimeter of each WAG in accordance with applicable Department of Energy, state, and Environmental Protection Agency regulatory requirements. The wells in WAG 7 and SWSA 1 were drilled and developed during the period from June 1989 to March 1990

Design of open rectangular and trapezoidal channels

Science.gov (United States)

González, C. P.; Vera, P. E.; Carrillo, G.; García, S.

2018-04-01

In this work, the results of designing open channels in rectangular and trapezoidal form are presented. For the development of the same important aspects were taken as determination of flows by means of formula of the rational method, area of the surface for its implementation, optimal form of the flow to meet the needs of that environment. In the design the parameter of the hydraulic radius expressed in terms of the hydraulic area and wet perimeter was determined, considering that the surface on which the fluid flows is the product of the perimeter of the section and the length of the channel and where shear is generated by the condition of no slippage.

Peripheral refractive correction and automated perimetric profiles.

Science.gov (United States)

Wild, J M; Wood, J M; Crews, S J

1988-06-01

The effect of peripheral refractive error correction on the automated perimetric sensitivity profile was investigated on a sample of 10 clinically normal, experienced observers. Peripheral refractive error was determined at eccentricities of 0 degree, 20 degrees and 40 degrees along the temporal meridian of the right eye using the Canon Autoref R-1, an infra-red automated refractor, under the parametric conditions of the Octopus automated perimeter. Perimetric sensitivity was then undertaken at these eccentricities (stimulus sizes 0 and III) with and without the appropriate peripheral refractive correction using the Octopus 201 automated perimeter. Within the measurement limits of the experimental procedures employed, perimetric sensitivity was not influenced by peripheral refractive correction.

76 FR 25299 - Notice of Petitions by Firms for Determination of Eligibility To Apply for Trade Adjustment...

Science.gov (United States)

2011-05-04

...-Apr-11 The firm manufactures industrial Brookings, SD 57006. and commercial metal machinery parts and... ornamental furniture. They also manufacture freestanding and perimeter store fixtures. [[Page 25300

Extraction automatique des zones irriguées dans la région du Gharb par analyse d’image basée-objets des images Landsat 8

Directory of Open Access Journals (Sweden)

B. E. LAMHAMEDI

2017-05-01

Full Text Available Morocco has made enormous efforts in the irrigation field. However the lack of information regarding the precise location and delimitation of the irrigated areas is increasingly affecting farmers’ monitoring and control. The main objective of this study is to evaluate the contribution of the object-based image analysis approach for automatic extraction of irrigated areas, especially those out of the officials irrigated perimeters. We worked on two Landsat 8 images of the Gharb region. Three methods of classification have been carried out and evaluated according to the object-based approach. For the first two methods, we have created and implemented a series of membership rules, that aim, through various attributes (NDVI and temperature, to discriminate the objects of interest. For the third method, we used the nearest neighbor interpolation to establish a land cover map of the area of study. The results of this study are very promising. The irrigated areas were successfully extracted at 88.5 %. The superposition of the extracted areas with the boundary of the official irrigated perimeter made it possible to detect and locate irrigated areas outside this perimeter in the Gharb region. This will contribute to a better monitoring and control of the irrigation methods and the water consumption of the farmers in this region.

Pervasive surveillance-agent system based on wireless sensor networks: design and deployment

International Nuclear Information System (INIS)

Martínez, José F; Bravo, Sury; García, Ana B; Corredor, Iván; Familiar, Miguel S; López, Lourdes; Hernández, Vicente; Da Silva, Antonio

2010-01-01

Nowadays, proliferation of embedded systems is enhancing the possibilities of gathering information by using wireless sensor networks (WSNs). Flexibility and ease of installation make these kinds of pervasive networks suitable for security and surveillance environments. Moreover, the risk for humans to be exposed to these functions is minimized when using these networks. In this paper, a virtual perimeter surveillance agent, which has been designed to detect any person crossing an invisible barrier around a marked perimeter and send an alarm notification to the security staff, is presented. This agent works in a state of 'low power consumption' until there is a crossing on the perimeter. In our approach, the 'intelligence' of the agent has been distributed by using mobile nodes in order to discern the cause of the event of presence. This feature contributes to saving both processing resources and power consumption since the required code that detects presence is the only system installed. The research work described in this paper illustrates our experience in the development of a surveillance system using WNSs for a practical application as well as its evaluation in real-world deployments. This mechanism plays an important role in providing confidence in ensuring safety to our environment

ROLE OF TAX AND ACCOUNTING MECHANISM IN TAXATION SYSTEM

Directory of Open Access Journals (Sweden)

RISTI LUCIA

2015-07-01

Full Text Available In the present research, we look into the tax issue in its entirety, as fiscal process, so that its ongoing fiscal perimeter process was defined and structured, participants in the fiscal process were nominated, financial flows were projected as well as the accounting information through which the taxation process activities are achieved. Following the tax process perimeter structure projection, we have positioned two main participants, namely: the taxpayers (legal entities and individuals and tax administration of the state and territorial administrative units; financial flows and tax and accounting information within each participant were identified and processed, they were called internal flows and financial flows and tax and accounting information of the participants in fiscal process called external flows. The area liaison in which financial flows and tax accounting information between participants in the tax structure are developed was defined in tax process perimeter structure namely external flows, the area that we have defined using the term interface. We defined this area as interface because following the study there came off as obvious the fact that it constitutes one of the most important structures of the fiscal process by which the tax flows and basic information and communication between participants are achieved; elements that are essential for achieving a good tax act.

CT quantification of central airway in tracheobronchomalacia

Energy Technology Data Exchange (ETDEWEB)

Im, Won Hyeong; Jin, Gong Yong; Han, Young Min; Kim, Eun Young [Dept. of Radiology, Chonbuk National University Hospital, Jeonju (Korea, Republic of)

2016-05-15

To know which factors help to diagnose tracheobronchomalacia (TBM) using CT quantification of central airway. From April 2013 to July 2014, 19 patients (68.0 ± 15.0 years; 6 male, 13 female) were diagnosed as TBM on CT. As case-matching, 38 normal subjects (65.5 ± 21.5 years; 6 male, 13 female) were selected. All 57 subjects underwent CT with end-inspiration and end-expiration. Airway parameters of trachea and both main bronchus were assessed using software (VIDA diagnostic). Airway parameters of TBM patients and normal subjects were compared using the Student t-test. In expiration, both wall perimeter and wall thickness in TBM patients were significantly smaller than normal subjects (wall perimeter: trachea, 43.97 mm vs. 49.04 mm, p = 0.020; right main bronchus, 33.52 mm vs. 42.69 mm, p < 0.001; left main bronchus, 26.76 mm vs. 31.88 mm, p = 0.012; wall thickness: trachea, 1.89 mm vs. 2.22 mm, p = 0.017; right main bronchus, 1.64 mm vs. 1.83 mm, p = 0.021; left main bronchus, 1.61 mm vs. 1.75 mm, p = 0.016). Wall thinning and decreased perimeter of central airway of expiration by CT quantification would be a new diagnostic indicators in TBM.

Heuristics comparison for u-shaped assembly line balancing in the apparel factory

Directory of Open Access Journals (Sweden)

Nuchsara Kriengkorakot

2014-06-01

Full Text Available In recent year, many industries have adopted a Just-in-time (JIT approach to manufacturing. One of the important changes resulting from JIT implementation is the replacement of the traditional straight lines with Ushaped assembly lines. The important characteristic of these new configurations is that multiskilled workers perform various tasks of different stations along the production line. This research is to improve the assembly line balancing in apparel factory in case study of T-shirt style 53287. The efficiency of production line was 55.48%, the factory balanced line with the traditional method in straight line. Then, the u-shaped assembly line balancing problem (UALBP is to be performed instead of straight line. By using the heuristics of Maximum Task Time, Minimum Task Time, Maximum Ranked Positional Weight (RPWmax and Greedy Randomized to determine the optimal solutions related to the number of stations and line efficiency. The results indicate that two heuristics have given the good solution which have produced by the use of Maximum Task Time and Greedy Randomized. The minimum number of stations have reduced from 17 stations to 11 stations in UALB and the line efficiency was increased from 55.48% to 85.75%. The U-line configuration frequently improves the line efficiency and has fewer work stations compared to the traditional lines.

Determining coding CpG islands by identifying regions significant for pattern statistics on Markov chains.

Science.gov (United States)

Singer, Meromit; Engström, Alexander; Schönhuth, Alexander; Pachter, Lior

2011-09-23

Recent experimental and computational work confirms that CpGs can be unmethylated inside coding exons, thereby showing that codons may be subjected to both genomic and epigenomic constraint. It is therefore of interest to identify coding CpG islands (CCGIs) that are regions inside exons enriched for CpGs. The difficulty in identifying such islands is that coding exons exhibit sequence biases determined by codon usage and constraints that must be taken into account. We present a method for finding CCGIs that showcases a novel approach we have developed for identifying regions of interest that are significant (with respect to a Markov chain) for the counts of any pattern. Our method begins with the exact computation of tail probabilities for the number of CpGs in all regions contained in coding exons, and then applies a greedy algorithm for selecting islands from among the regions. We show that the greedy algorithm provably optimizes a biologically motivated criterion for selecting islands while controlling the false discovery rate. We applied this approach to the human genome (hg18) and annotated CpG islands in coding exons. The statistical criterion we apply to evaluating islands reduces the number of false positives in existing annotations, while our approach to defining islands reveals significant numbers of undiscovered CCGIs in coding exons. Many of these appear to be examples of functional epigenetic specialization in coding exons.

Load Balancing Routing with Bounded Stretch

Directory of Open Access Journals (Sweden)

Chen Siyuan

2010-01-01

Full Text Available Routing in wireless networks has been heavily studied in the last decade. Many routing protocols are based on classic shortest path algorithms. However, shortest path-based routing protocols suffer from uneven load distribution in the network, such as crowed center effect where the center nodes have more load than the nodes in the periphery. Aiming to balance the load, we propose a novel routing method, called Circular Sailing Routing (CSR, which can distribute the traffic more evenly in the network. The proposed method first maps the network onto a sphere via a simple stereographic projection, and then the route decision is made by a newly defined "circular distance" on the sphere instead of the Euclidean distance in the plane. We theoretically prove that for a network, the distance traveled by the packets using CSR is no more than a small constant factor of the minimum (the distance of the shortest path. We also extend CSR to a localized version, Localized CSR, by modifying greedy routing without any additional communication overhead. In addition, we investigate how to design CSR routing for 3D networks. For all proposed methods, we conduct extensive simulations to study their performances and compare them with global shortest path routing or greedy routing in 2D and 3D wireless networks.

Cascade phenomenon against subsequent failures in complex networks

Science.gov (United States)

Jiang, Zhong-Yuan; Liu, Zhi-Quan; He, Xuan; Ma, Jian-Feng

2018-06-01

Cascade phenomenon may lead to catastrophic disasters which extremely imperil the network safety or security in various complex systems such as communication networks, power grids, social networks and so on. In some flow-based networks, the load of failed nodes can be redistributed locally to their neighboring nodes to maximally preserve the traffic oscillations or large-scale cascading failures. However, in such local flow redistribution model, a small set of key nodes attacked subsequently can result in network collapse. Then it is a critical problem to effectively find the set of key nodes in the network. To our best knowledge, this work is the first to study this problem comprehensively. We first introduce the extra capacity for every node to put up with flow fluctuations from neighbors, and two extra capacity distributions including degree based distribution and average distribution are employed. Four heuristic key nodes discovering methods including High-Degree-First (HDF), Low-Degree-First (LDF), Random and Greedy Algorithms (GA) are presented. Extensive simulations are realized in both scale-free networks and random networks. The results show that the greedy algorithm can efficiently find the set of key nodes in both scale-free and random networks. Our work studies network robustness against cascading failures from a very novel perspective, and methods and results are very useful for network robustness evaluations and protections.

Energy management in multi-commodity smart energy systems with a greedy approach

NARCIS (Netherlands)

Shi, H.; Blaauwbroek, N.; Nguyen, H.P.; Kamphuis, I.G.

2016-01-01

Along with the development of Smart Energy System (SES), the advancing popularity of hybrid energy appliances, such as micro-combined heat and power (CHP) and electric heaters, requires an overall energy management strategy to optimize the energy using while guaranteeing energy supply for both the

A Greedy Heuristic for a Three-Level Multi-Period Single-Sourcing Problem

NARCIS (Netherlands)

H.E. Romeijn (Edwin); D. Romero Morales (Dolores)

2000-01-01

textabstractIn this paper we consider a model for integrating transportation and inventory decisions in a three-level logistics network consisting of plants, warehouses, and retailers (or customers). Our model includes production and throughout capacity constraints, and minimizes production,

Political Science Careers at Comprehensive Universities: Building Balanced Careers at "Greedy" Institutions

Science.gov (United States)

Hendrickson, Ryan C.; Mueller, Melinda A.; Strand, Jonathan R.

2011-01-01

A considerable amount of research exists about political science careers at community colleges and liberal arts institutions, as well as about training and hiring practices across different types of institutions. However, there is virtually no commentary available on political science careers at comprehensive institutions, where a significant…