Log in

Relevant bibliographies by topics / Closed set / Journal articles

To see the other types of publications on this topic, follow the link: Closed set.

Journal articles on the topic 'Closed set'

Author: Grafiati

Published: 4 June 2021

Last updated: 30 January 2023

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Closed set.'

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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Riyadh Kareem, Noor, and . "Fuzzy tgp-closed sets and fuzzy t^* gp-closed sets." International Journal of Engineering & Technology 7, no. 4.36 (December 9, 2018): 718. http://dx.doi.org/10.14419/ijet.v7i4.36.24229.

Full text

Abstract:

In this paper, we aim to address the idea of fuzzy -set and fuzzy -set in fuzzy topological space to present new types of the fuzzy closed set named fuzzy -closed set and fuzzy -closed set. We will study several examples and explain the relations of them with other classes of fuzzy closed sets. Moreover, in a fuzzy locally indiscrete space we can see that these two sets are the same.

APA, Harvard, Vancouver, ISO, and other styles

2

Chafetz, Jill. "The closed-class vocabulary as a closed set." Applied Psycholinguistics 15, no. 3 (July 1994): 273–87. http://dx.doi.org/10.1017/s0142716400065899.

Full text

Abstract:

AbstractChildren who have normal language development are aware of the distinction between closed-class and open-class words at a very early age. In order to test to what extent children know the closed class to be, in fact, closed, 104 children aged 3 to 5 years participated in a sentence repetition task. Each sentence contained a nonsense word that fulfilled either an open-class or a closed-class function. Children were more likely to repeat sentences correctly when the nonsense words functioned in open-class, rather than in closed-class, contexts. In addition, older children correctly repeated more sentences containing nonsense words that functioned in closed-class contexts than younger children. This last result shows a mechanism by which children may acquire new closed-class words. The theoretical implications of the results are also discussed relative to children with specific language impairments, especially in terms of their reliance on semantic value in word acquisition.

APA, Harvard, Vancouver, ISO, and other styles

3

Clopper, Cynthia G., David B. Pisoni, and Adam T. Tierney. "Effects of Open-Set and Closed-Set Task Demands on Spoken Word Recognition." Journal of the American Academy of Audiology 17, no. 05 (May 2006): 331–49. http://dx.doi.org/10.3766/jaaa.17.5.4.

Full text

Abstract:

Closed-set tests of spoken word recognition are frequently used in clinical settings to assess the speech discrimination skills of hearing-impaired listeners, particularly children. Speech scientists have reported robust effects of lexical competition and talker variability in open-set tasks but not closed-set tasks, suggesting that closed-set tests of spoken word recognition may not be valid assessments of speech recognition skills. The goal of the current study was to explore some of the task demands that might account for this fundamental difference between open-set and closed-set tasks. In a series of four experiments, we manipulated the number and nature of the response alternatives. Results revealed that as more highly confusable foils were added to the response alternatives, lexical competition and talker variability effects emerged in closed-set tests of spoken word recognition. These results demonstrate a close coupling between task demands and lexical competition effects in lexical access and spoken word recognition processes.

APA, Harvard, Vancouver, ISO, and other styles

4

JudeImmaculate, H., and I. Arockiarani. "On Generalized D-Closed Set." International Journal of Computer Applications 89, no. 18 (March 26, 2014): 12–17. http://dx.doi.org/10.5120/15730-4530.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Chen, Guantao, Hein van der Holst, Alexandr Kostochka, and Nana Li. "Extremal Union-Closed Set Families." Graphs and Combinatorics 35, no. 6 (September 10, 2019): 1495–502. http://dx.doi.org/10.1007/s00373-019-02087-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Modak, Shyamapada, and Takashi Noiri. "Remarks on locally closed set." Acta et Commentationes Universitatis Tartuensis de Mathematica 22, no. 1 (June 10, 2018): 57–64. http://dx.doi.org/10.12697/acutm.2018.22.06.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Al-Taha, Sarab A. "The multiplicative closed set Sa." Pure Mathematical Sciences 2 (2013): 115–20. http://dx.doi.org/10.12988/pms.2013.13014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Khudair, Huda F., and Fatimah M. Mohammed. "Generalized of A-Closed Set and Ƈ- Closed Set in Fuzzy Neutrosophic Topological Spaces." International Journal of Neutrosophic Science 19, no. 2 (2022): 08–18. http://dx.doi.org/10.54216/ijns.190201.

