Relevant bibliographies by topics / Consecutive ones property

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Consecutive ones property'

Author: Grafiati
Published: 4 June 2021
Last updated: 15 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Consecutive ones property.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Consecutive ones property"

1

Meidanis, João, Oscar Porto, and Guilherme P. Telles. "On the consecutive ones property." Discrete Applied Mathematics 88, no. 1-3 (1998): 325–54. http://dx.doi.org/10.1016/s0166-218x(98)00078-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chauve, Cedric, Ján Maňuch, and Murray Patterson. "On the Gapped Consecutive-Ones Property." Electronic Notes in Discrete Mathematics 34 (August 2009): 121–25. http://dx.doi.org/10.1016/j.endm.2009.07.020.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Annexstein, Fred, and Ram Swaminathan. "On testing consecutive-ones property in parallel." Discrete Applied Mathematics 88, no. 1-3 (1998): 7–28. http://dx.doi.org/10.1016/s0166-218x(98)00064-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ruf, Nikolaus, and Anita Schöbel. "Set covering with almost consecutive ones property." Discrete Optimization 1, no. 2 (2004): 215–28. http://dx.doi.org/10.1016/j.disopt.2004.07.002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Rawitz, Dror, and Shimon (Moni) Shahar. "Partial multicovering and the d-consecutive ones property." Discrete Optimization 8, no. 4 (2011): 555–67. http://dx.doi.org/10.1016/j.disopt.2011.05.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hsu, Wen-Lian. "A Simple Test for the Consecutive Ones Property." Journal of Algorithms 43, no. 1 (2002): 1–16. http://dx.doi.org/10.1006/jagm.2001.1205.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Maňuch, Ján, Murray Patterson, and Cedric Chauve. "Hardness results on the gapped consecutive-ones property problem." Discrete Applied Mathematics 160, no. 18 (2012): 2760–68. http://dx.doi.org/10.1016/j.dam.2012.03.019.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Chen, Lin, and Yaacov Yesha. "Parallel recognition of the consecutive ones property with applications." Journal of Algorithms 12, no. 3 (1991): 375–92. http://dx.doi.org/10.1016/0196-6774(91)90010-v.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Dom, Michael, Jiong Guo, Rolf Niedermeier, and Sebastian Wernicke. "Red-blue covering problems and the consecutive ones property." Journal of Discrete Algorithms 6, no. 3 (2008): 393–407. http://dx.doi.org/10.1016/j.jda.2007.11.002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Narayanaswamy, N. S., and R. Subashini. "A new characterization of matrices with the consecutive ones property." Discrete Applied Mathematics 157, no. 18 (2009): 3721–27. http://dx.doi.org/10.1016/j.dam.2009.08.001.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Consecutive ones property"

1

Dom, Michael. "Recognition, generation, and application of binary matrices with the consecutive ones property." Göttingen Cuvillier, 2009. http://d-nb.info/994011954/04.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Patterson, Murray. "Variants of the Consecutive-Ones Property motivated by the reconstruction of ancestral species." Thesis, University of British Columbia, 2012. http://hdl.handle.net/2429/40128.

Full text
Abstract:
The polynomial-time decidable Consecutive-Ones Property (C1P) of binary matrices, formally introduced in 1965 by Fulkerson and Gross, has since found applications in many areas. In this thesis, we propose and study several variants of this property that are motivated by the reconstruction of ancestral species. We first propose the Gapped C1P, or the (k,delta)-C1P: a binary matrix M has the (k,delta)-C1P for integers k and delta if the columns of M can be permuted such that each row contains at most k blocks of 1's and no two neighboring blocks of 1's are separated by a gap of more than delta 0's. The C1P is equivalent to the (1,0)-C1P. We show that for every bounded and unbounded k ≥ 2, delta ≥ 1, (k,delta)≠ (2,1), deciding the (k,delta)-C1P is NP-complete [Golberg et al., 1995]. We also provide an algorithm for a relevant case of the (2,1)-C1P. We then study the (k,delta)-C1P with a bound d on the maximum number of 1's in any row (the maximum degree) of M. We show that the (d,k,delta)-C1P is polynomial-time decidable when all three parameters are fixed constants. Since fixing d also fixes k (k ≤ d), the only case left to consider is the (d,k,infinity)-C1P (when delta is unbounded). We show that for every d > k ≥ 2, deciding the (d,k,infinity)-C1P is NP-complete. We also study the C1P with Multiplicity (mC1P), introduced by Wittler and Stoye [2010]: a binary matrix M on columns S = {1,..,n} has the mC1P for multiplicity vector m:S→ ℕ if there is a sequence sigma on S such that (i) sigma contains each s ∈ S at most m(s) times, and (ii) for each row r of M, the set of columns that have entry 1 in r form at least one subsequence of sigma. We show that deciding the mC1P, and two restricted variants thereof, are NP-complete, for M having maximum degree 3 (6 for one of the variants), and for m(s) ≤ 2 for all s ∈ S. We also give a tractability result for the mC1P that is motivated by handling telomeres in the reconstruction of ancestral species. Finally, we study the Generalized Cladistic Character Compatibility (GCCC) Problem, a generalization of the Perfect Phylogeny Problem [Semple and Steel, 2003] introduced by Benham et al. [1995]. We use the structure of the PQ-tree [Booth and Leuker, 1976] associated with the C1P to give algorithms for several cases of the GCCC Problem.
APA, Harvard, Vancouver, ISO, and other styles
3

