Journal articles: 'Set-Associative'

1

Hwang, Yuan-Shin, and Jia-Jhe Li. "Snug set-associative caches." ACM Transactions on Architecture and Code Optimization 4, no. 1 (March 2007): 6. http://dx.doi.org/10.1145/1216544.1216549.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Kang, J., S. Lee, and I. Lee. "Way-tracking set-associative caches." Electronics Letters 46, no. 22 (2010): 1497. http://dx.doi.org/10.1049/el.2010.8526.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Subha, S. "An Energy Efficient Set Associative Cache Algorithm." International Journal of Computer Applications 68, no. 14 (April 18, 2013): 12–15. http://dx.doi.org/10.5120/11646-7137.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Harper, J. S., D. J. Kerbyson, and G. R. Nudd. "Analytical modeling of set-associative cache behavior." IEEE Transactions on Computers 48, no. 10 (1999): 1009–24. http://dx.doi.org/10.1109/12.805152.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Marjan Gusev, and Sasko Ristov. "Performance Gains and Drawbacks using Set Associative Cache." Journal of Next Generation Information Technology 3, no. 3 (August 31, 2012): 87–98. http://dx.doi.org/10.4156/jnit.vol3.issue3.9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Sugumar, Rabin A., and Santosh G. Abraham. "Set-associative cache simulation using generalized binomial trees." ACM Transactions on Computer Systems 13, no. 1 (February 1995): 32–56. http://dx.doi.org/10.1145/200912.200918.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Fraguela, Basilio B., Ramón Doallo, and Emilio L. Zapata. "Modeling set associative caches behavior for irregular computations." ACM SIGMETRICS Performance Evaluation Review 26, no. 1 (June 1998): 192–201. http://dx.doi.org/10.1145/277858.277910.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Koh, Cheng-Kok, Weng-Fai Wong, Yiran Chen, and Hai Li. "Tolerating process variations in large, set-associative caches." ACM Transactions on Architecture and Code Optimization 6, no. 2 (June 2009): 1–34. http://dx.doi.org/10.1145/1543753.1543757.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

YAKTINE, UMAYMA S. "ASSOCIATIVE AND SET LEARNING IN SEVERELY SUBNORMAL PATIENTS." Journal of Intellectual Disability Research 9, no. 2 (June 28, 2008): 83–88. http://dx.doi.org/10.1111/j.1365-2788.1965.tb00824.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Calagos, M., and Y. Chu. "Hybrid scheme for low-power set associative caches." Electronics Letters 48, no. 14 (2012): 819. http://dx.doi.org/10.1049/el.2012.1434.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Yuguang Wu and R. Muntz. "Stack evaluation of arbitrary set-associative multiprocessor caches." IEEE Transactions on Parallel and Distributed Systems 6, no. 9 (1995): 930–42. http://dx.doi.org/10.1109/71.466631.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Sehgal, Amit, Ravinder Kumar, and Ombir Dahiya. "Associative Binary Operations on a Set with Five Elements." International Journal of Computer Applications 76, no. 6 (August 23, 2013): 27–33. http://dx.doi.org/10.5120/13252-0725.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Lee, Sungjae, Jinku Kang, and Inhwan Lee. "Way-lookup buffer for low-power set-associative cache." IEICE Electronics Express 8, no. 23 (2011): 1961–66. http://dx.doi.org/10.1587/elex.8.1961.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Chauan, Praveena, Gagandeep Singh, and Gurmohan Singh. "Cache Controller for 4-way Set-Associative Cache Memory." International Journal of Computer Applications 129, no. 1 (November 17, 2015): 1–8. http://dx.doi.org/10.5120/ijca2015906787.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Di Carlo, Stefano, Paolo Prinetto, and Alessandro Savino. "Software-Based Self-Test of Set-Associative Cache Memories." IEEE Transactions on Computers 60, no. 7 (July 2011): 1030–44. http://dx.doi.org/10.1109/tc.2010.166.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

ZARANDI, HAMID R., and SEYED GHASSEM MIREMADI. "HIERARCHICAL SET-ASSOCIATE CACHE FOR HIGH-PERFORMANCE AND LOW-ENERGY ARCHITECTURE." Journal of Circuits, Systems and Computers 15, no. 06 (December 2006): 861–80. http://dx.doi.org/10.1142/s0218126606003404.

Full text

Abstract:

This paper presents a new cache scheme based on varying the size of sets in the set-associative cache hierarchically. In this scheme, all sets at a hierarchical level have same size but are k times more than the size of sets in the next level of hierarchy where k is called division factor. Therefore the size of tag fields associated to each set is variable and it depends on the hierarchy level of the set it is in. This scheme is proposed to achieve higher hit ratios with respect to the two conventional schemes namely set-associative and direct mapping. The proposed scheme has been simulated with several standard trace files SPEC 2000 and statistics are gathered and analyzed for different cache configurations. The results reveal that the proposed scheme exhibits a higher hit ratio compared to the two well-known mapping schemes, namely set-associative and direct mapping. Moreover, the area and power consumption of this scheme is less than full-associative scheme.

APA, Harvard, Vancouver, ISO, and other styles

17

Zhang, Xuemei, and Jianhua Zhou. "Centroids of Differentiably Simple Color Algebras." Algebra Colloquium 13, no. 03 (September 2006): 447–54. http://dx.doi.org/10.1142/s1005386706000393.

Full text

Abstract:

The chains of ideals of differentiably simple (non-associative) color algebras and those of their centroids are studied. It is proved that for any finite-dimensional differentiably simple (non-associative) color algebra A and any set D of its color derivations, A is D-simple if and only if its centroid 𝙲(A) is D*-simple, where 𝙲(A) is a unitary ∊-commutative associative color algebra, and D* is the set of the color derivations determined by D.

APA, Harvard, Vancouver, ISO, and other styles

18

Lehtonen, Erkko, Jean-Luc Marichal, and Bruno Teheux. "Associative string functions." Asian-European Journal of Mathematics 07, no. 04 (December 2014): 1450059. http://dx.doi.org/10.1142/s1793557114500594.

Full text

Abstract:

We introduce the concept of associativity for string functions, where a string function is a unary operation on the set of strings over a given alphabet. We discuss this new property and describe certain classes of associative string functions. We also characterize the recently introduced preassociative functions as compositions of associative string functions with injective unary maps. Finally, we provide descriptions of the classes of associative and preassociative functions which depend only on the length of the input.

APA, Harvard, Vancouver, ISO, and other styles

19

Lee, Sungjae, Jinku Kang, Juho Lee, Jiyong Youn, and Inhwan Lee. "Energy-efficient Set-associative Cache Using Bi-mode Way-selector." KIPS Transactions on Computer and Communication Systems 1, no. 1 (October 30, 2012): 1–10. http://dx.doi.org/10.3745/ktccs.2012.1.1.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Sehgal, Amit, Sunil Kumar, Sarita, and Yashpal. "Commutative Associative Binary Operations on a Set with Five Elements." Journal of Physics: Conference Series 1000 (April 2018): 012063. http://dx.doi.org/10.1088/1742-6596/1000/1/012063.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Inoue, Keisuke, and Hideharu Amano. "pSAS/c: Pseudo set associative and shared with competitive cache." Electronics and Communications in Japan (Part II: Electronics) 86, no. 9 (August 18, 2003): 76–84. http://dx.doi.org/10.1002/ecjb.10183.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Jung, Bo-Sung, and Jung-Hoon Lee. "Effective Algorithm for the Low-Power Set-Associative Cache Memory." IEMEK Journal of Embedded Systems and Applications 9, no. 1 (February 28, 2014): 25–32. http://dx.doi.org/10.14372/iemek.2014.9.1.25.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Hooshmandasl, M. R., A. Karimi, M. Almbardar, and B. Davvaz. "Axiomatic systems for rough set-valued homomorphisms of associative rings." International Journal of Approximate Reasoning 54, no. 2 (February 2013): 297–306. http://dx.doi.org/10.1016/j.ijar.2012.10.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Davarakis, C. T., and D. G. Maritsas. "A probabilistic parallel associative search and query set of algorithms." Journal of Parallel and Distributed Computing 14, no. 1 (January 1992): 37–49. http://dx.doi.org/10.1016/0743-7315(92)90096-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Zhou, Zhongmei. "A New Classification Approach Based on Multiple Classification Rules." Mathematical Problems in Engineering 2014 (2014): 1–7. http://dx.doi.org/10.1155/2014/818253.

Full text

Abstract:

A good classifier can correctly predict new data for which the class label is unknown, so it is important to construct a high accuracy classifier. Hence, classification techniques are much useful in ubiquitous computing. Associative classification achieves higher classification accuracy than some traditional rule-based classification approaches. However, the approach also has two major deficiencies. First, it generates a very large number of association classification rules, especially when the minimum support is set to be low. It is difficult to select a high quality rule set for classification. Second, the accuracy of associative classification depends on the setting of the minimum support and the minimum confidence. In comparison with associative classification, some improved traditional rule-based classification approaches often produce a classification rule set that plays an important role in prediction. Thus, some improved traditional rule-based classification approaches not only achieve better efficiency than associative classification but also get higher accuracy. In this paper, we put forward a new classification approach called CMR (classification based on multiple classification rules). CMR combines the advantages of both associative classification and rule-based classification. Our experimental results show that CMR gets higher accuracy than some traditional rule-based classification methods.

APA, Harvard, Vancouver, ISO, and other styles

26

Rostami-Sani, Sajjad, Mojtaba Valinataj, and Saeideh Alinezhad Chamazcoti. "Parloom: A New Low-Power Set-Associative Instruction Cache Architecture Utilizing Enhanced Counting Bloom Filter and Partial Tags." Journal of Circuits, Systems and Computers 28, no. 12 (November 2019): 1950203. http://dx.doi.org/10.1142/s0218126619502037.

Full text

Abstract:

The cache system dissipates a significant amount of energy compared to the other memory components. This will be intensified if a cache is designed with a set-associative structure to improve the system performance because the parallel accesses to the entries of a set for tag comparisons lead to even more energy consumption. In this paper, a novel method is proposed as a combination of a counting Bloom filter and partial tags to mitigate the energy consumption of set-associative caches. This new hybrid method noticeably decreases the cache energy consumption especially in highly-associative instruction caches. In fact, it uses an enhanced counting Bloom filter to predict cache misses with a high accuracy as well as partial tags to decrease the overall cache size. This way, unnecessary tag comparisons can be prevented and therefore, the cache energy consumption is considerably reduced. Based on the simulation results, the proposed method provides the energy reduction from 22% to 31% for 4-way–32-way set-associative L1 caches bigger than 16[Formula: see text]kB running the MiBench programs. The improvements are attained with a negligible system performance degradation compared to the traditional cache system.

APA, Harvard, Vancouver, ISO, and other styles

27

Kim, Hee Sik, J. Neggers, and Keum Sook So. "Some Aspects of -Units in BCK-Algebras." Journal of Applied Mathematics 2012 (2012): 1–10. http://dx.doi.org/10.1155/2012/141684.

Full text

Abstract:

We explore properties of the set of d-units of a -algebra. A property of interest in the study of -units in -algebras is the weak associative property. It is noted that many other -algebras, especially -algebras, are in fact weakly associative. The existence of -algebras which are not weakly associative is demonstrated. Moreover, the notions of a -integral domain and a left-injectivity are discussed.

APA, Harvard, Vancouver, ISO, and other styles

28

FAN, Ling-Jun, Yuan-Chao XU, Wei-Song SHI, Dong-Rui FAN, and Jie LOU. "Hybrid Approach of Filtering Unnecessary Way Accesses for Set-Associative Caches." Chinese Journal of Computers 36, no. 4 (March 13, 2014): 799–808. http://dx.doi.org/10.3724/sp.j.1016.2013.00799.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Haigh, Jonathan R., and Lawrence T. Clark. "High performance set associative translation lookaside buffers for low power microprocessors." Integration 41, no. 4 (July 2008): 509–23. http://dx.doi.org/10.1016/j.vlsi.2007.11.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Hanna, Michel, Socrates Demetriades, Sangyeun Cho, and Rami Melhem. "Advanced hashing schemes for packet forwarding using set associative memory architectures." Journal of Parallel and Distributed Computing 71, no. 1 (January 2011): 1–15. http://dx.doi.org/10.1016/j.jpdc.2010.10.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Chen, Xi. "Expanding the Rule Set of DNA Circuitry with Associative Toehold Activation." Journal of the American Chemical Society 134, no. 1 (December 14, 2011): 263–71. http://dx.doi.org/10.1021/ja206690a.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Levin, I. I., I. V. Pisarenko, D. V. Mikhailov, and A. I. Dordopulo. "DESCRIPTION OF GRAPHS WITH ASSOCIATIVE OPERATIONS IN SET@L PROGRAMMING LANGUAGE." IZVESTIYA SFedU. ENGINEERING SCIENCES, no. 3 (October 19, 2020): 98–111. http://dx.doi.org/10.18522/2311-3103-2020-3-98-111.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Kray, Jutta, and Ben Eppinger. "Effects of associative learning on age differences in task-set switching." Acta Psychologica 123, no. 3 (November 2006): 187–203. http://dx.doi.org/10.1016/j.actpsy.2005.12.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

BANSAL, ARVIND K. "A FRAMEWORK FOR HETEROGENEOUS ASSOCIATIVE LOGIC PROGRAMMING." International Journal on Artificial Intelligence Tools 04, no. 01n02 (June 1995): 33–53. http://dx.doi.org/10.1142/s0218213095000036.

Full text

Abstract:

Associative computation is characterized by seamless intertwining of search-by-content and data parallel computation. The search-by-content paradigm is natural to scalable high performance heterogeneous computing since the use of tagged data avoids the need for explicit addressing mechanisms. In this paper, the author presents an algebra for associative logic programming, an associative resolution scheme, and a generic framework of an associative abstract instruction set. The model is based on the integration of data alignment and the use of two types of bags: data element bags and filter bags of Boolean values to select and restrict computation on data elements. The use of filter bags integrated with data alignment reduces computation and data transfer overhead, and the use of tagged data reduces overhead of preparing data before data transmission. The abstract instruction set has been illustrated by an example. Performance results are presented for a simulation in a homogeneous address space.

APA, Harvard, Vancouver, ISO, and other styles

35

Urcid, Gonzalo, Rocío Morales-Salgado, and Nieves-VázquezsJosé-Angel. "Multivariate Data Retrieval Modified by Random Noise using Lattice Autoassociative Memories with Eroded or Dilated Input Residuals." MATEC Web of Conferences 292 (2019): 04007. http://dx.doi.org/10.1051/matecconf/201929204007.

Full text

Abstract:

Lattice associative memories were proposed as an alternative approach to work with a set of associated vector pairs for which the storage and retrieval stages are based in the theory of algebraic lattices. Several techniques have been established to deal with the problem of binary or real valued vector recall from corrupted inputs. This paper presents a thresholding technique coupled with statistical correlation pattern index search to enhance the recall performance of lattice auto-associative memories for multivariate data inputs degraded by random noise. By thresholding a given noisy input, a lower bound is generated to produce an eroded noisy version used to boost the min-lattice auto-associative memory inherent retrieval capability. Similarly, an upper bound is generated to obtain a dilated noisy version used to enhance the max-lattice auto-associave memory response. A self contained theoretical foundation is provided including a visual example of a multivariate data set composed of grayscale images that show the increased retrieval capability of this type of associative memories.

APA, Harvard, Vancouver, ISO, and other styles

36

Cañs, José Juan, and Maria Teresa Bajo. "Strategic Associative Priming in the Lexical Decision Task." Quarterly Journal of Experimental Psychology Section A 47, no. 2 (May 1994): 383–405. http://dx.doi.org/10.1080/14640749408401117.

Full text

Abstract:

Two experiments explore the nature of prelexical expectancy processes in the lexical decision task. The strength of the prime-target relationship and the size of the associative set defined by the prime were manipulated in both experiments. In Experiment 1, the proportion of strong relative to weak primes induced subjects to include strong and weak candidate words in their expectancy set, whereas in Experiment 2 that proportion attempted to induce subjects to include mainly strongly related words. Results showed that priming depended on whether the primes were included in the set. Thus, in Experiment 1 facilitation was obtained for both strong and weak primes, whereas in Experiment 2 the facilitation of weak primes depended on the size of the associative set defined by the prime. Results are discussed within a theoretical framework that includes prelexical expectancy processes in the lexical decision task.

APA, Harvard, Vancouver, ISO, and other styles

37

Gavrylkiv, Volodymyr M. "Automorphism groups of semigroups of upfamilies." Asian-European Journal of Mathematics 13, no. 05 (April 4, 2019): 2050099. http://dx.doi.org/10.1142/s1793557120500990.

Full text

Abstract:

A family [Formula: see text] of nonempty subsets of a set [Formula: see text] is called an upfamily if for each set [Formula: see text] any set [Formula: see text] belongs to [Formula: see text]. The extension [Formula: see text] of [Formula: see text] consists of all upfamilies on [Formula: see text]. Any associative binary operation [Formula: see text] can be extended to an associative binary operation [Formula: see text]. In the paper, we study automorphisms of extensions of groups, finite monogenic semigroups, null semigroups, right zero semigroups and left zero semigroups. Also, we describe the automorphism groups of extensions of some semigroups of small cardinalities.

APA, Harvard, Vancouver, ISO, and other styles

38

Ni, Lili, and Yuqun Chen. "A new Composition-Diamond lemma for associative conformal algebras." Journal of Algebra and Its Applications 16, no. 05 (April 12, 2017): 1750094. http://dx.doi.org/10.1142/s0219498817500943.

Full text

Abstract:

Let [Formula: see text] be the free associative conformal algebra generated by a set [Formula: see text] with a bounded locality [Formula: see text]. Let [Formula: see text] be a subset of [Formula: see text]. A Composition-Diamond lemma for associative conformal algebras is first established by Bokut, Fong and Ke in 2004 [L. A. Bokut, Y. Fong and W.-F. Ke, Composition-Diamond Lemma for associative conformal algebras, J. Algebra 272 (2004) 739–774] which claims that if (i) [Formula: see text] is a Gröbner–Shirshov basis in [Formula: see text], then (ii) the set of [Formula: see text]-irreducible words is a linear basis of the quotient conformal algebra [Formula: see text], but not conversely. In this paper, by introducing some new definitions of normal [Formula: see text]-words, compositions and compositions to be trivial, we give a new Composition-Diamond lemma for associative conformal algebras, which makes the conditions (i) and (ii) equivalent. We show that for each ideal [Formula: see text] of [Formula: see text], [Formula: see text] has a unique reduced Gröbner–Shirshov basis. As applications, we show that Loop Virasoro Lie conformal algebra and Loop Heisenberg–Virasoro Lie conformal algebra are embeddable into their universal enveloping associative conformal algebras.

APA, Harvard, Vancouver, ISO, and other styles

39

Pandey, Ankita, and Sanjay Sharma. "Different access mechanisms for set-associative cache architecture for reduced power consumption." International Journal of Electronics Letters 1, no. 3 (September 2013): 142–50. http://dx.doi.org/10.1080/21681724.2013.828269.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Wu, C. E., Yarsun Hsu, and Yew-Huey Liu. "Efficient stack simulation for set-associative virtual address caches with real tags." IEEE Transactions on Computers 44, no. 5 (May 1995): 719–23. http://dx.doi.org/10.1109/12.381961.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Jamilov, Uygun, and Manuel Ladra. "F-evolution algebra." Filomat 30, no. 10 (2016): 2637–52. http://dx.doi.org/10.2298/fil1610637j.

Full text

Abstract:

We consider the evolution algebra of a free population generated by an F-quadratic stochastic operator. We prove that this algebra is commutative, not associative and necessarily power-associative. We show that this algebra is not conservative, not stationary, not genetic and not train algebra, but it is a Banach algebra. The set of all derivations of the F-evolution algebra is described. We give necessary conditions for a state of the population to be a fixed point or a zero point of the F-quadratic stochastic operator which corresponds to the F-evolution algebra. We also establish upper estimate of the ?-limit set of the trajectory of the operator. For an F-evolution algebra of Volterra type we describe the full set of idempotent elements and the full set of absolute nilpotent elements.

APA, Harvard, Vancouver, ISO, and other styles

42

Schurr, Amos, and Ido Erev. "The effect of base rate, careful analysis, and the distinction between decisions from experience and from description." Behavioral and Brain Sciences 30, no. 3 (June 2007): 281. http://dx.doi.org/10.1017/s0140525x07001896.

Full text

Abstract:

AbstractBarbey & Sloman (B&S) attribute base-rate neglect to associative processes (like retrieval from memory) that fail to adequately represent the set structure of the problem. This commentary notes that associative responses can also lead to base-rate overweighting. We suggest that the difference between the two patterns is related to the distinction between decisions from experience and decisions from description.

APA, Harvard, Vancouver, ISO, and other styles

43

Ebanks, Bruce R. "Quasi-homogeneous associative functions." International Journal of Mathematics and Mathematical Sciences 21, no. 2 (1998): 351–57. http://dx.doi.org/10.1155/s0161171298000489.

Full text

Abstract:

A triangular norm is a special kind of associative function on the closed unit interval[0,1]. Triangular norms (ort-norms) were introduced in the context of probabilistic metric space theory, and they have found applications also in other areas, such as fuzzy set theory. We determine the explicit forms of allt-norms which satisfy a generalized homogeneity property called quasi-homogeneity.

APA, Harvard, Vancouver, ISO, and other styles

44

Felix A. and Dhivya A. D. "An Optimized Intuitionistic Fuzzy Associative Memories (OIFAM) to Identify the Complications of Type 2 Diabetes Mellitus (T2DM)." International Journal of Fuzzy System Applications 9, no. 3 (July 2020): 22–41. http://dx.doi.org/10.4018/ijfsa.2020070102.

Full text

Abstract:

Fuzzy associative memories (FAM) is a recurrent neural network, consisting of two layers. Since points of the fuzzy set are defined in a cube, it maps between cubes. That is, it maps from input fuzzy set into an output fuzzy set. While the input layer is deliberated as the cause infusing agent the output layer influences the requisite effect. It is a powerful technique to analyze the cause and effect of any problem. Determining the most influential factors in the cause and effect group of any problem is a challenging task. To quench such a task, this present study constructs an optimized intuitionistic fuzzy associative memory using an intuitionistic fuzzy set and a variance of fitness formula. To check the validity of the proposed model, Type 2 diabetes mellitus is taken for diagnosing the early complications of T2DM patients from the risk factors.

APA, Harvard, Vancouver, ISO, and other styles

45

Mauri, Caterina, and Andrea Sansò. "Nouns & co. Converging evidence in the analysis of associative plurals." STUF - Language Typology and Universals 72, no. 4 (November 26, 2019): 603–26. http://dx.doi.org/10.1515/stuf-2019-0023.

Full text

Abstract:

Abstract A morphosyntactic peculiarity that separates proper names from (most) other noun types is their ability to occur in a special type of plural, called associative plural, whose meaning is X and X’s associated person(s). In this paper, we apply a ‘converging evidence’ methodology to the analysis of associative plurals, by providing a diachronic typology of these plurals through the identification of the more frequent sources of associative plural markers that are attested in a sample of 80 languages, and by looking for emerging constructions for the expression of associative plurality in two corpora of English and Italian, two languages that do not have a grammaticalized way to encode this type of plurality. The analysis will show that associative plurals are likely to grammaticalize from a restricted pool of synchronic sources, and that these sources are mostly indexical sources and sources denoting the plural set, in accordance with the special semantics and referential properties of proper names.

APA, Harvard, Vancouver, ISO, and other styles

46

Al-Taq, Ali A., Hisham A. Nasr-El-Din, Jimmy K. Beresky, Khalid M. Al-Naimi, Leopoldo Sierra, and Larry S. Eoff. "Simultaneous Acid Diversion and Water Control in Carbonate Reservoirs: A Case History From Saudi Arabia." SPE Reservoir Evaluation & Engineering 11, no. 05 (October 1, 2008): 882–91. http://dx.doi.org/10.2118/106951-pa.

Full text

Abstract:

Summary Matrix acidizing and water control are usually addressed as two separate issues. Associative polymers can be used to simultaneously achieve effective acidizing and water control during a single treatment. A polymer-based treatment was applied in an offshore, perforated vertical well with two sets of perforations in a carbonate reservoir in Saudi Arabia. The acid treatment was needed to restore the productivity of the upper set of perforations and reduce water production from the lower set of perforations. Experimental studies were carried out to investigate the potential use of associative polymers to control water mobility and act as an acid diverter. Coreflood experiments were conducted on reservoir cores at downhole conditions (temperature of 200°F and pressure of 3,500 psi). Extensive laboratory testing showed that associative polymers had no significant effect on the relative permeability to oil. However, the relative permeability to water was significantly reduced. This paper presents a case history where an associative polymer was applied during matrix acid treatment of a damaged well. The treatment included two stages of associative polymer solutions and 20 wt% HCl with additives. Post-stimulation treatment production data showed that oil rate increased 11.18-fold, whereas water rate decreased 1.7-fold, resulting in a reduction in the water cut from 75 to 14 vol%. The production logging tool (PLT) results indicated that the associative polymer was effective in diverting the acid into the oil producing zone. The upper set of perforations was producing most of the fluid, which further confirmed that the associative polymer significantly reduced water production from the lower zone. Introduction Matrix acidizing and water control are two important treatments conducted to enhance well performance. These treatments are commonly addressed as two separate issues. Associative polymers can be used to simultaneously achieve effective acidizing and water control utilizing a single treatment (Eoff et al. 2005). Acid diversion is an important issue contributing to the success of any matrix acid stimulation treatment. For this reason, extensive laboratory studies and field applications have been performed on several acid diverting agents as reported in the literature. Among the techniques that have been applied to improve acid coverage are: mechanical (packers, ball sealers, and particulate diverting agents) and chemicals (foam, polymers, and in-situ-gelled fluids). More recently, viscoelastic surfactants have been used extensively for diversion during matrix acid treatments, and have shown a tendency to reduce water production as reported by Nasr-El-Din et al. (2006). Relative permeability modifiers, commonly used for water control, can also be utilized for acid diversion. They can act simultaneously to enhance diversion during matrix acid treatments and impair water mobility. Eoff et al. (2005) presented laboratory and field tests, which showed that associative polymers could provide both goals in sandstone reservoirs. However, a few studies considered application of associative polymers to divert and control water production in carbonate formations. Therefore, the objectives of the present study are to:assess the effectiveness of associative polymers in reducing brine permeability in carbonate cores,design a polymer-based treatment to control water and divert acid in matrix treatments, andevaluate the use of associative polymers based on field application. This paper presents laboratory data that support the use of this new technology in carbonate reservoirs. It will also give for the first time field results on the application of associative polymers in a carbonate reservoir in Saudi Arabia. Field data were in good agreement with laboratory results.

APA, Harvard, Vancouver, ISO, and other styles

47

Niebrzydowski, Maciej, Agata Pilitowska, and Anna Zamojska-Dzienio. "Knot-theoretic flocks." Journal of Knot Theory and Its Ramifications 29, no. 05 (March 23, 2020): 2050026. http://dx.doi.org/10.1142/s0218216520500261.

Full text

Abstract:

We characterize the para-associative ternary quasi-groups (flocks) applicable to knot theory, and show which of these structures are isomorphic. We enumerate them up to order 64. We note that the operation used in knot-theoretic flocks has its non-associative version in extra loops. We use a group action on the set of flock colorings to improve the cocycle invariant associated with the knot-theoretic flock (co)homology.

APA, Harvard, Vancouver, ISO, and other styles

48

Abdelhamid, Neda, Aladdin Ayesh, and Wael Hadi. "Multi-Label Rules Algorithm Based Associative Classification." Parallel Processing Letters 24, no. 01 (March 2014): 1450001. http://dx.doi.org/10.1142/s0129626414500017.

Full text

Abstract:

Current associative classification (AC) algorithms generate only the most obvious class linked with a rule in the training data set and ignore all other classes. We handle this problem by proposing a learning algorithm based on AC called Multi-label Classifiers based Associative Classification (MCAC) that learns rules associated with multiple classes from single label data. MCAC algorithm extracts classifiers from the whole training data set discovering all possible classes connected with a rule as long as they have sufficient training data representation. Another distinguishing feature of the MCAC algorithm is the classifier building method that cuts down the number of rules treating one known problem in AC mining which is the exponential growth of rules. Experimentations using real application data related to a complex scheduling problem known as the trainer timetabling problem reveal that MCAC's predictive accuracy is highly competitive if contrasted with known AC algorithms.

APA, Harvard, Vancouver, ISO, and other styles

49

Gulistan, Muhammad, Shah Nawaz, and Nasruddin Hassan. "Neutrosophic Triplet Non-Associative Semihypergroups with Application." Symmetry 10, no. 11 (November 8, 2018): 613. http://dx.doi.org/10.3390/sym10110613.

Full text

Abstract:

In this paper, we extended the idea of a neutrosophic triplet set to non-associative semihypergroups and define neutrosophic triplet LA-semihypergroup. We discuss some basic results and properties. At the end, we provide an application of the proposed structure in Football.

APA, Harvard, Vancouver, ISO, and other styles

50

Belim, S. V., T. B. Smirnova, and A. N. Mironenko. "A graph-graph approach to the analysis of the set of associative rules." Journal of Physics: Conference Series 944 (January 2018): 012013. http://dx.doi.org/10.1088/1742-6596/944/1/012013.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Set-Associative'

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