Full text

Abstract:

In this research paper, a new two classes of sets called fuzzy neutrosophic generalized A-closed sets and fuzzy neutrosophic generalized Ƈ-Closed sets in fuzzy neutrosophic topology are introduced and some of their properties have been investigated. We give some theorems, propositions and some necessary examples related to presented definitions. Then, we discuss the relations among the new defined sets.

APA, Harvard, Vancouver, ISO, and other styles

9

Grandoni, Fabrizio, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, and Mohit Singh. "Set Covering with Our Eyes Closed." SIAM Journal on Computing 42, no. 3 (January 2013): 808–30. http://dx.doi.org/10.1137/100802888.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Dustor, Adam. "Matlab Based Closed Set Speaker Recognition." IFAC Proceedings Volumes 36, no. 1 (February 2003): 235–40. http://dx.doi.org/10.1016/s1474-6670(17)33747-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Vidyarani, L., and M. Vigneshwaran. "On intutionistic supra \(N\)-closed set." Journal of Advanced Studies in Topology 7, no. 1 (December 31, 2015): 31. http://dx.doi.org/10.20454/jast.2016.1002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Mariappa, K., and S. Sekar. "On regular generalized b-closed set." International Journal of Mathematical Analysis 7 (2013): 613–24. http://dx.doi.org/10.12988/ijma.2013.13059.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Nieminen, Juhani. "Closed set characterizations of finite lattices." Proceedings of the Indian Academy of Sciences - Section A 94, no. 1 (September 1985): 47–49. http://dx.doi.org/10.1007/bf02837256.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Sanki, Bidyut. "Filling of closed surfaces." Journal of Topology and Analysis 10, no. 04 (November 27, 2018): 897–913. http://dx.doi.org/10.1142/s1793525318500309.

Full text

Abstract:

Let [Formula: see text] denote a closed oriented surface of genus [Formula: see text]. A set of simple closed curves is called a filling of [Formula: see text] if its complement is a disjoint union of discs. The mapping class group [Formula: see text] of genus [Formula: see text] acts on the set of fillings of [Formula: see text]. The union of the curves in a filling forms a graph on the surface which is a so-called decorated fat graph. It is a fact that two fillings of [Formula: see text] are in the same [Formula: see text]-orbit if and only if the corresponding fat graphs are isomorphic. We prove that any filling of [Formula: see text] whose complement is a single disc (i.e. a so-called minimal filling) has either three or four closed curves and in each of these two cases, there is a unique such filling up to the action of [Formula: see text]. We provide a constructive proof to show that the minimum number of discs in the complement of a filling pair of [Formula: see text] is two. Finally, given positive integers [Formula: see text] and [Formula: see text] with [Formula: see text], we construct a filling pair of [Formula: see text] such that the complement is a union of [Formula: see text] topological discs.

APA, Harvard, Vancouver, ISO, and other styles

15

Yu, Tzu-Ling J., and Robert S. Schlauch. "Diagnostic Precision of Open-Set Versus Closed-Set Word Recognition Testing." Journal of Speech, Language, and Hearing Research 62, no. 6 (June 19, 2019): 2035–47. http://dx.doi.org/10.1044/2019_jslhr-h-18-0317.

Full text

Abstract:

Purpose The aim of the study was to examine the precision of forced-choice (closed-set) and open-ended (open-set) word recognition (WR) tasks for identifying a change in hearing. Method WR performance for closed-set (4 and 6 choices) and open-set tasks was obtained from 70 listeners with normal hearing. Speech recognition was degraded by presenting monosyllabic words in noise (−8, −4, 0, and 4 signal-to-noise ratios) or processed by a sine wave vocoder (2, 4, 6, and 8 channels). Results The 2 degraded speech understanding conditions yielded similarly shaped, monotonically increasing psychometric functions with the closed-set tasks having shallower slopes and higher scores than the open-set task for the same listening condition. Fitted psychometric functions to the average data were the input to a computer simulation conducted to assess the ability of each task to identify a change in hearing. Individual data were also analyzed using 95% confidence intervals for significant changes in scores for words and phonemes. These analyses found the following for the most to least efficient condition: open-set (phoneme), open-set (word), closed-set (6 choices), and closed-set (4 choices). Conclusions Closed-set WR testing has distinct advantages for implementation, but its poorer precision for identifying a change than open-set WR testing must be considered.

