Sélection de la langue

Search

Sommaire du brevet 1334985 

Énoncé de désistement de responsabilité concernant l'information provenant de tiers

Une partie des informations de ce site Web a été fournie par des sources externes. Le gouvernement du Canada n'assume aucune responsabilité concernant la précision, l'actualité ou la fiabilité des informations fournies par les sources externes. Les utilisateurs qui désirent employer cette information devraient consulter directement la source des informations. Le contenu fourni par les sources externes n'est pas assujetti aux exigences sur les langues officielles, la protection des renseignements personnels et l'accessibilité.

Disponibilité de l'Abrégé et des Revendications

L'apparition de différences dans le texte et l'image des Revendications et de l'Abrégé dépend du moment auquel le document est publié. Les textes des Revendications et de l'Abrégé sont affichés :

  • lorsque la demande peut être examinée par le public;
  • lorsque le brevet est émis (délivrance).
(12) Brevet: (11) CA 1334985
(21) Numéro de la demande: 1334985
(54) Titre français: BULLETINS DE VOTE ET METHODE D'IMPRESSION DE BULLETINS DE VOTE
(54) Titre anglais: BALLOT SETS AND METHOD OF PRINTING BALLOTS
Statut: Durée expirée - après l'octroi
Données bibliographiques
Abrégés

Abrégé anglais


A set of ballots is provided, each ballot having a
number of names marked on it. In one embodiment, the
positions of the names vary from ballot to ballot so that each
name appears in a given location on generally an equal number
of ballots in the set. In another embodiment of the
invention, the sequence of names also varies from ballot to
ballot so that any name appears adjacent another name on
generally an equal number of ballots in the set. Methods are
provided for producing such sets of ballots.

Revendications

Note : Les revendications sont présentées dans la langue officielle dans laquelle elles ont été soumises.


THE EMBODIMENTS OF THE INVENTION IN WHICH AN EXCLUSIVE
PROPERTY OR PRIVILEGE IS CLAIMED ARE DEFINED AS FOLLOWS:
1. A set of ballots, each said ballot having a
plurality of names marked thereon, each of said names being in
a different discrete location and each of said names appearing
in each of said discrete locations on generally an equal
number of ballots in said set.
2. A set of ballots according to claim 1 wherein each
of said names appears adjacent each other of said names on
generally an equal number of ballots in said set.
3. A set of ballots, each ballot having a plurality of
discrete locations for names, one location for each name, a
name in each location, each name appearing generally an equal
number of times in each said location, whereby to reduce the
effect of possible voter tendency to check a particular
location such as the top of the ballot when a voter marks a
said ballot.
4. A set of ballots according to claim 3 wherein the
order of names in said set is varied such that each of said
names appears adjacent each other of said names generally an
equal number of times in the ballots in said set, whereby to
reduce the effect of possible voter tendency to avoid or
prefer names adjacent to a given name.

5. A method of producing sets of ballots in which the
names of candidates appear in different arrangements, said
method comprising the steps of:
i) generating the desired arrangements of names;
ii) printing ballots corresponding to each of said
arrangements of names;
iii) collating said ballots into groups having one ballot
representing each of said arrangements; and,
iv) compiling a desired number of said groups of ballots
into sets of ballots.
6. A method of producing sets of ballots in which the
names of candidates appear in different arrangements, said
method comprising the steps of:
i) generating the desired arrangements of names;
ii) printing ballots corresponding to each said arrangement
of names;
iii) putting a ballot corresponding to each said arrangement
into a set; and,
iv) repeating step 3 above until said set contains a desired
number of ballots.
7. A method of producing sets of ballots in which the
names of candidates appear in different arrangements, said
method comprising the steps of:
i) generating the desired arrangements of names;
ii) printing a ballot according to one of said arrangements;

iii) printing a ballot according to another of said
arrangements;
iv) repeating step 3 until all of said arrangements are
exhausted;
v) repeating steps 1 through 4 until a desired number of
ballots has been printed; and,
vi) compiling said ballots into a set.
8. A method according to claim 5, 6 or 7 wherein each
ballot has a plurality of discrete locations, one for each
name, and said desired arrangement is such that each name
appears substantially an equal number of times in each
location.
9. A method according to claim 5, 6 or 7 wherein each
ballot has a plurality of discrete locations, one for each
name, and said desired arrangement is such that each name
appears substantially an equal number of times in each
location, and in addition each of said names appears adjacent
each other of said names generally an equal number of times.

Description

Note : Les descriptions sont présentées dans la langue officielle dans laquelle elles ont été soumises.


133 198~
-
FIELD OF THE I~V~ ON
This invention relates generally to improvements in
ballots for use in the electoral process and a method for
producing such ballots.
BACKGROUND OF THE l~v~ ION
Studies have shown that a large percentage of voters
who are ill-informed as to the candidates in an election tend
to mark the names listed toward the top of the ballot, rather
than those listed toward the bottom. This frustrates the
democratic process as persons whose names appear at the top of
the list are preferentially selected over those whose names
appear at the bottom. Since many elections are won or lost by
only a few votes, the bias introduced by this effect can be
major. Furthermore, candidates names are not infrequently
listed alphabetically on ballots. Accordingly, persons whose
last names begin with, for example, the letters A or B would
have their names appearing toward the top of the ballot and
would tend to be preferentially picked by ill-advised voters
over persons whose names begin, for example, with the letters
T or W.
Ill-advised voters further tend to be influenced not
only by the position of a candidate's name relative to the
ballot but also relative to the other names on the ballot. For
example, if there is one outstanding candidate, voters tend to
prefer candidates whose names are adjacent that outstanding
candidate. Similarly, if there is a particular candidate

- 2 - 1334985
which a majority of voters would tend to avoid, ill-informed
voters would tend also not to choose a candidate whose name
appears adjacent to the one being avoided.
SUMMARY OF THE INvh~ ON
The present invention provides a bundle of ballots,
each said ballot having a plurality of names marked thereon,
each said name being in a discrete location and each said name
appearing in each of said discrete locations on generally an
equal number of ballots in said bundle.
According to one embodiment of the present
invention, there is provided a method of producing sets of
ballots in which the names of candidates appear in different
arrangements, said method comprising the steps of:
i) generating the desired arrangements of names;
ii) printing ballots corresponding to each of said
arrangements of names;
iii) collating said ballots into groups having one ballot
representing each of said arrangements; and,
iv) compiling a desired number of said groups of ballots
into sets of ballots.
According to another embodiment of the present
invention, there is provided a method of producing bundles of
ballots in which the names of candidates appear in different
arrangements, said method comprising the steps of:
i) generating the desired arrangements of names;
ii) printing ballots corresponding to each said arrangement
of names;

~ 3 ~ 1 33~g 8~
iii) putting a ballot corresponding to each said arrangement
into a bundle; and,
iv) repeating step 3 above until said bundle contains a
desired number of ballots.
According to yet another embodiment of the present
invention, there is provided a method of producing sets of
ballots in which the names of candidates appear in different
arrangements, said method comprising the steps of:
i) generating the desired arrangements of names;
ii) printing a ballot according to one of said arrangements;
iii) printing a ballot according to another of said
arrangements;
iv) repeating step 3 until all of said arrangements are
exhausted;
v) repeating steps 1 through 4 until a desired number of
ballots has been printed; and,
vi) compiling said ballots into a set.
BRIEF DESCRIPTION OF THE DRAWINGS
For a better understanding of the present invention,
and to show more clearly how it may be carried into effect,
reference will now be made, by way of example, to the
accompanying drawings, which show preferred embodiments of the
present invention and in which:
Figure 1 illustrates the front of four individual
ballots of a bundle of ballots according to the present
invention;

- 133~985
Figure 2 illustrates six ballots of a bundle of
ballots according to a further embodiment of the present
invention; and,
Figure 3 is a diagramatical representation of a
system for carrying out a method according to the present
invention.
DESCRIPTION OF PREFERRED EMBODIMENTS OF THE PRESENT I~V~ ON
Referring to Figure 1, there are shown four ballots
identified by reference numbers 10, 12, 14 and 16. Each
ballot is divided into two adjacent columns, 18 and 20
respectively. The columns are divided into four rows, 22, 24,
26 and 28 respectively.
The rows 22 through 28 of the columns 18 each
contain one of the letters A, B, C, or D marked thereon. Each
of these letters denotes the name of a different candidate on
the ballot. Each row 22, 24, 26 and 28 of column 18 on each
ballot 10, 12, 14 and 16, represents a different discrete
location on the ballot. Rows 22, 24, 26 and 28 of column 20
are left blank for insertion of a mark by the voter to
indicate which candidate they have selected.
Comparing ballot 10 to ballot 12, it can be seen
that the last three letters of ballot 10, namely, B, C and D,
have been shifted one row upward to the position in ballot 12
and the first letter, A, has been shifted from the top row to
the bottom row. This pattern of shifting the last three
letters upward one row and moving the letter occupying the top

- 1334985
-
row to the bottom row is further repeated in going from ballot
12 to ballot 14 and again from ballot 14 to ballot 16. In
this manner, each of the letters A, B, C and D appears once in
each of the discrete locations defined by rows 22, 24, 26 and
28 of column 18 in this group of four ballots. Each bundle of
ballots would contain an equal number of ballots according to
ballot number 10, 12, 14 and 16 arranged in sequential order.
As each candidate's name appears on the top of a ballot, an
equal number of times, the names in effect rotate on the
ballot. This eleminates any bias caused by the unconscious
tendency of the ill-informed to select the candidate whose
name appears at the top of the ballot.
Although only four letters, each of which represents
a candidate's name, are illustrated on the ballots of Figure
1, it will be appreciated that this system is readily
adaptable to any number of candidates' names.
Referring still to Figure 1, it can be seen that
despite the rotation of names, the sequential order of names
remains the same. For example, the letter C is always
adjacent at least one of the letters B or D and is never
adjacent the letter A. Similarly, the letter A is always
adjacent one of the letters D or B and never adjacent the
letter C, and so forth. Accordingly, if the candidate whose
name is represented by the letter A would be particularly
undesirable to a large number of voters, and if ill-informed
voters are disinclined to select a candidate whose name
appears adjacent the name of this undesirable candidate, then

- 6 - 133~9~5
such ill-informed voters would be more inclined to pick the
candidate represented by the letter C over either of the
candidates represented by letters D or B respectively. In
this manner, the candidate represented by letter C has an
unfair advantage over the candidate represented by letters B
or D respectively.
Figure 2 illustrates six ballots, 32, 34, 36, 38, 40
and 42 respectively, each of which has a different sequence of
candidates' names represented by letters A, B, C and D,
thereon. In the six ballots, the letter A appears adjacent
each of the remaining letters B, C and D two times.
If each of the six sequences shown on ballots 32,
34, 36, 38, 40 and 42 is rotated four times as discussed above
concerning the ballots of Figure 1, twenty-four ballots will
be produced in which each candidate's name will occupy a given
one of the four rows 22, 24, 26, or 28 of column 18 an equal
number of times and as well, each candidate's name will be
adjacent another candidate's name an equal number of times.
The set of ballots will contain an equal number of each of
these twenty- four different ballots.
Sets of ballots, according to the present invention,
can be produced by separately printing batches of ballots
corresponding to each desired arrangement of names and
subsequently collating the ballots into groups. In each
group, each ballot representing a different arrangement. With
this method, any desired number of groups can be compiled to
form a set of ballots containing a desired number of ballots.

133~985
Alternatively, the ballots can be printed
sequentially with each subsequent ballot having a different
arrangement of names thereon until all of the permutations
have been exhausted at which point the cycle would again be
repeated. One way of accomplishing this latter method is to
program the sequence of names into a computer which controls a
printer, such as a laser printer. The computer would then
drive the laser printer to print out the ballots in sequence.
A further refinement of the latter method is, as
diagrammatically indicated in Figure 3, to enter an
appropriate program 50 into a computer 52 which is connected
to a printer (e.g. a laser printer) 54. The program 50
functions such that when a series of names is entered into a
computer, the program arranges the names in all possible
combinations, as shown in Figure 2, so that each name appears
adjacent each other name an equal number of times. The
program then causes the names to be rotated so that in
addition, each name appears in each location generally an
equal number of times.
The computer then directs the printer 54 to print
sets of ballots meeting the above explained criteria. The
sets of ballots emerge into a paper tray 56 and are repeated
until a desired number of ballots has been printed.
Variations and modifications to the present
invention may be apparent to one skilled in the art without
departing from the spirit and scope of the present invention.

Dessin représentatif
Une figure unique qui représente un dessin illustrant l'invention.
États administratifs

2024-08-01 : Dans le cadre de la transition vers les Brevets de nouvelle génération (BNG), la base de données sur les brevets canadiens (BDBC) contient désormais un Historique d'événement plus détaillé, qui reproduit le Journal des événements de notre nouvelle solution interne.

Veuillez noter que les événements débutant par « Inactive : » se réfèrent à des événements qui ne sont plus utilisés dans notre nouvelle solution interne.

Pour une meilleure compréhension de l'état de la demande ou brevet qui figure sur cette page, la rubrique Mise en garde , et les descriptions de Brevet , Historique d'événement , Taxes périodiques et Historique des paiements devraient être consultées.

Historique d'événement

Description Date
Inactive : Périmé (brevet sous l'ancienne loi) date de péremption possible la plus tardive 2012-03-28
Inactive : Lettre officielle 2007-02-13
Inactive : Paiement correctif - art.78.6 Loi 2007-01-24
Inactive : Grandeur de l'entité changée 2002-04-05
Inactive : TME en retard traitée 2000-03-24
Lettre envoyée 1999-03-29
Accordé par délivrance 1995-03-28

Historique d'abandonnement

Il n'y a pas d'historique d'abandonnement

Titulaires au dossier

Les titulaires actuels et antérieures au dossier sont affichés en ordre alphabétique.

Titulaires actuels au dossier
HARVEY TENENBAUM
JUDITH TENENBAUM
Titulaires antérieures au dossier
S.O.
Les propriétaires antérieurs qui ne figurent pas dans la liste des « Propriétaires au dossier » apparaîtront dans d'autres documents au dossier.
Documents

Pour visionner les fichiers sélectionnés, entrer le code reCAPTCHA :



Pour visualiser une image, cliquer sur un lien dans la colonne description du document (Temporairement non-disponible). Pour télécharger l'image (les images), cliquer l'une ou plusieurs cases à cocher dans la première colonne et ensuite cliquer sur le bouton "Télécharger sélection en format PDF (archive Zip)" ou le bouton "Télécharger sélection (en un fichier PDF fusionné)".

Liste des documents de brevet publiés et non publiés sur la BDBC .

Si vous avez des difficultés à accéder au contenu, veuillez communiquer avec le Centre de services à la clientèle au 1-866-997-1936, ou envoyer un courriel au Centre de service à la clientèle de l'OPIC.

({010=Tous les documents, 020=Au moment du dépôt, 030=Au moment de la mise à la disponibilité du public, 040=À la délivrance, 050=Examen, 060=Correspondance reçue, 070=Divers, 080=Correspondance envoyée, 090=Paiement})


Description du
Document 
Date
(aaaa-mm-jj) 
Nombre de pages   Taille de l'image (Ko) 
Revendications 1995-04-06 3 83
Abrégé 1995-04-06 1 15
Dessins 1995-04-06 2 26
Dessins représentatifs 2003-03-20 1 4
Description 1995-04-06 7 245
Avis concernant la taxe de maintien 1999-04-25 1 179
Avis concernant la taxe de maintien 1999-04-25 1 179
Quittance d'un paiement en retard 2000-04-02 1 171
Taxes 2003-03-19 1 33
Taxes 2002-03-26 1 31
Taxes 2000-03-23 1 54
Taxes 2001-03-26 1 28
Taxes 1998-02-01 1 51
Taxes 2000-03-23 1 50
Taxes 2004-02-09 1 36
Taxes 2005-03-13 1 30
Taxes 2006-03-27 1 36
Correspondance 2006-07-20 3 131
Correspondance 2007-02-12 1 13
Taxes 1997-03-23 1 56
Correspondance de la poursuite 1992-06-16 2 35
Correspondance reliée au PCT 1995-01-08 2 103
Demande de l'examinateur 1992-02-16 1 51