Engelbeen, Céline. "The segmentation problem in radiation therapy." Doctoral thesis, Universite Libre de Bruxelles, 2010. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210107.

Full text
Abstract:
The segmentation problem arises in the elaboration of a radiation therapy plan. After the cancer has been diagnosed and the radiation therapy sessions have been prescribed, the physician has to locate the tumor as well as the organs situated in the radiation field, called the organs at risk. The physician also has to determine the different dosage he wants to deliver in each of them and has to define a lower bound on the dosage for the tumor (which represents the minimum amount of radiation that is needed to have a sufficient control of the tumor) and an upper bound for each organ at risk (which represents the maximum amount of radiation that an organ can receive without damaging). Designing a radiation therapy plan that respects these different bounds of dosage is a complex optimization problem that is usually tackled in three steps. The segmentation problem is one of them.<p><p>Mathematically, the segmentation problem amounts to decomposing a given nonnegative integer matrix A into a nonnegative integer linear combination of some binary matrices. These matrices have to respect the consecutive ones property. In clinical applications several constraints may arise that reduce the set of binary matrices which respect the consecutive ones property that we can use. We study some of them, as the interleaf distance constraint, the interleaf motion constraint, the tongue-and-groove constraint and the minimum separation constraint.<p><p>We consider here different versions of the segmentation problem with different objective functions. Hence we deal with the beam-on time problem in order to minimize the total time during which the patient is irradiated. We study this problem under the interleaf distance and the interleaf motion constraints. We consider as well this last problem under the tongue-and-groove constraint in the binary case. We also take into account the cardinality and the lex-min problem. Finally, we present some results for the approximation problem. <p><p>/Le problème de segmentation intervient lors de l'élaboration d'un plan de radiothérapie. Après que le médecin ait localisé la tumeur ainsi que les organes se situant à proximité de celle-ci, il doit aussi déterminer les différents dosages qui devront être délivrés. Il détermine alors une borne inférieure sur le dosage que doit recevoir la tumeur afin d'en avoir un contrôle satisfaisant, et des bornes supérieures sur les dosages des différents organes situés dans le champ. Afin de respecter au mieux ces bornes, le plan de radiothérapie doit être préparé de manière minutieuse. Nous nous intéressons à l'une des étapes à réaliser lors de la détermination de ce plan: l'étape de segmentation.<p><p>Mathématiquement, cette étape consiste à décomposer une matrice entière et positive donnée en une combinaison positive entière linéaire de certaines matrices binaires. Ces matrices binaires doivent satisfaire la contrainte des uns consécutifs (cette contrainte impose que les uns de ces matrices soient regroupés en un seul bloc sur chaque ligne). Dans les applications cliniques, certaines contraintes supplémentaires peuvent restreindre l'ensemble des matrices binaires ayant les uns consécutifs (matrices 1C) que l'on peut utiliser. Nous en avons étudié certaines d'entre elles comme celle de la contrainte de chariots, la contrainte d'interdiciton de chevauchements, la contrainte tongue-and-groove et la contrainte de séparation minimum.<p><p>Le premier problème auquel nous nous intéressons est de trouver une décomposition de la matrice donnée qui minimise la somme des coefficients des matrices binaires. Nous avons développé des algorithmes polynomiaux qui résolvent ce problème sous la contrainte de chariots et/ou la contrainte d'interdiction de chevauchements. De plus, nous avons pu déterminer que, si la matrice donnée est une matrice binaire, on peut trouver en temps polynomial une telle décomposition sous la contrainte tongue-and-groove.<p><p>Afin de diminuer le temps de la séance de radiothérapie, il peut être désirable de minimiser le nombre de matrices 1C utilisées dans la décomposition (en ayant pris soin de préalablement minimiser la somme des coefficients ou non). Nous faisons une étude de ce problème dans différents cas particuliers (la matrice donnée n'est constituée que d'une colonne, ou d'une ligne, ou la plus grande entrée de celle-ci est bornée par une constante). Nous présentons de nouvelles bornes inférieures sur le nombre de matrices 1C ainsi que de nouvelles heuristiques.<p><p>Finalement, nous terminons par étudier le cas où l'ensemble des matrices 1C ne nous permet pas de décomposer exactement la matrice donnée. Le but est alors de touver une matrice décomposable qui soit aussi proche que possible de la matrice donnée. Après avoir examiné certains cas polynomiaux nous prouvons que le cas général est difficile à approximer avec une erreur additive de O(mn) où m et n représentent les dimensions de la matrice donnée.<br>Doctorat en Sciences<br>info:eu-repo/semantics/nonPublished
APA, Harvard, Vancouver, ISO, and other styles
4

Chung, Hsiao-han, and 鍾曉函. "Improve algorithms for two red-blue hitting set problems with the consecutive ones property." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/88393538636624192971.

Full text
Abstract:
碩士<br>國立中正大學<br>資訊工程所<br>97<br>Covering problems are important in many applications. In this work, we consider two red-blue hitting set problems, which are special covering problems. Assume that given a set of elements S and two collections Cred and Cblue of subsets of S, which are called a red collection and a blue collection respectively. We say that a set A ∈ Cred ∪ Cblue is hit by a subset S′ ⊆ S if A ∩ S′ 6= ∅. The first red-blue hitting set problem, the red-blue hitting set problem (RBHS) asks for a subset S′ ⊆ S such that all sets in the blue collection must be hit by S′, while the number of sets in the red collection hit by S′ has to be minimum. This problem is polynomially solvable when the sets in the blue collection and the red collection have the consecutive ones property. We present a shortest-path-based algorithm for this problem with the consecutive ones property and its time complexity is O(|Cblue||S| + |Cred||S| + |S|2), which improves the previous time bound O(|Cred||Cblue||S|2) by Dom et al. [7]. We also introduce another problem, the min- imum degree hypergraph problem (MDH). Its difference with RBHS, MDH asks for minimizing the number of elements in each set of the red collection hit by S.
APA, Harvard, Vancouver, ISO, and other styles
5

Lu, Wei-Fu, and 呂威甫. "Testing for the Consecutive Ones Property and Interval Graphs on Noisy Data─ Application to Physical Mapping and Sequence Assembly." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/61974029553973019649.

Full text
Abstract:
博士<br>國立交通大學<br>資訊科學系<br>91<br>The consecutive ones property and interval graph are two fundamental mathematical models for physical mapping and clone assembly. A (0,1)-matrix satisfies the consecutive ones property (COP) for the rows if there exists a column permutation such that the ones in each row of the resultant matrix are consecutive. An interval graph is the intersection graph of a collection of intervals. Booth and Lueker (1976) used PQ-trees to test the consecutive ones property and recognize interval graphs in linear time. The linear time algorithm by Booth and Lueker (1976) has a serious drawback: the data must be error-free. However, laboratory work is never flawless. Because a single error might cause map construction to fail, traditional recognition algorithms can hardly be applied on noisy data. Moreover, no straightforward extension of traditional algorithm can overcome the drawbacks. To solve these problems, a different philosophy toward algorithm design is necessary. In this thesis, we opt to maintain a stable local structure of consecutive ones matrices and interval graphs through clustering techniques to deal with errors. We do not set any “global” objective to optimize. Rather, our algorithms try to maintain the local monotone structure, namely, to minimize the deviation from the local monotone property as much as possible. Under moderate assumptions, the algorithm can accommodate the following four types of errors: false negatives, false positives, non-unique probes and chimeric clones. In case some local data is too noisy, our algorithm could likely discover that and suggest additional lab work to reduce the degree of ambiguity in that part. A unique feature of our algorithm is that, rather than forcing all probes or clones to be included and ordered in the final arrangement, our algorithm would delete some noisy information. Thus, it could produce more than one contig. The gaps are created mostly by noisy data.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Consecutive ones property"

1

Tatti, Nikolaj, and Pauli Miettinen. "Boolean matrix factorization meets consecutive ones property." In Proceedings of the 2019 SIAM International Conference on Data Mining. Society for Industrial and Applied Mathematics, 2019. http://dx.doi.org/10.1137/1.9781611975673.82.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Raffinot, Mathieu. "Consecutive Ones Property Testing: Cut or Swap." In Models of Computation in Context. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21875-0_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hsu, Wen-Lian. "A simple test for the consecutive ones property." In Algorithms and Computation. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-56279-6_98.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Dom, Michael, Jiong Guo, Rolf Niedermeier, and Sebastian Wernicke. "Minimum Membership Set Covering and the Consecutive Ones Property." In Algorithm Theory – SWAT 2006. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11785293_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Fortin, Dominique, and Ider Tseveendorj. "Minimizing Sign Changes Rowwise: Consecutive Ones Property and Beyond." In Analysis, Modelling, Optimization, and Numerical Techniques. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-12583-1_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Chauve, Cedric, Ján Maňuch, Murray Patterson, and Roland Wittler. "Tractability Results for the Consecutive-Ones Property with Multiplicity." In Combinatorial Pattern Matching. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21458-5_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Battaglia, Giovanni, Roberto Grossi, and Noemi Scutellà. "Counting the Orderings for Multisets in Consecutive Ones Property and PQ-Trees." In Developments in Language Theory. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22321-1_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Chauve, Cedric, Utz-Uwe Haus, Tamon Stephen, and Vivija P. You. "Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction." In Comparative Genomics. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04744-2_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Narayanaswamy, N. S., and Anju Srinivasan. "Tree Path Labeling of Hypergraphs – A Generalization of the Consecutive Ones Property." In Algorithms and Discrete Applied Mathematics. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-14974-5_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Hsu, Wen-Liar. "On physical mapping algorithms: An error-tolerant test for the consecutive ones property." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0045091.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Consecutive ones property"

1

Vuokko, Niko. "Consecutive ones property and spectral ordering." In Proceedings of the 2010 SIAM International Conference on Data Mining. Society for Industrial and Applied Mathematics, 2010. http://dx.doi.org/10.1137/1.9781611972801.31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Annexstein, F. S., and R. P. Swaminathan. "On testing consecutive-ones property in parallel." In the seventh annual ACM symposium. ACM Press, 1995. http://dx.doi.org/10.1145/215399.215449.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lei, Ting, Michiko Hamada, Adam Donald, and Takeshi Endo. "ROBUST SONIC LOG TRACKING USING A MULTI-RESOLUTION APPROACH." In 2021 SPWLA 62nd Annual Logging Symposium Online. Society of Petrophysicists and Well Log Analysts, 2021. http://dx.doi.org/10.30632/spwla-2021-0102.

Full text
Abstract:
Borehole acoustic logging is an acquisition method that is regarded as the most efficient and reliable method to measure subsurface rock elastic property. It plays an important role in both well construction and reservoir evaluation. The acquisition is carried out downhole by firing a transducer and then collecting waveforms at an array of receivers. A signal processing technique such as the slowness-time-coherence method is used to process array waveform data to resolve slownesses from different arrivals. To label these slowness values, a classification algorithm is then required to first determine if a primary (P) or a secondary (S) arrival exists or not, and then label out the existing ones at each depth of the entire logging interval to deliver continuous compressional and shear slowness logs. Such a process is referred as automatic sonic log tracking process. Clearly, it is of great importance to be able to track log as accurately as possible. Traditional approaches either use predefined slowness or arrival time boundary to distinguish them or treats slowness peaks in consecutive depths like “moving particles” and use a particle tracking algorithm to estimate their trace. However, such a tracking algorithm is often challenged by a sudden change in formation types at bed boundary, fine-scale heterogeneity, downhole logging noise, as well as unpredicted signal loss due to bad borehole shape or gas influx. Consequently, the tracking process is often a tricky task that requires heavy manual quality control and relabeling process, which poses significant bottleneck for a timely delivery of sonic logs for downstream petrophysical and geomechanical applications. In this paper, we propose a new physical based multi-resolution tracking algorithm that can improve the robustness of the tracking process. The new algorithm is inspired by the fact that different resolution sonic logs can sense different rock volumes and therefore response differently to a thin layer or an interval with bad borehole conditions. It works by grouping slowness-time peaks with different resolutions to form clusters, which are then tracked by the connecting with its neighboring depths. As different resolution slownesses are physically constrained by the convolution response of heterogeneous layers, the cluster-based multi-resolution tracking approach exhibits better logging depth continuity than the traditional single-resolution methods. Outliers due to noise can be confidently avoided. Finally, remaining gaps due to shoulder bed boundary can be patched by a convolution constrained optimization process from coherences from different resolutions. This new approach is therefore referred as a multi-resolution approach and can significantly improve sonic log tracking accuracy than the single resolution approach. This new algorithm has been tested on several sonic logging field data and demonstrates robust tracking performance of sonic P&amp;S logs. Additionally, with the multi-resolution processing, sonic logs with different resolution can be reliably obtained and a high-quality high-resolution sonic log can also be automatically delivered, which can then be used to match resolution of other petrophysical logs for various types of interpretation.
APA, Harvard, Vancouver, ISO, and other styles
4

Greenberg, Jason N., and Xiaobo Tan. "Dynamic Prediction-Based Optical Localization of a Robot During Continuous Movement." In ASME 2020 Dynamic Systems and Control Conference. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/dscc2020-3288.

Full text
Abstract:
Abstract Localization of mobile robots is essential for navigation and data collection. This work presents an optical localization scheme for mobile robots during the robot’s continuous movement, despite that only one bearing angle can be captured at a time. In particular, this paper significantly improves upon our previous works where the robot has to pause its movement in order to acquire the two bearing angle measurements needed for position determination. The latter restriction forces the robot to work in a stop-and-go mode, which constrains the robot’s mobilitty. The proposed scheme exploits the velocity prediction from Kalman filtering, to properly correlate two consecutive measurements of bearing angles with respect to the base nodes (beacons) to produce location measurement. The proposed solution is evaluated in simulation and its advantage is demonstrated through the comparison with the traditional approach where the two consecutive angle measurements are directly used to compute the location.
APA, Harvard, Vancouver, ISO, and other styles
5

Mahmoudzadeh Akherat, Seyed Mohammad Javid, and Morteza Kimiaghalam. "A Numerical Investigation on Pulsatile Blood Flow Through Consecutive Axi-Symmetric Stenosis in Coronary Artery." In ASME 2010 10th Biennial Conference on Engineering Systems Design and Analysis. ASMEDC, 2010. http://dx.doi.org/10.1115/esda2010-24534.

Full text
Abstract:
The objective of this research is the determination of the wall shear stress (WSS) and velocity distribution patterns in axi-symmetric single or repeated stenoses in coronary arteries. The blood flow is modeled as an incompressible laminar flow with Re = 500 and the analysis is performed for both Newtonian and non-Newtonian blood behaviors. For the single stenosis cases, the area reduction of 25%, 64% and 75% are considered, while for the consecutive stenosis cases two sets of 64%, 25%, and 75%, 64% for the first and second stenosis are examined numerically respectively. Single stenosis cases are also employed for validation purposes, since experimental data are available for them. Present results indicate that regions of high and low shear stress may play an important role in the rupture of atherosclerotic lesions. Both sides of the stenotic area with high WSS and intense WSSG (Wall Shear Stress Gradient) are the most vulnerable sites of plaques. For the cases of consecutive stenoses, results show that displacement of the secondary plauque does not have any effect on the flow pattern. Moreover, the effect of the progression and the area reduction percentage of the consecutive stenoses were studied numerically. It was concluded that the progression of the first and the second stenoses creates high alterations in WSS and velocity distribution and increases the vulnerability of creation of new plaques. Furthermore, the pulsatile property of blood was considered. An accurate velocity waveform was implemented to predict the pulsatile behavior of blood. Results significantly vary from those of the laminar analysis in terms of velocity distribution and the magnitude of the maximum velocity. The flow patterns are studied for several time sections in one period.
APA, Harvard, Vancouver, ISO, and other styles
6

Asano, Yukako, Shigenori Togashi, and Yoshishige Endo. "Optimization of Chemical Reaction Processes in Microreactors Using Reaction Rate Analyses." In ASME-JSME-KSME 2011 Joint Fluids Engineering Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/ajk2011-36013.

Full text
Abstract:
We applied microreactors to the three following reactions: a consecutive bromination reaction, the two-step Sandmeyer reaction, and an acetylation reaction including solvent effects. We obtained the reaction rate constants from few experimental data or quantum chemical calculations and optimized the reaction conditions such as the reaction times and temperature. We then experimentally validated them by microreactors. A consecutive bromination reaction, where the objective reaction was followed by the side reaction, was one of the processes. The reaction temperature played an important role in the effects of a microreactor. The yield of the objective product was improved by about 40% using a microreactor. The two-step Sandmeyer reaction was also applied, where the 1st-step reaction was followed by the 2nd-step reaction to produce the objective product. The 1st-step reaction had the diffusion-controlled process, while the 2nd-step reaction had the reaction-controlled one. The yield of the objective product was improved when microreactors were used and the reaction time for the 2nd-step reaction was set appropriately. Moreover, an acetylation reaction including solvent effects on reaction rates was considered and the solvent effects could be predicted from quantum chemical calculations. The calculation suggested that acetic acid with the larger electron-accepting property gave more stability to the species formed in the transition state. The reaction time was shortened using a microreactor, when the reaction process was changed from reaction-controlled to diffusion-controlled by changing the solvent used.
APA, Harvard, Vancouver, ISO, and other styles
7

Pabinger, I., K. T. Lechner, P. Bettelheim, et al. "COAGULATION ACTIVATION AND OCCURRENCE OF HYPOFIBRINOGENEMIA IN PATIENTS WITH ACUTE NONLYMPHOBLASTIC LEUKEMIA." In XIth International Congress on Thrombosis and Haemostasis. Schattauer GmbH, 1987. http://dx.doi.org/10.1055/s-0038-1643672.

Full text
Abstract:
122 consecutive adult patients (pts) with acute nonlympho-blastic leukemia (ANLL) were studied for evidence of coagulation activation andoccurrence of hypofibrinogenemia. In 16 pts (13%) decreased fibrinogenlevels (&lt; 1.5g/l) were found.Data on fibrinopeptide A levels (FPA), ethanol gelation test (EGT) andfibrin(ogen) degredation products(FDP) are listed in the table:The occurrence of hypofibrinogenemia was not correlated to the peripheral blast cell count. 10/18 pts with M3 (FAB-classifica-tion), 2/46pts with M2, 2/25 pts with M4 and 2/14 pts with M5 leukemia developed hypofibrinogenemia. Early death occurred in 31% of pts with hypofibrinogenemia (in most pts due to hemorrhage) and only in 10% without (in most pts due to septicemia). No significant difference in remission duration was found between the 2 groups. 48 patients were reinvestigated at the time of recurrence of disease. 5 of 7 patients with and 38 of 41 patients without initial hypofibrinogenemia had a coagulation pattern similar to the one observed at first presentation.The following conclusions can bedrawn:(1) In most patients with ANLL there is evidence of coagulation activation. (2) Hypofibrinogenemia in patients with ANLL appears to bethrombin mediated. Therefore the term disseminated intravascular coagulation (DIC) may be used. (3) DIC is strongly associated with the subtype M3 (promyelocytic L), but may as well occur in other ANLL subtypes.(4) The presence of DIC seems to be a specific property of certain leukemic clones. This assumption is supported by the coagulation studiesduring recurrence of ANLL. (5) Patients with low fibrinogen levels areat high risk of early death due to hemorrhagic complications.
APA, Harvard, Vancouver, ISO, and other styles
8

Pernía-Espinoza, Alpha, Enrique Sodupe-Ortega, Fco Javier Martinez-de-Pison-Ascacibar, Ruben Urraca-Valle, Javier Antoñanzas-Torres, and Andres Sanz-García. "Assessment of microproject-based teaching/learning (MicroPBL) experience in industrial engineering degrees." In Third International Conference on Higher Education Advances. Universitat Politècnica València, 2017. http://dx.doi.org/10.4995/head17.2017.5167.

Full text
Abstract:
An assessment program to evaluate microproject-based teaching/learning (MicroPBL) methodology on the technical subject ‘Manufacturing Technology’ was implemented for four consecutive academic years. Students from three different engineering degrees were involved providing feedback through different surveys that allowed us to perform a proper evaluation. More specifically, students’ surveys were anonymous after each academic year, except the last one, in which non-anonymous pre and post-surveys were conducted. The surveys were meant to evaluate the acquisition of specific competences (using technical questions about the subject) as well as generic competences (using questions concerning soft-skills). We also checked the students’ satisfaction with the methodology and with the signature in general. Using non-anonymous surveys allowed us to correlate results with the student’s final scores. Students’ self-assessment concerning their knowledge about technical aspects drastically changed after the course. The average of the subject’s final score from student’s perception was slightly higher than the actual value. Student’s self-perception on soft-skills was also increased at the end of the course. The MicroPBL methodology demonstrated beneficial for the case of this technical subject as it maintained high motivation levels in students, which were directly related to students’ success rates and final scores.
APA, Harvard, Vancouver, ISO, and other styles
9

Cheng, Kung-Shan. "Cooling Limit Approach for Single-Pulse Thermal Therapies." In ASME 2004 International Mechanical Engineering Congress and Exposition. ASMEDC, 2004. http://dx.doi.org/10.1115/imece2004-62235.

Full text
Abstract:
Based upon the commonly used Sapareto-Dewey thermal dose formula, a thermal treatment is divided into four periods: 1) period-1 is from 37°C to 43°C, 2) period-2 is from 43°C to Tpeak, 3) period-3 is from Tpeak to 43°C, and 4) period-4 is 43°C to 38°C. A recent study derived a closed form thermal dose formula based on a combined term, the “effective cooling frequency,” revealed that one can determine the best performance of a thermal therapy by concentrating on the cooling periods: period-3 and period-4. As an extension, this study used a closed-form temperature solution to investigate the influences from both cooling terms (perfusion and thermal conduction) separately. The results determined the upper bound of the peak temperature for pulses with different focal sizes under different blood perfusion values. Under practical settings, no pulse should introduce peak temperature higher than 67°C to avoid overdosing when the desired thermal dose is 240CEM43°C. It also showed that pulses with focal size smaller than or equal to 4 mm benefit the perfusion independence for the following quantities: the upper bound on the peak temperature, the treatment size, and the time/temperature for which 90% thermal dose is accumulated. Thus the conduction dominates the cooling process for each single pulse heated by the highly focused SFUS applicators when the pulses are properly isolated temporally. Results from this study further provide an estimation of the closest distance between two pulses and the time/temperature to re-activate the consecutive pulses. Thus the results can guide the researchers to design more efficient treatment protocol for multiple-pulse thermal therapies.
APA, Harvard, Vancouver, ISO, and other styles
10