APA, Harvard, Vancouver, ISO, and other styles

16

Azzam, A. A. "A New Closed Set in Topological Spaces." Mathematical Problems in Engineering 2021 (May 31, 2021): 1–4. http://dx.doi.org/10.1155/2021/6617224.

Full text

Abstract:

Our purpose of this work is to implement a class of s g ^ -closed sets, which is property placed among the classes of semiclosed sets and g s -closed sets. The relations with other concepts directly or indirectly joined with generalized closed sets are inspected. In addition, as an application, using the notion of s g ^ -closed sets, we give a brief expansion of a new space named T s g ^ -space.

APA, Harvard, Vancouver, ISO, and other styles

17

Al-Omari, Ahmad, and Mohd Salmi Md Noorani. "Regular Generalizedω-Closed Sets." International Journal of Mathematics and Mathematical Sciences 2007 (2007): 1–11. http://dx.doi.org/10.1155/2007/16292.

Full text

Abstract:

In 1982 and 1970, Hdeib and Levine introduced the notions ofω-closed set and generalized closed set, respectively. The aim of this paper is to provide a relatively new notion of generalized closed set, namely, regular generalizedω-closed, regular generalizedω-continuous,a-ω-continuous, and regular generalizedω-irresolute maps and to study its fundamental properties.

APA, Harvard, Vancouver, ISO, and other styles

18

Yousif, Hayder J., and Ahmed A. Omran. "Closed Fuzzy Dominating Set in Fuzzy Graphs." Journal of Physics: Conference Series 1879, no. 3 (May 1, 2021): 032022. http://dx.doi.org/10.1088/1742-6596/1879/3/032022.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Sugiyama, Mahito, and Akihiro Yamamoto. "Semi-supervised learning on closed set lattices." Intelligent Data Analysis 17, no. 3 (May 16, 2013): 399–421. http://dx.doi.org/10.3233/ida-130586.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Bell, Theodore S., Donald D. Dirks, and Gail E. Kincaid. "Closed-Set Effects in Consonant Confusion Patterns." Journal of Speech, Language, and Hearing Research 32, no. 4 (December 1989): 944–48. http://dx.doi.org/10.1044/jshr.3204.944.

Full text

Abstract:

Invariance of error patterns in confusion matrices of varying dimensions were examined. Normal-hearing young adults were presented closed-set arrangements of digitized syllable tokens, spoken by 1 male and 1 female talker, and selected from a set of 14 consonants (stops and fricatives). Each consonant was paired with the vowel /a/ in a vowel-consonant format and presented at three intensity levels. Patterns of errors among voiceless stops and among voiced fricatives were dependent on the set of alternatives. Voiceless fricatives and voiced stops were not significantly affected by the number of response alternatives. Speaker differences, individual differences among listeners, and implications relating to the generalization of confusion data collected in small closed-set arrangements arc discussed.

APA, Harvard, Vancouver, ISO, and other styles

21

Ji, L. "On the 3BD-closed set B3({4,5})." Discrete Mathematics 287, no. 1-3 (October 2004): 55–67. http://dx.doi.org/10.1016/j.disc.2004.06.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Neiva, Juliana, Adolfo Guimaraes, and Hendrik Macedo. "Closed-set Speaker Identification in Speech Gateways." IEEE Latin America Transactions 12, no. 6 (September 2014): 1127–33. http://dx.doi.org/10.1109/tla.2014.6894010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Diaz-Cano, A., and C. Andradas. "Stability index of closed semianalytic set germs." Mathematische Zeitschrift 229, no. 4 (December 1998): 743–51. http://dx.doi.org/10.1007/pl00004680.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Lin, Pei-Kee. "An unbounded closed nearly uniformly convex set." Archiv der Mathematik 60, no. 1 (January 1993): 79–84. http://dx.doi.org/10.1007/bf01194242.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Ma, Li. "Mountain Pass on a Closed Convex Set." Journal of Mathematical Analysis and Applications 205, no. 2 (January 1997): 531–36. http://dx.doi.org/10.1006/jmaa.1997.5227.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Abdulsada, Dheargham Ali. "Generalized Closed Set in Intuitionistic Fuzzy Topology." International Journal of Fuzzy Mathematical Archive 17, no. 02 (2019): 109–14. http://dx.doi.org/10.22457/205ijfma.v17n2a6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Осіпчук, Тетяна. "On closed weakly m-convexsets." Proceedings of the International Geometry Center 15, no. 1 (June 18, 2022): 50–65. http://dx.doi.org/10.15673/tmgc.v15i1.2139.

Full text

Abstract:

In the present work we study properties of generally convex sets in the n-dimensional real Euclidean space Rn, (n>1), known as weakly m-convex, m=1,...,n-1. An open set of Rn is called weakly m-convex if, for any boundary point of the set, there exists an m-dimensional plane passing through this point and not intersecting the given set. A closed set of Rn is called weakly m-convex if it is approximated from the outside by a family of open weakly m-convex sets. A point of the complement of a set of Rn to the whole space is called an m-nonconvexity point of the set if any m-dimensional plane passing through the point intersects the set. It is proved that any closed, weakly (n-1)-convex set in Rn with non-empty set of (n-1)-nonconvexity points consists of not less than three connected components. It is also proved that the interior of a closed, weakly 1-convex set with a finite number of components in the plane is weakly 1-convex. Weakly m-convex domains and closed connected sets in Rn with non-empty set of m-nonconvexity points are constructed for any n>2 and any m=1,...,n-1.

APA, Harvard, Vancouver, ISO, and other styles

28

Şaşmaz, Pınar, and Murad Özkoç. "Generalized ωe∗-closed Sets." European Journal of Pure and Applied Mathematics 15, no. 2 (April 30, 2022): 354–74. http://dx.doi.org/10.29020/nybg.ejpam.v15i2.4340.

Full text

Abstract:

The aim of this paper is to introduce and study a new type of generalized closed sets, called generalized ωe∗ -closed (briefly, gωe∗ -closed) sets, via ωe∗-closure operator. We examine the fundamental properties of the class of these sets. The notion of gωe∗-closed set is weaker than the notions of gωβ-closed set and ωe∗-closed set in the literature. Also, we define and discuss the notions of generalized ωe∗-continuous and generalized ωe∗-irresolute functions.

APA, Harvard, Vancouver, ISO, and other styles

29

Al-Zoubi, Khalid Y. "On generalizedω-closed sets." International Journal of Mathematics and Mathematical Sciences 2005, no. 13 (2005): 2011–21. http://dx.doi.org/10.1155/ijmms.2005.2011.

Full text

Abstract:

The class ofω-closed subsets of a space(X,τ)was defined to introduceω-closed functions. The aim of this paper is to introduce and study the class ofgω-closed sets. This class of sets is finer thang-closed sets andω-closed sets. We study the fundamental properties of this class of sets. In the space(X,τω), the concepts closed set,g-closed set, andgω-closed set coincide. Further, we introduce and studygω-continuous andgω-irresolute functions.

APA, Harvard, Vancouver, ISO, and other styles

30

Indirani, C., and K. Meenambika. "Ψ-I-CLOSED SET, WEAKLY Ψ-I-CLOSED SET AND CONTRA Ψ-I-CONTINUOUS MAPPING IN IDEAL TOPOLOGICAL SPACES." Advances in Mathematics: Scientific Journal 9, no. 8 (August 15, 2020): 5745–57. http://dx.doi.org/10.37418/amsj.9.8.42.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

PARIMALA, M., M. GANSTER, and S. JAFARI. "ψ-I-CLOSED SET, WEAKLY ψ-I-CLOSED SET AND CONTRA ψ-I-CONTINUOUS MAPPING IN IDEAL TOPOLOGICAL SPACES." Poincare Journal of Analysis and Applications 07, no. 01 (June 25, 2020): 11–20. http://dx.doi.org/10.46753/pjaa.2020.v07i01.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Doboš, Jozef. "On the set of points of discontinuity for functions with closed graphs." Časopis pro pěstování matematiky 110, no. 1 (1985): 60–68. http://dx.doi.org/10.21136/cpm.1985.118222.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Bishop, Greg. "Ultrafilters generated by a closed set of functions." Journal of Symbolic Logic 60, no. 2 (June 1995): 415–30. http://dx.doi.org/10.2307/2275839.

Full text

Abstract:

AbstractLet κ and λ be infinite cardinals, a filter on κ and a set of functions from κ to κ. The filter is generated by if consists of those subsets of κ which contain the range of some element of . The set is <λ-closed if it is closed in the <λ-topology on κκ. (In general, the <λ-topology on IA has basic open sets all such that, for all i ∈ I, Ui ⊆ A and ∣{i ∈ I: Ui ≠ A} ∣<λ.) The primary question considered in this paper asks “Is there a uniform ultrafilter on κ which is generated by a closed set of functions?” (Closed means <ω-closed.) We also establish the independence of two related questions. One is due to Carlson: “Does there exist a regular cardinal κ and a subtree T of <κκ such that the set of branches of T generates a uniform ultrafilter on κ?”; and the other is due to Pouzet: “For all regular cardinals κ, is it true that no uniform ultrafilter on κ is it true that no uniform ultrafilter on κ analytic?”We show that if κ is a singular, strong limit cardinal, then there is a uniform ultrafilter on κ which is generated by a closed set of increasing functions. Also, from the consistency of an almost huge cardinal, we get the consistency of CH + “There is a uniform ultrafilter on ℵ1 which is generated by a closed set of increasing functions”. In contrast with the above results, we show that if Κ is any cardinal, λ is a regular cardinal less than or equal to κ and ℙ is the forcing notion for adding at least (κ<λ)+ generic subsets of λ, then in VP, no uniform ultrafilter on κ is generated by a closed set of functions.

APA, Harvard, Vancouver, ISO, and other styles

34

Gupta, Anshdha, and Akhilesh Verma. "Fingerprint Presentation Attack Detection Approaches in Open-Set and Closed-Set Scenario." Journal of Physics: Conference Series 1964, no. 4 (July 1, 2021): 042050. http://dx.doi.org/10.1088/1742-6596/1964/4/042050.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

VINACUA, A., I. NAVAZO, and P. BRUNET. "OCTREE DETECTION OF CLOSED COMPARTMENTS." International Journal of Computational Geometry & Applications 01, no. 03 (September 1991): 263–80. http://dx.doi.org/10.1142/s0218195991000190.

Full text

Abstract:

The present paper addresses the problem of detecting closed compartments produced by a set of planar faces in the space. The topology of the set is general, and edges in the final piecewise planar surface can belong to one, two or more faces; boundary representations for non-manifold solids are an example. An octree structure (dubbed eightit compartment Octree) that defines a 3D graph through the volume defined by the set of faces is proposed, and it is shown that a seed propagation algorithm on the graph can be used to detect the existing closed compartments. The algorithm can either compute the total number of compartments or detect if the set of faces define a closed solid volume, the outside part being considered as a separate compartment.

APA, Harvard, Vancouver, ISO, and other styles

36

Sakthivel, P., S. Selvi, and S. Gayathriprabha. "On Intuitionistic Fuzzy Multi Generalized Pre-Closed Set." International Journal of Computer Applications 152, no. 8 (October 17, 2016): 4–7. http://dx.doi.org/10.5120/ijca2016911903.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

K, Krishnaveni, and Vigneshwaran M. "NANO bT CLOSED SET IN NANO TOPOLOGICAL SPACES." Kongunadu Research Journal 2, no. 2 (December 30, 2015): 26–29. http://dx.doi.org/10.26524/krj91.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Tawfeeq, Bushra J. "〖D^(**)〗^μ -Closed Set in Supra topological Spaces." Al-Qadisiyah Journal Of Pure Science 26, no. 4 (August 15, 2021): 380–87. http://dx.doi.org/10.29350/qjps.2021.26.4.1349.

Full text

Abstract:

الفكرة الرئيسية لهذا العمل الحالي هي تقديم أنواع جديدة من المجموعات فوق المغلقة في فضاءات فوق طوبولوجية تسمى supra -closed (باختصار ، مغلقة). علاوة على ذلك ، قارن هذه الفئة من المجموعات بأنواع أخرى من المجموعات أعلاه في الفضاءات فوق الطوبولوجية. دراسة وإثبات بعض صفاتهم.

APA, Harvard, Vancouver, ISO, and other styles

39

Solecki, Sławomir. "Covering analytic sets by families of closed set." Journal of Symbolic Logic 59, no. 3 (September 1994): 1022–31. http://dx.doi.org/10.2307/2275926.

Full text

Abstract:

AbstractWe prove that for every familyIof closed subsets of a Polish space eachset can be covered by countably many members ofIor else contains a nonemptyset which cannot be covered by countably many members ofI. We prove an analogous result forκ-Souslin sets and show that ifA#exists for anyA⊂ωω, then the above result is true forsets. A theorem of Martin is included stating that this result is also true for weakly homogeneously Souslin sets. As an application of our results we derive from them a general form of Hurewicz's theorem due to Kechris. Louveau, and Woodin and a theorem of Feng on the open covering axiom. Also some well-known theorems on finding “big” closed sets insideof“big”andare consequences of our results.

APA, Harvard, Vancouver, ISO, and other styles

40

Yurchenko, I. S. "On the Existence of Continual Closed U-set." Izvestiya of Saratov University. New Series. Series: Mathematics. Mechanics. Informatics 16, no. 1 (2016): 76–79. http://dx.doi.org/10.18500/1816-9791-2016-16-1-76-79.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

KRYSZKIEWICZ, MARZENA. "CLOSED SET BASED DISCOVERY OF MAXIMAL COVERING RULES." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 11, supp01 (September 2003): 15–29. http://dx.doi.org/10.1142/s0218488503002247.

Full text

Abstract:

Many knowledge discovery tasks consist in mining databases. Nevertheless, there are cases in which a user is not allowed to access the database and can deal only with a provided fraction of knowledge. Still, the user hopes to find new interesting relationships. Surprisingly, a small number of patterns can be augmented into new knowledge so considerably that its analysis may become infeasible. In the article, we offer a method of inferring the concise lossless and sound representation of association rules in the form of maximal covering rules from a concise lossless representation of all derivable patterns. The respective algorithm is offered as well.

APA, Harvard, Vancouver, ISO, and other styles

42

Harigai, M., T. Nakazawa, T. Yoshida, Y. Hirakoso, K. Suto, and H. Negishi. "LSI chip set for closed caption decoder system." IEEE Transactions on Consumer Electronics 37, no. 3 (1991): 449–54. http://dx.doi.org/10.1109/30.85551.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Lee, Manseob, and Junmi Park. "ASYMPTOTIC AVERAGE SHADOWING PROPERTY ON A CLOSED SET." Journal of the Chungcheong Mathematical Society 25, no. 1 (February 15, 2012): 27–33. http://dx.doi.org/10.14403/jcms.2012.25.1.027.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Koh, K. M., and K. S. Poh. "Products of graphs with their closed-set lattices." Discrete Mathematics 69, no. 3 (May 1988): 241–51. http://dx.doi.org/10.1016/0012-365x(88)90053-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Tîrnăucă, Cristina, José L. Balcázar, and Domingo Gómez-Pérez. "Closed-Set-Based Discovery of Representative Association Rules." International Journal of Foundations of Computer Science 31, no. 01 (January 2020): 143–56. http://dx.doi.org/10.1142/s0129054120400109.

Full text

Abstract:

The output of an association rule miner is often huge in practice. This is why several concise lossless representations have been proposed, such as the “essential” or “representative” rules. A previously known algorithm for mining representative rules relies on an incorrect mathematical claim, and can be seen to miss part of its intended output; in previous work, two of the authors of the present paper have offered a complete but, often, somewhat slower alternative. Here, we extend this alternative to the case of closure-based redundancy. The empirical validation shows that, in this way, we can improve on the original time efficiency, without sacrificing completeness.

APA, Harvard, Vancouver, ISO, and other styles

46

Kazali, Basari Kodi. "A New Closed Set on Ideal Topological Spaces." Journal of Advanced Studies in Topology 4, no. 1 (August 29, 2012): 18. http://dx.doi.org/10.20454/jast.2013.460.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Dhanalakshmi, P., S. Arunpriya, and S. Gayathiriprabha. "On Intuitionistic Fuzzy Multi Weakly Generalized Closed Set." International Journal of Computer Applications 146, no. 13 (July 15, 2016): 21–25. http://dx.doi.org/10.5120/ijca2016910905.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Jayakumar, P., K. Mariappa, and S. Sekar. "On generalized gp*-closed set in topological spaces." International Journal of Mathematical Analysis 7 (2013): 1635–45. http://dx.doi.org/10.12988/ijma.2013.3356.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Dohmen, Klaus. "Improved Bonferroni Inequalities via Union-Closed Set Systems." Journal of Combinatorial Theory, Series A 92, no. 1 (October 2000): 61–67. http://dx.doi.org/10.1006/jcta.1999.3030.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Guzik, Grzegorz. "Minimal invariant closed sets of set-valued semiflows." Journal of Mathematical Analysis and Applications 449, no. 1 (May 2017): 382–96. http://dx.doi.org/10.1016/j.jmaa.2016.11.072.

Full text

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!