Marelli, Silvia, Anna Misley, and Marco Ferrando. "Experimental Investigation in Turbocharger Compressors During Surge Operation." In ASME Turbo Expo 2020: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/gt2020-15174.

Full text
Abstract:
Abstract Flow instabilities in centrifugal compressors are one of the most limiting factors to the performance of the system where the compressor is installed (i.e., internal combustion engines, fuel cell, etc.). A better understanding of the surge phenomenon allows to properly set-up the operative region of the turbomachine in order to avoid a decrease in performance and to prevent the risk of damage. Actually, the instability phenomenon of surge can seriously damage the compressor for vibrations and temperature stress. To avoid damage to the compressor, the maximum boost pressure is generally limited with a by-pass system, reducing the mass flow rate provided by the machine. The results of a broad experimental investigation performed at the turbocharger test bench of the University of Genoa are reported to deeply analyze the behavior of a small centrifugal compressor. A specific circuit adaptable in volume and length is used to study the effect of different configurations on steady compressor performance with special reference to the unstable operation. Measurements of instantaneous pressure and mass flow rate signals are performed in different sections located upstream and downstream the turbomachine. The difficulties related to measurement of instantaneous fluid-dynamics parameters in the turbocharging circuit and data post-processing are highlighted under unsteady flow conditions occurring in surge operation. The effect of the compressor operating conditions (i.e., turbocharger rotational speed) and the circuit geometry is studied during the transition from steady to unsteady operation. In particular, the hysteresis loops surrounding the steady state map are reported highlighting filling and emptying and wave action phenomena, also in the region of zero mass flow and in the case of reverse flow condition. All measured quantities presented in this paper are the time synchronous averages of a large number of consecutive cycles in deep surge operation. The aim of the paper is to extensively analyze the compressor behavior in unstable operating conditions in order to improve simulation models such as a physics-based compressor model previously developed by the Authors.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography